A lower bound for the size of Kakeya sets with respect to hyperplanes in $\mathbb{F}_q^n$
Beat Zurbuchen

TL;DR
This paper establishes a lower bound on the size of Kakeya sets in finite fields, showing such sets must be nearly as large as the entire space, with only a small quadratic deficit.
Contribution
It provides a new lower bound for Kakeya sets with respect to hyperplanes in finite fields, advancing understanding of their minimal size.
Findings
Kakeya sets contain a hyperplane in every direction
Size of Kakeya sets is at least q^n - O(q^2)
Sets are nearly as large as the entire space
Abstract
We prove that a subset of that contains a hyperplane in any direction has size at least .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Harmonic Analysis Research · Analytic Number Theory Research
A lower bound for the size of Kakeya sets with respect to hyperplanes in
Beat Zurbuchen
Abstract
We prove that a subset of that contains a hyperplane in any direction has size at least .
1 Introduction
The classical Euclidean Kakeya problem is an important problem in harmonic analysis: let be a compact subset. We say is Kakeya if it contains a unit line segment in every direction. The problem claims that if is Kakeya then
[TABLE]
where denotes for either the Hausdorff or the Minkowski dimension (see [Tao08]).
To give a better understanding of the problem we explain the Minkowski dimension. Let and . Then we define with . One may think of as the union of all open balls with radius around every point in .
This allows us to define the Minkowski dimension for some as
[TABLE]
A good example to see how the definition works is to compute the dimension of a sphere of radius . Then . This denotes for a set that contains the open ball with radius where the ball with radius has been cut out. Thus
[TABLE]
which implies by (1) that
[TABLE]
If is a ball with radius instead, then
[TABLE]
which means by (1) that
[TABLE]
It is however very hard to solve the Euclidean Kakeya problem which is why the problem is still open for . The case was solved by Davies in [Dav71].
In 1999, T. Wolff proposed a disrete analogue of the Kakeya problem. Let be the field with elements. We define a line to be the translate of a one-dimensional linear subspace. The direction of a given line is the unique one-dimensional subspace such that is a translate of . A set is Kakeya if contains a line in every direction, i. e. for all there is a such that . The problem then claims that for all there is a (only depending on ) such that for all Kakeya sets
[TABLE]
Z. Dvir was able to solve the problem with using the so-called polynomial method.
One generalization of the Kakeya problem is the -plane Furstenberg set problem in (see [EE15], Question 1.3). Let be the set of all subspaces such that . We define a -plane to be a translated -dimensional subspace. Given a -plane , its direction is defined as the unique subspace such that is a translate of . Fix some and let be such that for every direction there is at least one -plane with . The problem asks for a lower bound for .
This problem implies the finite field Kakeya problem namely when . Note that means . We therefore consider this case as the generalization of the Kakeya problem.
Definition 1** (Kakeya set with respect to -planes).**
A set is Kakeya with respect to -planes if for every there is a -plane in direction such that .
We will only discuss the size of Kakeya sets w.r.t. to -planes also known as hyperplanes and will therefore call a set Kakeya if it is Kakeya w.r.t. hyperplanes. From the result from Dvir one would expect that for every there is a constant such that for every Kakeya set the inequality from the original problem holds. In fact, we are able to show the following theorem.
Theorem 1**.**
Every set that is Kakeya fulfills
[TABLE]
A known proof, independent of Dvirs method, solves the problem when and gives
[TABLE]
as a bound for every set that is Kakeya. This proof is a discrete version of the previously mentioned proof in [Dav71]. We were not able to trace it back in the literature, but to read an exposition of this proof see [Sla14].
We modify and generalize the proof so that it gives Theorem 1. What is surprising is that while for the asymptotic bound is , for it is rather than the expected with some .
2 The proof
Before being able to prove the theorem we need to prove two lemmas. Let .
Lemma 1**.**
The set fulfills
[TABLE]
Proof.
Let
[TABLE]
We may choose any element of for . If then . If however then and hence . Thus . One can easily generalize this argument and conclude that Therefore
[TABLE]
Define to be . Thus
[TABLE]
We count the number of . We may choose any element from for . Using a similar argument as above we see that which shows that
[TABLE]
Therefore
[TABLE]
∎
Lemma 2**.**
Let and be finite sets and let be a map. If then
[TABLE]
Proof.
Let and define . Note that
[TABLE]
For a fixed one may choose any and any . Thus . By applying the Cauchy-Schwarz inequality we obtain
[TABLE]
which is by the previous observations equivalent to the lemma. ∎
Proof of Theorem 1.
For every take a such that is contained in . Let
[TABLE]
There are possibilities for while every contributes points since . Thus .
Let be and define
[TABLE]
It is easy to see that there is a bijection between and given by . This implies by Lemma 2 that
[TABLE]
The last step before being able to obtain the final inequality is to compute . To do so, we differ two cases:
: This case contributes elements since for every there is a and vice versa. 2. 2.
: Note first that by assumption . By the dimension formula for subscpaces has cardinality . There are ordered pairs of not parallel hyperplanes. Hence this case contributes elements to .
This leaves us with
[TABLE]
By using (2) and Lemma 1 we deduce that
[TABLE]
∎
Note how our final bound for has the form for and for . Namely, when the leading term in the denominator is while it is when .
3 Acknowledgements
I want to thank SwissMAP for providing me with the opportunity to participate in this program. I also want to thank Kaloyan Slavov for his support throughout the whole project and his proposal to do this research project.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Dav 71] Roy O. Davies. Some remarks on the Kakeya problem. Mathematical Proceedings of the Cambridge Philosophical Society, 69 , 1971. pp 417 - 421 doi: 10:1017/S 0305004100046867.
- 2[EE 15] Jordan Ellenberg and Daniel Erman. Furstenberg sets and Furstenberg schemes over finite fields, 2015, ar Xiv:1502.03736 [math.AG] .
- 3[Sla 14] Kaloyan Slavov. An algebraic geometry version of the Kakeya problem. Finite Fields and Their Applications (2016), pp. 158-178 doi: 10.1016/j.ffa.2015.09.005.
- 4[Tao 08] Terence Tao. Dvir’s proof of the finite field Kakeya conjecture, 2008, https://terrytao.wordpress.com/2008/03/24/dvirs-proof-of-the-finite-field-kakeya-conjecture/ .
