English
Related papers

Related papers: Discrete analogues of Kakeya problems

200 papers

In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…

Combinatorics · Mathematics 2024-11-22 Hung-Hsun Hans Yu , Yufei Zhao

Around the early 2000-s, Bourgain, Katz and Tao introduced an arithmetic approach to study Kakeya-type problems. They showed that the Euclidean Kakeya conjecture follows from a natural problem in additive combinatorics, now referred to as…

Combinatorics · Mathematics 2024-11-21 Cosmin Pohoata , Dmitrii Zakharov

In this paper, we use various versions of Lov\'asz extension to systematically derive continuous formulations of problems from discrete mathematics. This will take place in the following context: (1) For combinatorial optimization problems…

Combinatorics · Mathematics 2023-05-16 Jürgen Jost , Dong Zhang

A conjecture of I. Krasikov is proved. Several discrete analogues of classical polynomial inequalities are derived, along with results which allow extensions to a class of transcendental entire functions in the Laguerre-P\'olya class.

Classical Analysis and ODEs · Mathematics 2010-06-02 George Csordas , Matthew Chasse

Let $V = \{ v_1,\dots,v_N\}$ be a collection of $N$ vectors that live near a discrete sphere. We consider discrete directional maximal functions on $\mathbb{Z}^2$ where the set of directions lies in $V$, given by \[ \sup_{v \in V, k \geq C…

Classical Analysis and ODEs · Mathematics 2019-10-15 Laura Cladek , Ben Krause

A Kakeya set $\mathcal{K}$ in an affine plane of order $q$ is the point set covered by a set $\mathcal{L}$ of $q+1$ pairwise non-parallel lines. Large Kakeya sets were studied by Dover and Mellinger; in [6] they showed that Kakeya sets with…

Combinatorics · Mathematics 2020-03-20 Maarten De Boeck , Geertrui Van de Voorde

We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz \cite{GK}, to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum…

Computational Geometry · Computer Science 2009-05-12 György Elekes , Haim Kaplan , Micha Sharir

We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…

Combinatorics · Mathematics 2015-03-20 Zeev Dvir

We extend the "method of multiplicities" to get the following results, of interest in combinatorics and randomness extraction. (A) We show that every Kakeya set (a set of points that contains a line in every direction) in $\F_q^n$ must be…

Combinatorics · Mathematics 2009-05-14 Zeev Dvir , Swastik Kopparty , Shubhangi Saraf , Madhu Sudan

We prove that the Kakeya maximal conjecture is equivalent to the $\Omega$-Kakeya maximal conjecture. This completes a recent result in [2] where Keleti and Math{\'e} proved that the Kakeya conjecture is equivalent to the $\Omega$-Kakeya…

Classical Analysis and ODEs · Mathematics 2022-04-05 Anthony Gauvan

This paper studies the structure of Kakeya sets in $\mathbb{R}^3$. We show that for every Kakeya set $K\subset\mathbb{R}^3$, there exist well-separated scales $0<\delta<\rho\leq 1$ so that the $\delta$ neighborhood of $K$ is almost as large…

Classical Analysis and ODEs · Mathematics 2025-05-07 Hong Wang , Joshua Zahl

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…

Classical Analysis and ODEs · Mathematics 2021-01-26 Joshua Zahl

This thesis contributes with a number of topics to the subject of string compactifications. In the first half of the work, I discuss the Hodge plot of Calabi-Yau threefolds realised as hypersurfaces in toric varieties. The intricate…

High Energy Physics - Theory · Physics 2018-09-28 Andrei Constantin

We characterize the permutations of $\mathbb{F}_q$ whose graph minimizes the number of collinear triples and describe the lexicographically-least one, affirming a conjecture of Cooper-Solymosi. This question is closely connected to…

Combinatorics · Mathematics 2025-01-07 Joshua Cooper , Jack Hyatt

Kakeya sets are compact subsets of $\mathbb{R}^n$ that contain a unit line segment pointing in every direction. The Kakeya conjecture states that such sets must have Hausdorff dimension $n$. The property of stickiness was first discovered…

Classical Analysis and ODEs · Mathematics 2024-11-01 Mukul Rai Choudhuri

We investigate analogues for curves of the Kakeya problem for straight lines. These arise from H"ormander-type oscillatory integrals in the same way as the straight line case comes from the restriction and Bochner-Riesz problems. Using some…

Classical Analysis and ODEs · Mathematics 2007-05-23 Laura Wisewell

In this manuscript we present an approach to analyze the discontinuous Galerkin solution for general quasilinear elliptic problems. This approach is sufficiently general to extend most of the well-known discretization schemes, including…

Numerical Analysis · Mathematics 2017-02-10 Mohammad Zakerzadeh , Georg May

Integration over curved manifolds with higher codimension and, separately, discrete variants of continuous operators, have been two important, yet separate themes in harmonic analysis, discrete geometry and analytic number theory research.…

Number Theory · Mathematics 2020-06-18 Theresa C. Anderson , Eyvindur Ari Palsson , Angel V. Kumchev

We survey the interconnections between geometric combinatorics (such as the Kakeya problem), arithmetic combinatorics (such as the classical problem of determining which sets contain arithmetic progressions), oscillatory integrals (such as…

Classical Analysis and ODEs · Mathematics 2007-05-23 Terence Tao

Recently, many studies have been devoted to finding diverse solutions in classical combinatorial problems, such as Vertex Cover (Baste et al., IJCAI'20), Matching (Fomin et al., ISAAC'20) and Spanning Tree (Hanaka et al., AAAI'21). We…

Data Structures and Algorithms · Computer Science 2024-09-19 Mark de Berg , Andrés López Martínez , Frits Spieksma