arXiv subjects

Joshua Zahl

Publications and source records attributed to Joshua Zahl.

At least 37 records · Page 2Linked to original sources

arXiv2021

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications

In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component of $\mathbb{R}^d\setminus Z(P)$ intersects $O(n/D^{d-g})$ sets from $S$. Such a polynomial is called a generalized partitioning polynomial. We present a randomized algorithm that computes such polynomials efficiently -- the expected running time of our algorithm is linear in $|S|$. Our approach exploits the technique of quantifier elimination combined with that of $ε$-samples. We also present an extension of our construction to multi-level polynomial partitioning for semi-algebraic sets in $\mathbb{R}^d$. We present five applications of our result. The first is a data structure for answering point-enclosure queries among a family of semi-algebraic sets in $\mathbb{R}^d$ in $O(\log n)$ time, with storage complexity and expected preprocessing time of $O(n^{d+ε})$. The second is a data structure for answering range-searching queries with semi-algebraic ranges in $\mathbb{R}^d$ in $O(\log n)$ time, with $O(n^{t+ε})$ storage and expected preprocessing time, where $t > 0$ is an integer that depends on $d$ and the description complexity of the ranges. The third is a data structure for answering vertical ray-shooting queries among semi-algebraic sets in $\mathbb{R}^{d}$ in $O(\log^2 n)$ time, with $O(n^{d+ε})$ storage and expected preprocessing time. The fourth is an efficient algorithm for cutting algebraic curves in $\mathbb{R}^2$ into pseudo-segments. The fifth application is for eliminating depth cycles among triangles in $\mathbb{R}^3$, where we show a nearly-optimal algorithm to cut $n$ pairwise disjoint non-vertical triangles in $\mathbb{R}^3$ into pieces that form a depth order.

cs.CG↗

arXiv2021

A discretized Severi-type theorem with applications to harmonic analysis

In 1901, Severi proved that if $Z$ is an irreducible hypersurface in $\mathbb{P}^4(\mathbb{C})$ that contains a three dimensional set of lines, then $Z$ is either a quadratic hypersurface or a scroll of planes. We prove a discretized version of this result for hypersurfaces in $\mathbb{R}^4$. As an application, we prove that at most $δ^{-2-\varepsilon}$ direction-separated $δ$-tubes can be contained in the $δ$-neighborhood of a low-degree hypersurface in $\mathbb{R}^4$. This result leads to improved bounds on the restriction and Kakeya problems in $\mathbb{R}^4$. Combined with previous work of Guth and the author, this result implies a Kakeya maximal function estimate at dimension $3+1/28$, which is an improvement over the previous bound of $3$ due to Wolff. As a consequence, we prove that every Besicovitch set in $\mathbb{R}^4$ must have Hausdorff dimension at least $3+1/28$. Recently, Demeter showed that any improvement over Wolff's bound for the Kakeya maximal function yields new bounds on the restriction problem for the paraboloid in $\mathbb{R}^4$.

math.CA↗

arXiv2021

New Kakeya estimates using Gromov's algebraic lemma

This paper presents several new results related to the Kakeya problem. First, we establish a geometric inequality which says that collections of direction-separated tubes (thin neighborhoods of line segments that point in different directions) cannot cluster inside thin neighborhoods of low degree algebraic varieties. We use this geometric inequality to obtain a new family of multilinear Kakeya estimates for direction-separated tubes. Using the linear / multilinear theory of Bourgain and Guth, these multilinear Kakeya estimates are converted into Kakeya maximal function estimates. Specifically, we obtain a Kakeya maximal function estimate in $\mathbb{R}^n$ at dimension $d(n) = (2-\sqrt{2})n + c(n)$ for some $c(n)>0$. Our bounds are new in all dimensions except $n=2,3,4,$ and $6$.

math.CA↗

arXiv2020

Sphere tangencies, line incidences, and Lie's line-sphere correspondence

