Related papers: On the HJY Gap Conjecture in CR geometry vs. the S…
We established a hyperplane restriction theorem for the local holomorphic mappings between projective spaces, which is inspired by the corresponding theorem of Green for homogeneous ideals in polynomial rings. Our theorem allows us to give…
Using elementary number theory, we prove several results about the complexity of CR mappings between spheres. It is known that CR mappings between spheres, invariant under finite groups, lead to sharp bounds for degree estimates on real…
It is a classical problem in algebraic geometry to characterize the algebraic subvariety by using the Gauss map. In this note, we try to develop the analogue theory in CR geometry. In particular, under some assumptions, we show that a CR…
Let $z\in\mathbb C^n$ and $\|z\|$ be its Euclidean norm. Ebenfelt proposed a conjecture regarding the possible ranks of the Hermitian polynomials in $z,\bar z$ of the form $A(z,\bar z)\|z\|^2$, known as the SOS Conjecture, where SOS stands…
The goal of this article is to prove the Sum of Squares Conjecture for real polynomials $r(z,\bar{z})$ on $\mathbb{C}^3$ with diagonal coefficient matrix. This conjecture describes the possible values for the rank of $r(z,\bar{z}) \|z\|^2$…
The CR analogue of B.-Y. Chen's conjecture on pseudo biharmonic maps will be shown. Pseudo biharmonic, but not pseudo harmonic, isometric immersions with parallel pseudo mean curvature vector fields, will be characterized. Several examples…
Recently continuous rational maps between real algebraic varieties have attracted the attention of several researchers. In this paper we continue the investigation of approximation properties of continuous rational maps with values in…
In order to obtain the best-known guarantees, algorithms are traditionally tailored to the particular problem we want to solve. Two recent developments, the Unique Games Conjecture (UGC) and the Sum-of-Squares (SOS) method, surprisingly…
Some sum of squares (SOS) polynomials admit decomposition certificates, or positive semidefinite Gram matrices, with additional structure. In this work, we use the structure of Gram matrices to relate the representation theory of $SL(2)$ to…
After Chern's conjecture on the discreteness of the constant scalar curvatures of compact minimal submanifolds $M^n$ in unit spheres $\mathbb{S}^{n+q}$, Z. Q. Lu proposed a conjecture regarding the second gap, based on his ingenious…
It is shown that a formal mapping between two real-analytic hypersurfaces in complex space is convergent provided that neither hypersurface contains a nontrivial holomorphic variety. For higher codimensional generic submanifolds,…
In this paper we consider the relationship between monomial-size and bit-complexity in Sums-of-Squares (SOS) in Polynomial Calculus Resolution over rationals (PCR/$\mathbb{Q}$). We show that there is a set of polynomial constraints $Q_n$…
We study the polynomial optimization problem of minimizing a multihomogeneous polynomial over the product of spheres. This polynomial optimization problem models the tensor optimization problem of finding the best rank one approximation of…
In 2017, He [Proc. Amer. Math. Soc. 145 (2017), 501--508] established two spuercongruences on truncated hypergeometric series and further proposed two related conjectures. Subsequently, Liu [Results Math. 72 (2017), 2057--2066] extended…
We prove the filling area conjecture in the hyperelliptic case. In particular, we establish the conjecture for all genus 1 fillings of the circle, extending P. Pu's result in genus 0. We translate the problem into a question about closed…
We derive Mok-Siu-Yeung type formulas for horizontal maps from compact contact locally sub-symmetric spaces into strictly pseudoconvex CR manifolds and we obtain some rigidity theorems for the horizontal pseudoharmonic maps.
In this paper, we extend our result in [3] to hypersurfaces of any smooth projective variety $Y$. Precisely we let $X_0$ be a generic hypersurface of $Y$ and $c_0:\mathbf P^1\to X_0$ be a generic birational morphism to its image, i.e.…
Given an $\mathcal{H}$-polytope $P$ and a $\mathcal{V}$-polytope $Q$, the decision problem whether $P$ is contained in $Q$ is co-NP-complete. This hardness remains if $P$ is restricted to be a standard cube and $Q$ is restricted to be the…
Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…
In this article, we are interested in developing polynomial decomposition techniques based on sums-of-squares (SOS), namely the difference-of-sums-of-squares (D-SOS) and the difference-of-convex-sums-of-squares (DC-SOS). In particular, the…