English
Related papers

Related papers: A bound for plany Kakeya sets in $\mathbb{F}_q^4$ …

200 papers

In a series of recent preprints, we have proven that with probability one the Hausdorff dimension on the outer boundary of planar Brownian motion is 4/3, confirming a conjecture by Mandelbrot. It is also shown that the Hausdorff dimension…

Probability · Mathematics 2008-11-26 Gregory F. Lawler , Oded Schramm , Wendelin Werner

We provide estimates for the dimensions of sets in $\mathbb{R}$ which uniformly avoid finite arithmetic progressions. More precisely, we say $F$ uniformly avoids arithmetic progressions of length $k \geq 3$ if there is an $\epsilon>0$ such…

Classical Analysis and ODEs · Mathematics 2021-03-26 Jonathan M. Fraser , Kota Saito , Han Yu

Let $L$ be a set of lines of an affine space over a field and let $S$ be a set of points with the property that every line of $L$ is incident with at least $N$ points of $S$. Let $D$ be the set of directions of the lines of $L$ considered…

Combinatorics · Mathematics 2016-05-04 Simeon Ball , Aart Blokhuis , Diego Domenzain

A Besicovitch set is a subset of $\R^d$ that contains a unit line segment in every direction and the famous Kakeya conjecture states that Besicovitch sets should have full dimension. We provide a number of results in support of this…

Classical Analysis and ODEs · Mathematics 2018-04-26 Jonathan M. Fraser , Eric J. Olson , James C. Robinson

A Kakeya set in $\mathbb{F}_q^n$ is a set containing a line in every direction. We show that every Kakeya set in $\mathbb{F}_q^n$ has density at least $1/2^{n-1}$, matching the construction by Dvir, Kopparty, Saraf and Sudan.

Combinatorics · Mathematics 2021-12-14 Boris Bukh , Ting-Wei Chao

A two-dimensional Besicovitch set over a finite field is a subset of the finite plane containing a line in each direction. In this paper, we conjecture a sharp lower bound for the size of such a subset and prove some results toward this…

Number Theory · Mathematics 2007-05-23 X. W. C. Faber

We show that given $\alpha \in (0, 1)$ there is a constant $c=c(\alpha) > 0$ such that any planar $(\alpha, 2\alpha)$-Furstenberg set has Hausdorff dimension at least $2\alpha + c$. This improves several previous bounds, in particular…

Classical Analysis and ODEs · Mathematics 2024-08-19 Kornélia Héra , Pablo Shmerkin , Alexia Yavicoli

We prove that all bounded subsets of $\mathbb{Q}_p^n$ containing a line segment of unit length in every direction have Hausdorff and Minkowski dimension $n$. This is the analogue of the classical Kakeya conjecture with $\mathbb{R}$ replaced…

Number Theory · Mathematics 2021-11-02 Bodan Arsovski

We obtain new bounds for the Kakeya maximal conjecture in most dimensions $n<100$, as well as improved bounds for the Kakeya set conjecture when $n=7$ or $9$. For this we consider Guth and Zahl's strengthened formulation of the maximal…

Classical Analysis and ODEs · Mathematics 2019-01-08 Jonathan Hickman , Keith M Rogers

We prove that a subset of $\mathbb{F}_q^n$ that contains a hyperplane in any direction has size at least $q^{n}-O(q^2)$.

Combinatorics · Mathematics 2017-05-30 Beat Zurbuchen

We prove that the Hausdorff dimension of the set $\mathbf{x}\in [0,1)^d$, such that $$ \left|\sum_{n=1}^N \exp\left(2 \pi i\left(x_1n+\ldots+x_d n^d\right)\right) \right|\ge c N^{1/2} $$ holds for infinitely many natural numbers $N$, is at…

Number Theory · Mathematics 2020-12-16 Changhao Chen , Bryce Kerr , Igor Shparlinski

It is shown that $SL_2$ Besicovitch sets of measure zero exist in $\mathbb{R}^3$. The proof is constructive and uses point-line duality analogously to Kahane's construction of measure zero Besicovitch sets in the plane. A corollary is that…

Classical Analysis and ODEs · Mathematics 2024-01-19 Terence L. J. Harris

Let $\mathbb{F}$ be a finite field consisting of $q$ elements and let $n \geq 1$ be an integer. In this paper, we study the size of local Kakeya sets with respect to subsets of $\mathbb{F}^{n}$ and obtain upper and lower bounds for the…

Combinatorics · Mathematics 2021-08-18 Ghurumuruhan Ganesan

We adapt Guth's polynomial partitioning argument for the Fourier restriction problem to the context of the Kakeya problem. By writing out the induction argument as a recursive algorithm, additional multiscale geometric information is made…

Classical Analysis and ODEs · Mathematics 2019-08-16 Jonathan Hickman , Keith M. Rogers , Ruixiang Zhang

Through the use of a nonstandard version of Frostman's lemma, the notion of Hausdorff dimension is formulated in nonstandard euclidean space of arbitrary dimension. This allows for a nonstandard proof of the Kakeya conjecture in two…

Classical Analysis and ODEs · Mathematics 2013-08-29 Paul Potgieter

The Kakeya set conjecture in ${\mathbb R} ^3$ was recently resolved by Wang and Zahl. The distinction between sticky and non-sticky Kakeya sets plays an important role in their proof. Although the proof did not require the Kakeya set to be…

Classical Analysis and ODEs · Mathematics 2025-06-24 Chun-Kit Lai , Adeline E. Wong

We derive Maximal Kakeya estimates for functions over $\mathbb{Z}/N\mathbb{Z}$ proving the Maximal Kakeya conjecture for $\mathbb{Z}/N\mathbb{Z}$ for general $N$ as stated by Hickman and Wright [HW18]. The proof involves using polynomial…

Combinatorics · Mathematics 2022-09-26 Manik Dhar

We provide quantitative estimates for the supremum of the Hausdorff dimension of sets in the real line which avoid $\varepsilon$-approximations of arithmetic progressions. Some of these estimates are in terms of Szemer\'{e}di bounds. In…

Classical Analysis and ODEs · Mathematics 2021-03-26 Jonathan M. Fraser , Pablo Shmerkin , Alexia Yavicoli

Let $\mathcal{L}$ be a family of lines and let $\mathcal{P}$ be a family of $k$-planes in $\mathbb{F}^n$ where $\mathbb{F}$ is a field. In our first result we show that the number of joints formed by a $k$-plane in $\mathcal{P}$ together…

Combinatorics · Mathematics 2020-12-29 Anthony Carbery , Marina Iliopoulou

In a recent breakthrough, Dvir showed that every Kakeya set in $\F^n$ must be of cardinality at least $c_n |\F|^n$ where $c_n \approx 1/n!$. We improve this lower bound to $\beta^n |\F|^n$ for a constant $\beta > 0$. This pins down the…

Combinatorics · Mathematics 2008-08-22 Shubhangi Saraf , Madhu Sudan