Two spheres with centers $p$ and $q$ and signed radii $r$ and $s$ are said to be in contact if $|p-q|^2 = (r-s)^2$. Using Lie's line-sphere correspondence, we show that if $F$ is a field in which $-1$ is not a square, then there is an isomorphism between the set of spheres in $F^3$ and the set of lines in a suitably constructed Heisenberg group that is embedded in $(F[i])^3$; under this isomorphism, contact between spheres translates to incidences between lines. In the past decade there has been significant progress in understanding the incidence geometry of lines in three space. The contact-incidence isomorphism allows us to translate statements about the incidence geometry of lines into statements about the contact geometry of spheres. This leads to new bounds for Erdős' repeated distances problem in $F^3$, and improved bounds for the number of point-sphere incidences in three dimensions. These new bounds are sharp for certain ranges of parameters.

math.CO↗

arXiv2020

On rich lenses in planar arrangements of circles and related problems

We show that the maximum number of pairwise non-overlapping $k$-rich lenses (lenses formed by at least $k$ circles) in an arrangement of $n$ circles in the plane is $O\left(\frac{n^{3/2}\log{(n/k^3)}}{k^{5/2}} + \frac{n}{k} \right)$, and the sum of the degrees of the lenses of such a family (where the degree of a lens is the number of circles that form it) is $O\left(\frac{n^{3/2}\log{(n/k^3)}}{k^{3/2}} + n\right)$. Two independent proofs of these bounds are given, each interesting in its own right (so we believe). We then show that these bounds lead to the known bound of Agarwal et al. (JACM 2004) and Marcus and Tardos (JCTA 2006) on the number of point-circle incidences in the plane. Extensions to families of more general algebraic curves and some other related problems are also considered.

math.CO↗

arXiv2020

A note on Fourier restriction and nested Polynomial Wolff axioms

This note records an asymptotic improvement on the known $L^p$ range for the Fourier restriction conjecture in high dimensions. This is obtained by combining Guth's polynomial partitioning method with recent geometric results regarding intersections of tubes with nested families of varieties.

math.CA↗

arXiv2020

Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications

In 2015, Guth proved that for any set of $k$-dimensional bounded complexity varieties in $\mathbb{R}^d$ and for any positive integer $D$, there exists a polynomial of degree at most $D$ whose zero set divides $\mathbb{R}^d$ into open connected sets, so that only a small fraction of the given varieties intersect each of these sets. Guth's result generalized an earlier result of Guth and Katz for points. Guth's proof relies on a variant of the Borsuk-Ulam theorem, and for $k>0$, it is unknown how to obtain an explicit representation of such a partitioning polynomial and how to construct it efficiently. In particular, it is unknown how to effectively construct such a polynomial for bounded-degree algebraic curves (or even lines) in $\mathbb{R}^3$. We present an efficient algorithmic construction for this setting. Given a set of $n$ input algebraic curves and a positive integer $D$, we efficiently construct a decomposition of space into $O(D^3\log^3{D})$ open "cells," each of which meets $O(n/D^2)$ curves from the input. The construction time is $O(n^2)$. For the case of lines in $3$-space we present an improved implementation, whose running time is $O(n^{4/3} \log^{O(1)} n)$. The constant of proportionality in both time bounds depends on $D$ and the maximum degree of the polynomials defining the input curves. As an application, we revisit the problem of eliminating depth cycles among non-vertical lines in $3$-space, recently studied by Aronov and Sharir (2018), and show an algorithm that cuts $n$ such lines into $O(n^{3/2+ε})$ pieces that are depth-cycle free, for any $ε> 0$. The algorithm runs in $O(n^{3/2+ε})$ time, which is a considerable improvement over the previously known algorithms.

cs.CG↗

arXiv2020

Distinct distances in the complex plane

We prove that if $P$ is a set of $n$ points in $\mathbb{C}^2$, then either the points in $P$ determine $Ω(n^{1-ε})$ complex distances, or $P$ is contained in a line with slope $\pm i$. If the latter occurs then each pair of points in $P$ have complex distance 0.

math.CO↗

arXiv2019

Counting higher order tangencies for plane curves

