Searcharxiv⌕ Search

arXiv subjects

Larry Guth

Publications and source records attributed to Larry Guth.

At least 73 records · Page 4Linked to original sources

A family of maps with many small fibers

The waist inequality states that for a continuous map from S^n to R^q, not all fibers can have small (n-q)-dimensional volume. We construct maps for which most fibers have small (n-q)-dimensional volume and all fibers have bounded (n-q)-dimensional volume.

math.DG↗

Degree reduction and graininess for Kakeya-type sets in $\mathbb{R}^3$

Let $\frak T$ be a set of cylindrical tubes in $\mathbb{R}^3$ of length $N$ and radius 1. If the union of the tubes has volume $N^{3 - σ}$, and each point in the union lies in tubes pointing in three quantitatively different directions, and if a technical assumption holds, then at scale $N^σ$, the tubes are clustered into rectangular slabs of dimension $1 \times N^σ\times N^σ$. This estimate generalizes the graininess estimate proven by Katz-Laba-Tao. The proof is based on modeling the union of tubes with a high-degree polynomial.

math.CA↗

Quantum error-correcting codes and 4-dimensional arithmetic hyperbolic manifolds

Using 4-dimensional arithmetic hyperbolic manifolds, we construct some new homological quantum error correcting codes. They are LDPC codes with linear rate and distance $n^ε$. Their rate is evaluated via Euler characteristic arguments and their distance using $\mathbb{Z}_2$-systolic geometry. This construction answers a queston of Zémor, who asked whether homological codes with such parameters could exist at all.

math.DG↗

The joints problem for matroids

We prove that in a simple matroid, the maximal number of joints that can be formed by L lines is o(L^2) and Omega(L^{2 - epsilon}) for any epsilon > 0.

math.CO↗

Contraction of areas vs. topology of mappings

We construct homotopically non-trivial maps from the unit m-sphere to the unit (m-1)-sphere with arbitrarily small k-dilation for each k greater than (m + 1)/2. We prove that homotopically non-trivial maps from the unit m-sphere to the unit (m-1)-sphere cannot have arbitrarily small k-dilation for k less than or equal to (m + 1)/2.

math.DG↗

On the Erdos distinct distance problem in the plane

In this paper, we prove that a set of $N$ points in ${\bf R}^2$ has at least $c{N \over \log N}$ distinct distances, thus obtaining the sharp exponent in a problem of Erdös. We follow the set-up of Elekes and Sharir which, in the spirit of the Erlangen program, allows us to study the problem in the group of rigid motions of the plane. This converts the problem to one of point-line incidences in space. We introduce two new ideas in our proof. In order to control points where many lines are incident, we create a cell decompostion using the polynomial ham sandwich theorem. This creates a dichotomy: either most of the points are in the interiors of the cells, in which case we immediately get sharp results, or alternatively the points lie on the walls of the cells, in which case they are in the zero set of a polynomial of suprisingly low degree, and we may apply the algebraic method. In order to control points where only two lines are incident, we use the flecnode polynomial of the Rev. George Salmon to conclude that most of the lines lie on a ruled surface. Then we use the geometry of ruled surfaces to complete the proof.

math.CO↗

Bounds on oscillatory integral operators based on multilinear estimates

We apply the Bennett-Carbery-Tao multilinear restriction estimate in order to bound restriction operators and more general oscillatory integral operators. We get improved L^p estimates in the Stein restriction problem for dimension at least 5 and a small improvement in dimension 3. We prove similar estimates for Hormander-type oscillatory integral operators when the quadratic term in the phase function is positive definite, getting improvements in dimension at least 5. We also prove estimates for Hormander-type oscillatory integral operators in even dimensions. These last oscillatory estimates are related to improved bounds on the dimensions of curved Kakeya sets in even dimensions.

math.CA↗

Generalizations of the Kolmogorov-Barzdin embedding estimates

We consider several ways to measure the `geometric complexity' of an embedding from a simplicial complex into Euclidean space. One of these is a version of `thickness', based on a paper of Kolmogorov and Barzdin. We prove inequalities relating the thickness and the number of simplices in the simplicial complex, generalizing an estimate that Kolmogorov and Barzdin proved for graphs. We also consider the distortion of knots. We give an alternate proof of a theorem of Pardon that there are isotopy classes of knots requiring arbitrarily large distortion. This proof is based on the expander-like properties of arithmetic hyperbolic manifolds.

math.GT↗

Pants decompositions of random surfaces

Our goal is to show, in two different contexts, that "random" surfaces have large pants decompositions. First we show that there are hyperbolic surfaces of genus $g$ for which any pants decomposition requires curves of total length at least $g^{7/6 - ε}$. Moreover, we prove that this bound holds for most metrics in the moduli space of hyperbolic metrics equipped with the Weil-Petersson volume form. We then consider surfaces obtained by randomly gluing euclidean triangles (with unit side length) together and show that these surfaces have the same property.

math.GT↗

Metaphors in systolic geometry

This is an expository essay about systolic geometry. It describes a central theorem in the subject and why the proof is difficult. Then it discusses different metaphors which suggest ways to approach the problem. The metaphors connect the systolic inequality to minimal surfaces, topological dimension, scalar curvature, and hyperbolic geometry.

math.DG↗

Systolic inequalities and minimal hypersurfaces

We give a short proof of the systolic inequality for the n-dimensional torus. The proof uses minimal hypersurfaces. It is based on the Schoen-Yau proof that an n-dimensional torus admits no metric of positive scalar curvature.

math.DG↗

The Hopf invariant and simplex straightening

Let M be a closed 3-manifold which can be triangulated with N simplices. We prove that any map from M to a genus 2 surface has Hopf invariant at most C^N. Let X be a closed oriented hyperbolic 3-manifold with injectivity radius less than epsilon at one point. If there is a degree non-zero map from M to X, then we prove that epsilon is at least C^{-N}.

math.DG↗

Algebraic Methods in Discrete Analogs of the Kakeya Problem

We prove the joints conjecture, showing that for any $N$ lines in ${\Bbb R}^3$, there are at most $O(N^{3 \over 2})$ points at which 3 lines intersect non-coplanarly. We also prove a conjecture of Bourgain showing that given $N^2$ lines in ${\Bbb R}^3$ so that no $N$ lines lie in the same plane and so that each line intersects a set $P$ of points in at least $N$ points then the cardinality of the set of points is $Ω(N^3)$. Both our proofs are adaptations of Dvir's argument for the finite field Kakeya problem.

math.CO↗

Isoperimetric inequalities and rational homotopy invariants

We estimate the linear isoperimetric constants of an n-dimensional ellipse. Using these estimates and a technique of Gromov, we estimate the Hopf and linking invariants of Lipschitz maps from ellipses to round spheres. Using these estimates, we give a lower bound for the k-dilation of degree non-zero maps between ellipses.

math.DG↗

Directional isoperimetric inequalities and rational homotopy invariants

We estimate the second order linking invariants of Lipschitz maps from an n-dimensional ellipse. The estimate uses a new directionally-dependent version of the isoperimetric inequality for cycles inside the ellipse. Using this work, we prove new lower bounds for the k-dilation of maps from one ellipse to another.

math.DG↗

Minimax problems related to cup powers and Steenrod squares

If F is a family of mod 2 flat k-cycles in the unit n-ball, we lower bound the maximal volume of any cycle in F in terms of the homology class of F in the space of all cycles. We give examples to show that these lower bounds are fairly sharp.

math.DG↗