Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Function obstruction to the Existence of Complex Structures
160
0
0.0
(
0
)
Authors
Jun Ling
Ask ChatGPT about the research
No Arabic abstract
We construct a function for almost-complex Riemannian manifolds. Non-vanishing of the function for the almost-complex structure implies the almost-complex structure is not integrable. Therefore the constructed function is an obstruction for the existence of complex structures from the almost-complex structure. It is a function, not a tensor, so it is easier to work with.
rate research
Read More
There is error in (2.1). I am very sorry for inconvenience.
This paper proves that there does not exist a polynomial-time algorithm to the the subset sum problem. As this problem is in NP, the result implies that the class P of problems admitting polynomial-time algorithms does not equal the class NP of problems admitting nondeterministic polynomial-time algorithms.
We define the eigenderivatives of a linear operator on any real or complex Banach space, and give a sufficient condition for their existence.
Let $ xgeq 1 $ be a large number, let $ [x]=x-{x} $ be the largest integer function, and let $ varphi(n)$ be the Euler totient function. The result $ sum_{nleq x}varphi([x/n])=(6/pi^2)xlog x+Oleft ( x(log x)^{2/3}(loglog x)^{1/3}right ) $ was proved very recently. This note presents a short elementary proof, and sharpen the error term to $ sum_{nleq x}varphi([x/n])=(6/pi^2)xlog x+O(x) $. In addition, the first proofs of the asymptotics formulas for the finite sums $ sum_{nleq x}psi([x/n])=(15/pi^2)xlog x+O(xlog log x) $, and $ sum_{nleq x}sigma([x/n])=(pi^2/6)xlog x+O(x log log x) $ are also evaluated here.
The purpose of this paper is to describe and elaborate the philosophical ideas behind hyperstructures and structure formation in general and emphasize the key ideas of the Hyperstructure Program.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
