English
Related papers

Related papers: The Spherical Kakeya Problem in Finite Fields

200 papers

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

A Kakeya set is a subset of F^n, where F is a finite field of q elements, that contains a line in every direction. In this paper we show that the size of every Kakeya set is at least C_n * q^n, where C_n depends only on n. This improves the…

Combinatorics · Mathematics 2015-05-13 Zeev Dvir

For a finite field GF(q) a Kakeya set K is a subset of GF(q)^n that contains a line in every direction. This paper derives new upper bounds on the minimum size of Kakeya sets when q is even.

Combinatorics · Mathematics 2013-02-25 Gohar Kyureghyan , Peter Müller , Qi Wang

A Besicovitch set in AG(n,q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds…

Combinatorics · Mathematics 2009-11-24 Aart Blokhuis , Francesco Mazzocca

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 Kakeya set contains a line in each direction. Dvir proved a lower bound on the size of any Kakeya set in a finite field using the polynomial method. We prove analogues of Dvir's result for non-degenerate conics, that is, parabolae and…

Combinatorics · Mathematics 2019-06-05 Audie Warren , Arne Winterhof

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

We prove that a Kakeya set in a vector space over a finite field of size $q$ always supports a probability measure whose Fourier transform is bounded by $q^{-1}$ for all non-zero frequencies. We show that this bound is sharp in all…

Combinatorics · Mathematics 2025-05-15 Jonathan M. Fraser

The restriction and Kakeya problems in Euclidean space have received much attention in the last few decades, and are related to many problems in harmonic analysis, PDE, and number theory. In this paper we initiate the study of these…

Classical Analysis and ODEs · Mathematics 2010-03-23 Gerd Mockenhaupt , Terence Tao

For a finite vector space $V$ and a non-negative integer $r\le\dim V$ we estimate the smallest possible size of a subset of $V$, containing a translate of every $r$-dimensional subspace. In particular, we show that if $K\subset V$ is the…

Number Theory · Mathematics 2010-03-22 Swastik Kopparty , Vsevolod F. Lev , Shubhangi Saraf , Madhu Sudan

We give improved lower bounds on the size of Kakeya and Nikodym sets over $\mathbb{F}_q^3$. We also propose a natural conjecture on the minimum number of points in the union of a not-too-flat set of lines in $\mathbb{F}_q^3$, and show that…

Combinatorics · Mathematics 2019-03-06 Ben Lund , Shubhangi Saraf , Charles Wolf

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

The Fourier restriction phenomenon and the size of Kakeya sets are explored in the setting of the ring of integers modulo $N$ for general $N$ and a striking similarity with the corresponding euclidean problems is observed. One should…

Classical Analysis and ODEs · Mathematics 2018-05-30 Jonathan Hickman , James Wright

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 present a construction of a measure-zero Kakeya-type set in a finite-dimensional space $K^d$ over a local field with finite residue field. The construction is an adaptation of the ideas appearing in [12] and [13]. The existence of…

Classical Analysis and ODEs · Mathematics 2016-02-24 Robert Fraser

A Besicovitch-Rado-Kinney (BRK) set in $\mathbb{R}^n$ is a Borel set that contains a $(n-1)$-dimensional sphere of radius $r$, for each $r>0$. It is known that such sets have Hausdorff dimension $n$ from the work of Kolasa and Wolff. In…

Combinatorics · Mathematics 2024-04-01 Charlotte Trainor

First, we study constructible subsets of $\A^n_k$ which contain a line in any direction. We classify the smallest such subsets in $\A^3$ of the type $R\cup\{g\neq 0\},$ where $g\in k[x_1,...,x_n]$ is irreducible of degree $d$, and $R\subset…

Algebraic Geometry · Mathematics 2014-10-17 Kaloyan Slavov

A Kakeya set $S \subset (\mathbb{Z}/N\mathbb{Z})^n$ is a set containing a line in each direction. We show that, when $N$ is any square-free integer, the size of the smallest Kakeya set in $(\mathbb{Z}/N\mathbb{Z})^n$ is at least…

Combinatorics · Mathematics 2021-12-28 Manik Dhar , Zeev Dvir

Let $\mathbb{F}_q$ be a finite field of $q$ elements where $q$ is a large odd prime power and $Q =a_1 x_1^{c_1}+...+a_dx_d^{c_d}\in \mathbb{F}_q[x_1,...,x_d]$, where $2\le c_i\le N$, $\gcd(c_i,q)=1$, and $a_i\in \mathbb{F}_q$ for all $1\le…

Combinatorics · Mathematics 2016-08-18 Nguyen Duy Phuong , Pham Van Thang , Le Anh Vinh

In this dissertation we define a generalization of Kakeya sets in certain metric spaces. Kakeya sets in Euclidean spaces are sets of zero Lebesgue measure containing a segment of length one in every direction. A famous conjecture, known as…

Classical Analysis and ODEs · Mathematics 2017-03-13 Laura Venieri
‹ Prev 1 2 3 10 Next ›