Related papers: Lower bounds for incidences

The key point to prove the optimal $C^{1,\frac12}$ regularity of the thin obstacle problem is that the frequency at a point of the free boundary $x_0\in\Gamma(u)$, say $N^{x_0}(0^+,u)$, satisfies the lower bound $N^{x_0}(0^+,u)\ge\frac32$.…

We consider certain estimates involving averaging operators over curves and hypersurfaces that can be cast into a combinatorial framework. We show that hypersurfaces with nonzero rotational curvature satisfy the usual restricted weak-type…

We show that the number of incidences between $m$ distinct points and $n$ distinct lines in ${\mathbb R}^4$ is $O\left(2^{c\sqrt{\log m}} (m^{2/5}n^{4/5}+m) + m^{1/2}n^{1/2}q^{1/4} + m^{2/3}n^{1/3}s^{1/3} + n\right)$, for a suitable…

We prove that the maximum number of edges in a 3-uniform linear hypergraph on $n$ vertices containing no 2-regular subhypergraph is $n^{1+o(1)}$. This resolves a conjecture of Dellamonica, Haxell, Luczak, Mubayi, Nagle, Person, R\"odl,…

We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…

We show short time existence for the evolution of triple junction clusters driven by the surface diffusion flow. On the triple line we use the boundary conditions derived by Garcke and Novick-Cohen as the singular limit of a Cahn-Hilliard…

Here we prove that the Hilbert-Kunz mulitiplicity of a quadric hypersurface of dimension $d$ and odd characteristic $p\geq 2d-4$ is bounded below by $1+m_d$, where $m_d$ is the $d^{th}$ coefficient in the expansion of…

In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…

The Bounded Negativity Conjecture predicts that for any smooth complex surface $X$ there exists a lower bound for the selfintersection of reduced divisors on $X$. This conjecture is open. It is also not known if the existence of such a…

We consider the minimum number of lines $h_n$ and $p_n$ needed to intersect or pierce, respectively, all the cells of the $n \times n$ chessboard. Determining these values can also be interpreted as a strengthening of the classical plank…

It is shown that $3$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with nearly minimum total Gaussian surface area must be close to adjacent $120$ degree sectors, when $n\geq2$. These same results hold for any…

In this note we present a construction which improves the best known bound on the minimal dispersion of large volume boxes in the unit cube. Let $d>1$. The dispersion of $T \subset [0,1]^d$ is defined as the supremum of the volume taken…

We present a new proof (based on spectral decomposition) of a bound originally proved by Sidelnikov~\, for the frame potentials $\sum_{ij} \left( {\bf P}_i \cdot {\bf P}_j \right)^\ell $ on a unit--sphere in $d$ dimensions. Sidelnikov's…

Given a set of $n$ points in $R^2$, the Szemer\'edi-Trotter theorem establishes that the number of lines which can be incident to at least $k > 1$ of these points is $O(n^2/k^3 + n/k)$. J.\ Solymosi conjectured that if one requires the…

We construct stationary perturbations of a specific minimal surface with a circle of triple junctions in $\mathbb{R}^2 \times \mathbb{S}^1$, that satisfy given boundary data.

If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…

Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received a considerable amount of attention in recent years. In this…

In this paper we study the blow-ups of the singular points in the boundary of a minimizing cluster lying in the interface of more than two chambers. We establish a sharp lower bound for the perimeter density at those points and we prove…

In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…

We prove analogues of the Szemer\'edi-Trotter theorem and other incidence theorems using $\delta$-tubes in place of straight lines, assuming that the $\delta$-tubes are well-spaced in a strong sense.