Related papers: Complexity results for CR mappings between spheres
We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number of distinct monomials for dimensions 2 and 3. We study the connection with monomial CR maps of hyperquadrics and prove similar bounds in this setup…
We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number of nonnegative distinct monomials. This bound was conjectured by John P. D'Angelo, proved in two dimensions by D'Angelo, Kos and Riehl and in three…
We make several new contributions to the study of proper holomorphic mappings between balls. Our results include a degree estimate for rational proper maps, a new gap phenomenon for convex families of arbitrary proper maps, and an…
We construct group-invariant CR maps from the unit sphere in $\mathbb{C}^3$ and provide sharp bounds for the gap termination in this setting.
We consider proper holomorphic maps of ball complements and differences in complex euclidean spaces of dimension at least two. Such maps are always rational, which naturally leads to a related problem of classifying rational maps taking…
We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…
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,…
We show that the Huang-Ji-Yin (HJY) Gap Conjecture concerning CR mappings between spheres follows from a conjecture regarding Sums of Squares (SOS) of polynomials. The connection between the two problems is made by the CR Gauss equation and…
In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…
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…
Using Green's hyperplane restriction theorem, we prove that the rank of a Hermitian form on the space of holomorphic polynomials is bounded by a constant depending only on the maximum rank of the form restricted to affine manifolds. As an…
We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…
A venerable problem in combinatorics and geometry asks whether a given incidence relation may be realized by a configuration of points and lines. The classic version of this would ask for algebraic lines over some field or possibly real…
We construct CR mappings between spheres that are invariant under actions of finite unitary groups. In particular, we combine a tensoring procedure with D'Angelo's construction of a canonical group-invariant CR mapping to obtain new…
We prove and organize some results on the normal forms of Hermitian operators composed with the Veronese map. We apply this general framework to prove two specific theorems in CR geometry. First, extending a theorem of Faran, we classify…
In discrete geometry, the contact number of a given finite number of non-overlapping spheres was introduced as a generalization of Newton's kissing number. This notion has not only led to interesting mathematics, but has also found…
We prove detailed asymptotics for the number of spanning trees, called complexity, for a general class of discrete tori as the parameters tend to infinity. The proof uses in particular certain ideas and techniques from an earlier paper. Our…
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…
We prove that circle graphs (intersection graphs of circle chords) can be embedded as intersection graphs of rays in the plane with polynomial-size bit complexity. We use this embedding to show that the global curve simplification problem…
Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph. The construction can be done in polynomial time and…