We prove that $n$ plane algebraic curves determine $O(n^{(k+2)/(k+1)})$ points of $k$-th order tangency. This generalizes an earlier result of Ellenberg, Solymosi, and Zahl on the number of (first order) tangencies determined by $n$ plane algebraic curves.

math.CO↗

arXiv2019

On the discretized sum-product problem

We give a new proof of the discretized ring theorem for sets of real numbers. As a special case, we show that if $A\subset\mathbb{R}$ is a $(δ,1/2)_1$-set in the sense of Katz and Tao, then either $A+A$ or $A.A$ must have measure at least $|A|^{1-\frac{1}{68}}$

math.CA↗

arXiv2019

Polynomial Wolff axioms and Kakeya-type estimates in $\mathbb{R}^4$

We establish new linear and trilinear bounds for collections of tubes in $\mathbb{R}^4$ that satisfy the polynomial Wolff axioms. In brief, a collection of $δ$-tubes satisfies the Wolff axioms if not too many tubes can be contained in the $δ$-neighborhood of a plane. A collection of tubes satisfies the polynomial Wolff axioms if not too many tubes can be contained in the $δ$-neighborhood of a low degree algebraic variety. First, we prove that if a set of $δ^{-3}$ tubes in $\mathbb{R}^4$ satisfies the polynomial Wolff axioms, then the union of the tubes must have volume at least $δ^{1-1/40}$. We also prove a more technical statement which is analogous to a maximal function estimate at dimension $3+1/40$. Second, we prove that if a collection of $δ^{-3}$ tubes in $\mathbb{R}^4$ satisfies the polynomial Wolff axioms, and if most triples of intersecting tubes point in three linearly independent directions, then the union of the tubes must have volume at least $δ^{3/4}$. Again, we also prove a slightly more technical statement which is analogous to a maximal function estimate at dimension $3+1/4$. We conjecture that every Kakeya set satisfies the polynomial Wolff axioms, but we are unable to prove this. If our conjecture is correct, it implies a Kakeya maximal function estimate at dimension $3+1/40$, and in particular this implies that every Kakeya set in $\mathbb{R}^4$ must have Hausdorff dimension at least $3+1/40$. This would be an improvement over the current best bound of 3, which was established by Wolff in 1995.

math.CA↗

arXiv2019

Large Sets Avoiding Rough Patterns

