English
Related papers

Related papers: Kakeya-type sets in finite vector spaces

200 papers

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

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

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

We study subsets of the $n$-dimensional vector space over the finite field $\mathbb{F}_q$, for odd $q$, which contain either a sphere for each radius or a sphere for each first coordinate of the center. We call such sets radii spherical…

Combinatorics · Mathematics 2020-04-03 Mehdi Makhul , Audie Warren , Arne Winterhof

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

A vector space partition of $\mathbb{F}_q^v$ is a collection of subspaces such that every non-zero vector is contained in a unique element. We improve a lower bound of Heden, in a subcase, on the number of elements of the smallest occurring…

Combinatorics · Mathematics 2018-09-27 Sascha Kurz

In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…

Commutative Algebra · Mathematics 2015-02-02 Apoorva Khare

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

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 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

A Kakeya set in $\mathbb{R}^n$ is a compact set that contains a unit line segment $I_e$ in each direction $e \in S^{n-1}$. The Kakeya conjecture states that any Kakeya set in $\mathbb{R}^n$ has Hausdorff dimension $n$. We consider a…

Classical Analysis and ODEs · Mathematics 2025-06-26 Jonathan M. Fraser , Lijian Yang

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 subset U of a group G is called k-universal if U contains a translate of every k-element subset of G. We give several nearly optimal constructions of small k-universal sets, and use them to resolve an old question of Erdos and Newman on…

Combinatorics · Mathematics 2008-04-06 Noga Alon , Boris Bukh , Benny Sudakov

We study several distinct but related Fourier analytic variants of the well-known Kakeya and Furstenberg set problems in the plane. For example, given $0<s,t<1$, we call a set $K \subseteq \mathbb{R}^2$ an $(s,t)$-Kakeya set if there exists…

Classical Analysis and ODEs · Mathematics 2026-05-22 Jonathan M. Fraser , Lijian Yang

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 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

We prove that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors.

Combinatorics · Mathematics 2008-07-04 Alex Iosevich , Steve Senger

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

A $(k,m)$-Furstenberg set $S \subset \mathbb{F}_q^n$ over a finite field is a set that has at least $m$ points in common with a $k$-flat in every direction. The question of determining the smallest size of such sets is a natural…

Combinatorics · Mathematics 2021-10-14 Manik Dhar , Zeev Dvir , Ben Lund
‹ Prev 1 2 3 10 Next ›