Related papers: D'Angelo conjecture in the third gap interval

In this paper (Math. Res. Lett. 13 (2006). No 4, 509-523), the authors established a pseudo-normal form for proper holomoprhic mappings between balls in complex spaces with degenerate rank. This then was used to give a complete…

In this paper, we study the gap rigidity phenomenon for proper holomorphic maps between balls of different dimension. We show that any $F\in prop_3({\mathbb{B}}^n, {\mathbb{B}} ^N)$, with $3n<N\leq 4n-7$ and $n\geq 7$, is equivalent to a…

The three distance theorem states that for any given irrational number $\alpha$ and a natural number $n$, when the interval $( 0, 1 )$ is divided into $n+1$ subintervals by integer multiples of $\alpha$, namely, $\{0\}, \{ \alpha \}, \{…

Let $ \B^{n+1} \subset \C^{n+1}$ be the unit ball in a complex Euclidean space, and let $ \Sigma^n = \partial \B^{n+1} = S^{2n+1}$. Let $ f: \Sigma^n \hook \Sigma^{N}$ be a local CR immersion.If $ N-n<2n-1$, the asymptotic vectors of the…

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 show that the Fr\"oberg conjecture holds in the second non-trivial degree for an ideal generated by generic forms of degree $d>2$. We also show that the conjecture is true up to degree $2d-1$ provided that the number of variables is…

In this paper, we give an explicit criterion when a rational holomorphic map between balls is equivalent to a polynomial holomorphic map. Making use of this criterion, we show that any proper rational holomorphic map from B^2 into B^N of…

We prove that every $3$-graph $H$ on $n$ vertices with minimum codegree $\delta_2(H) \geq 7n/9 + o(n)$ contains the square of a tight Hamilton cycle. This strengthens a theorem of Bedenknecht and Reiher that $\delta_2(H) \geq 4n/5 + o(n)$…

This work focuses on the degree bound of maps between balls with maximum geometric rank and minimum target dimension where this geometric rank occurs. Specifically, we show that rational proper maps between $\mathbb{B}_n$ and $\mathbb{B}_N$…

Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…

The codimension-three conjecture states that any regular holonomic module extends uniquely beyond an analytic subset with codimension equal to or larger than three. We give a proof of this conjecture.

The three gap theorem (or Steinhaus conjecture) asserts that there are at most three distinct gap lengths in the fractional parts of the sequence $\alpha,2\alpha,\ldots,N\alpha$, for any integer $N$ and real number $\alpha$. This statement…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

Every $n$-vertex planar triangle-free graph with maximum degree at most $3$ has an independent set of size at least $\frac{3}{8}n$. This was first conjectured by Albertson, Bollob\'as and Tucker, and was later proved by Heckman and Thomas.…

Tuza's Conjecture states that if a graph $G$ does not contain more than $k$ edge-disjoint triangles, then some set of at most $2k$ edges meets all triangles of $G$. We prove Tuza's Conjecture for all graphs $G$ having no subgraph with…

Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs…

Dean conjectured three decades ago that every graph with minimum degree at least $k\ge 3$ contains a cycle whose length is divisible by $k$. While the conjecture has been verified for $k\in \{3,4\}$, it remains open for $k\ge 5$. A weaker…

In this paper we prove the "Tiling implies Spectral" part of Fuglede's paper for the case of three intervals. Then we prove the "Spectral implies Tiling" part of the conjecture for the case of three equal intervals as also when the…

In the first partial result toward Steinberg's now-disproved three coloring conjecture, Abbott and Zhou used a counting argument to show that every planar graph without cycles of lengths 4 through 11 is 3-colorable. Implicit in their proof…

We prove that the (hermitian) rank of $QP^d$ is bounded from below by the rank of $P^d$ whenever $Q$ is not identically zero and real-analytic in a neighborhood of some point on the zero set of $P$ in $\mathbb{C}^n$ and $P$ is a polynomial…