The pattern avoidance problem seeks to construct a set $X\subset \mathbb{R}^d$ with large dimension that avoids a prescribed pattern. Examples of such patterns include three-term arithmetic progressions (solutions to $x_1 - 2x_2 + x_3 = 0$), or more general patterns of the form $f(x_1, \dots, x_n) = 0$. Previous work on the subject has considered patterns described by polynomials, or by functions $f$ satisfying certain regularity conditions. We consider the case of `rough' patterns, not necessarily given by the zero-set of a function with prescribed regularity. There are several problems that fit into the framework of rough pattern avoidance. As a first application, if $Y \subset \mathbb{R}^d$ is a set with Minkowski dimension $α$, we construct a set $X$ with Hausdorff dimension $d-α$ such that $X+X$ is disjoint from $Y$. As a second application, if $C$ is a Lipschitz curve, we construct a set $X \subset C$ of dimension $1/2$ that does not contain the vertices of an isosceles triangle.

math.CA↗

arXiv2018

An improved bound on the Hausdorff dimension of Besicovitch sets in $\mathbb{R}^3$

We prove that any Besicovitch set in $\mathbb{R}^3$ must have Hausdorff dimension at least $5/2+ε_0$ for some small constant $ε_0>0$. This follows from a more general result about the volume of unions of tubes that satisfy the Wolff axioms. Our proof grapples with a new "almost counter example" to the Kakeya conjecture, which we call the $SL_2$ example; this object resembles a Besicovitch set that has Minkowski dimension 3 but Hausdorff dimension $5/2$. We believe this example may be an interesting object for future study.

math.CA↗

arXiv2018

Curves in $\mathbb{R}^4$ and two-rich points

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_εn^{4/3+3ε}$ two-rich points, provided at most $n^{2/3+2ε}$ curves lie in any low degree hypersurface and at most $n^{1/3+ε}$ curves lie in any low degree surface. This result follows from a structure theorem about arrangements of curves that determine many two-rich points.

math.CO↗

arXiv2017

Point-curve incidences in the complex plane

We prove an incidence theorem for points and curves in the complex plane. Given a set of $m$ points in ${\mathbb R}^2$ and a set of $n$ curves with $k$ degrees of freedom, Pach and Sharir proved that the number of point-curve incidences is $O\big(m^{\frac{k}{2k-1}}n^{\frac{2k-2}{2k-1}}+m+n\big)$. We establish the slightly weaker bound $O_\varepsilon\big(m^{\frac{k}{2k-1}+\varepsilon}n^{\frac{2k-2}{2k-1}}+m+n\big)$ on the number of incidences between $m$ points and $n$ (complex) algebraic curves in ${\mathbb C}^2$ with $k$ degrees of freedom. We combine tools from algebraic geometry and differential geometry to prove a key technical lemma that controls the number of complex curves that can be contained inside a real hypersurface. This lemma may be of independent interest to other researchers proving incidence theorems over ${\mathbb C}$.

math.CO↗

arXiv2016

New bounds on curve tangencies and orthogonalities

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves are tangent. In particular, if no three curves are mutually tangent at a common point, then there are $O(n^{3/2})$ curve-curve tangencies. Second, given a family of algebraic plane curves and a set of $n$ curves from this family, we show that either there are $O(n^{3/2})$ points where two or more curves are orthogonal, or the family of curves has certain special properties. We obtain these bounds by transforming the arrangement of plane curves into an arrangement of space curves so that tangency (or orthogonality) of the original plane curves corresponds to intersection of space curves. We then bound the number of intersections of the corresponding space curves. For the case of curve-curve tangency, we use a polynomial method technique that is reminiscent of Guth and Katz's proof of the joints theorem. For the case of orthogonal curve intersections, we employ a bound of Guth and the third author to control the number of two-rich points in space curve arrangements.

math.CO↗

arXiv2016

Spectral gaps, additive energy, and a fractal uncertainty principle

We obtain an essential spectral gap for $n$-dimensional convex co-compact hyperbolic manifolds with the dimension $δ$ of the limit set close to $(n-1)/2$. The size of the gap is expressed using the additive energy of stereographic projections of the limit set. This additive energy can in turn be estimated in terms of the constants in Ahlfors-David regularity of the limit set. Our proofs use new microlocal methods, in particular a notion of a fractal uncertainty principle.

math.SP↗

arXiv2016

Cutting Algebraic Curves into Pseudo-segments and Applications

We show that a set of $n$ algebraic plane curves of constant maximum degree can be cut into $O(n^{3/2}\operatorname{polylog} n)$ Jordan arcs, so that each pair of arcs intersect at most once, i.e., they form a collection of pseudo-segments. This extends a similar (and slightly better) bound for pseudo-circles due to Marcus and Tardos. Our result is based on a technique of Ellenberg, Solymosi and Zahl that transforms arrangements of plane curves into arrangements of space curves, so that lenses (pairs of subarcs of the curves that intersect at least twice) become vertical depth cycles. We then apply a variant of a technique of Aronov and Sharir to eliminate these depth cycles by making a small number of cuts, which corresponds to a small number of cuts to the original planar arrangement of curves. After these cuts have been performed, the resulting curves form a collection of pseudo-segments. Our cutting bound leads to new incidence bounds between points and constant-degree algebraic curves. The conditions for these incidence bounds are slightly stricter than those for the current best-known bound of Pach and Sharir; for our result to hold, the curves must be algebraic and of bounded maximum degree, while Pach and Sharir's bound only imposes weaker, purely topological constraints on the curves. However, when our conditions hold, the new bounds are superior for almost all ranges of parameters. We also obtain new bounds on the complexity of a single level in an arrangement of constant-degree algebraic curves, and a new bound on the complexity of many marked faces in an arrangement of such curves.

math.CO↗