Conical Kakeya and Nikodym Sets in Finite Fields
Audie Warren, Arne Winterhof

TL;DR
This paper extends Dvir's polynomial method to establish size lower bounds for Kakeya and Nikodym sets in finite fields involving conics like parabolae and hyperbolae, providing explicit bounds and constants.
Contribution
It generalizes the finite field Kakeya problem to conic sets, including explicit bounds and constants, and introduces bounds for conical Nikodym sets.
Findings
Lower bounds for conical Kakeya sets with explicit constants
Lower bounds for conical Nikodym sets including ellipses
Extension of polynomial method to non-degenerate conics in finite fields
Abstract
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 hyperbolae (but not ellipses which do not have a direction). We also study so-called conical Nikodym sets where a small variation of the proof provides a lower bound on their sizes. (Here ellipses are included.) Note that the bound on conical Kakeya sets has been known before, however, without an explicitly given constant which is included in our result and close to being best possible.
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.
Conical Kakeya and Nikodym Sets in Finite Fields
Audie Warren and Arne Winterhof
Abstract
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 hyperbolae (but not ellipses which do not have a direction). We also study so-called conical Nikodym sets where a small variation of the proof provides a lower bound on their sizes. (Here ellipses are included.)
Note that the bound on conical Kakeya sets has been known before, however, without an explicitly given constant which is included in our result and close to being best possible.
Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenberger Str. 69, 4040 Linz, Austria, E-mail: {audie.warren,arne.winterhof}@oeaw.ac.at
Keywords. Kakeya set, Nikodym set, polynomial method, method of multiplicities, conic
1 Introduction
A subset of -dimensional vectors over the finite field of elements is called a Kakeya set in if it contains a line in each direction. Using the polynomial method Dvir [3, Theorem 1.5] showed that any Kakeya set in contains at least elements with a constant depending only on , see also [7, Theorem 2.11].
A set is called a Nikodym set in if for each point there is a line containing such that . A small variation of Dvir’s proof also provides that any Nikodym set in contains at least elements with a constant depending only on , see [7, Theorem 2.9].
Now let be the power of an odd prime. The set of zeros of a polynomial
[TABLE]
of degree , that is , and are not all zero, is called a conic in . In the degenerate case, that is is reducible over the algebraic closure of , we get a pair of (intersecting, parallel or identical) lines, a point or the empty set. We restrict ourselves to the non-degenerate case, that is, is absolutely irreducible over , since the degenerate case is either trivial or can be reduced to the previously studied case of a single line. We may assume , and , or and . After regular affine substitutions
[TABLE]
we are left with the following cases where is any fixed non-square in :
- •
, : hyperbola .
- •
: parabola , where .
- •
, : ellipse \{(x,y)\in\mathbb{F}_{q}^{2}:y^{2}={{\color[rgb]{0,0,0}g}}x^{2}+k\}, .
(Note that conics defined by can be transformed into the form and are hyperbolae.)
For parabolae and hyperbolae the parametrisations
[TABLE]
and
[TABLE]
respectively, are obvious. However, we can also derive parametrisations of ellipses where with , see Section 2 below.
To extend the definition of a conic to a general dimension , we embed any conic in into a plane in . That is for some vectors where and are linearly independent:
- •
A(n embedding of a) hyperbola in is a set
[TABLE]
- •
A(n embedding of a) parabola in is a set
[TABLE]
- •
An (embedding of an) ellipse in is a set
[TABLE]
where (x(t),y(t)){{\color[rgb]{0,0,0}\in\mathbb{F}_{q}^{2}}} is given in Section 2.
(Without the linear independence of and the embedding can have fewer points than the embedded conic. Hence, a hyperbola has points, a parabola points and an ellipse points.)
We give adaptations of Dvir’s proof to give bounds on conical Kakeya and Nikodym sets defined as follows.
A subset is called a conical Nikodym set if for all there is a non-degenerate conic of the form , or with and .
In order to define conical Kakeya sets, we must decide on how to define the ’direction’ of a conic which can be identified with the ’point(s) at infinity’ of the conic, that is, a hyperbola has two directions and , a parabola has one direction , and an ellipse has no direction.
A subset is called a conical Kakeya set if for all
there exist \underline{a},\underline{b},{{\color[rgb]{0,0,0}\underline{c}}}\in\mathbb{F}_{q}^{n} such that and are linearly independent and there is a conic contained in either of the form with or of the form with .
We prove the following Theorem.
Theorem 1**.**
Let with be a conical Kakeya or Nikodym set, where is a power of an odd prime. Then
[TABLE]
For conical Kakeya sets the lower bound with a constant depending on follows from [5, Corollary 1.10]. However, in contrast to [5] our constant is explicit and in Section 5 we use the method of multiplicities of [4] to determine a constant of the form where does not depend on .
Moreover, at the end of the paper we give an example of a subset of of size which contains for each , resp., an ellipse of form . Hence, it is necessary to exclude ellipses in the definition of conical Kakeya sets.
In Section 2 we derive a parametrisation for ellipses needed in the proof of Theorem 1. In Section 3 we prove Theorem 1 for conical Nikodym sets and in Section 4 for conical Kakeya sets. In Section 5 we improve the constant using the method of multiplicities. In Section 6 we conclude with some final remarks.
For readers not familiar with the polynomial method we refer to the book of Guth [7] and the survey article of Tao [13] as excellent starting points.
2 Parametrisation of ellipses
In this section we derive a parametrisation for ellipses, which is vital in our proof of Theorem 1 for elliptic Nikodym sets.
Consider the ellipse \mathcal{E}=\{(x,y)\in\mathbb{F}_{q}^{2}:y^{2}={{\color[rgb]{0,0,0}g}}x^{2}+k\}, where is a non-square in and . By [8, Lemma 6.24] we have
[TABLE]
Using analogues and of sine and cosine for finite fields defined below, see for example [9, Definition 15.5], we are able to find parametrisations of ellipses.
Note that a solution of is not an element of : . Let be any fixed solution of
[TABLE]
which exists by . Then verify that
[TABLE]
is a solution of . It can be easily checked that
[TABLE]
with
[TABLE]
Since and (using z^{q}=z{{\color[rgb]{0,0,0}g}}^{(q-1)/2}=-z because {{\color[rgb]{0,0,0}g}} is a non-square in ) we have , so that .
3 Conical Nikodym sets
In this section we prove Theorem 1 for conical Nikodym sets.
Proposition 1**.**
Let with and the power of an odd prime be a conical Nikodym set. Then we have
[TABLE]
Proof.
Suppose . By [7, Lemma 2.4], there is a non-zero polynomial with f({{\color[rgb]{0,0,0}\underline{s}}})=0 for all {{\color[rgb]{0,0,0}\underline{s}}}\in\mathcal{N}, and . Take any . As is conical Nikodym, there exists a conic of the form , or with and . We split into cases depending on the form of the conic .
Firstly assume the conic is a parabola . Parametrise this parabola as
[TABLE]
Applying these points to the polynomial , we define a univariate polynomial in of degree . We also know that it has zeros corresponding to the points of the parabola lying in , and thus must be zero on the whole parabola, in particular .
Secondly assume is a hyperbola . Parametrise this hyperbola as
[TABLE]
Applying these points to the polynomial , we define a univariate polynomial in of degree . We also know that it has zeros corresponding to the points of the hyperbola lying in , and thus must be zero on the whole hyperbola. Again we find .
Thirdly we assume that is an ellipse . The number of points on this ellipse is . We use our parametrisation of an ellipse; it has form
[TABLE]
for some appropriate choice of , and , and are given in Section 2. We consider the polynomial . This polynomial is univariate in of degree . We know that it has zeros (in ) corresponding to the points of the ellipse lying in , and thus must be zero on the whole ellipse. We again find that .
In all three cases we found that . As was chosen arbitrarily we conclude that for all . As the polynomial must be the zero polynomial, a contradiction. ∎
4 Conical Kakeya sets
In this section we prove Theorem 1 for conical Kakeya sets.
Proposition 2**.**
Let with and the power of an odd prime be a conical Kakeya set. Then
[TABLE]
Proof.
Suppose that . By [7, Lemma 2.4] there exists a non-zero polynomial with f({{\color[rgb]{0,0,0}\underline{s}}})=0\ for all {{\color[rgb]{0,0,0}\underline{s}}}\in\mathcal{K}, with degree . We split this polynomial into a sum of its greatest degree part and the lower degree terms as
[TABLE]
Note that as is homogeneous, . Take any . As is conical Kakeya, there exists some conic of the form or with appearing as for parabolae and or for hyperbolae from Section 1. We split into two cases depending on which type of conic defines.
First assume is a parabola . It has parametrisation
[TABLE]
We consider the polynomial F(t){{\color[rgb]{0,0,0}=}}f(\underline{a}+t\underline{b}+t^{2}\underline{c}), which is univariate in of degree . Since is zero on , for all . Then as , is identically zero. We note that the coefficient of in is the coefficient of in :
[TABLE]
Upon multiplying out to find the coefficient of we have
[TABLE]
and thus as is identically zero, .
Secondly we assume is a hyperbola . Up to the relabelling of , we may assume it has parametrisation
[TABLE]
Consider the univariate polynomial , which is of degree . The polynomial vanishes on , and so for all . As with having at least zeros, we have that is identically zero, in particular its constant term is zero. We calculate the constant term of ; it is precisely the coefficient of in ,
[TABLE]
so the coefficient of is
[TABLE]
Thus .
In both cases we have . Since we already knew that , we have for all . As , is identically zero, which is a contradiction. ∎
5 Improvements via the method of multiplicities
The ’method of multiplicities’ was used in [4], see also [13], to prove a constant of for line Kakeya sets. This involves Hasse derivatives and exploiting polynomials which vanish to a high multiplicity on a particular set.
Let and . For a vector , the ’th Hasse derivative of , which we denote , is the coefficient of in the polynomial , where is the monomial .
For and , the multiplicity of at , denoted , is the largest integer such that for all vectors of weight , the ’th Hasse derivative of is zero at , that is, , where .
We make use of five results relating to multiplicities and Hasse derivatives. These results, with proofs, can be found in [4], see also [13].
Lemma 1**.**
Hasse derivatives ’commute’ with taking homogeneous parts of highest degree. That is, for of total degree , letting denote the homogeneous part of of degree , we have
[TABLE]
where is the degree of .
Lemma 2**.**
Taking ’th Hasse derivatives reduces multiplicity by at most the weight of . That is,
[TABLE]
Lemma 3**.**
Multiplicities of compositions of polynomials at is at least the multiplicity of at . That is,
[TABLE]
Lemma 4** (Vanishing lemma for multiplicities).**
Let be of degree . Then
[TABLE]
Lemma 5**.**
Suppose such that for some natural numbers we have
[TABLE]
Then there is a non-zero polynomial of degree at most , such that for all .
Note that Lemma 5 is satisfied if .
5.1 Conical Nikodym sets
In this section we use the method of multiplicities to prove the following theorem.
Theorem 2**.**
Let be a conical Nikodym set, with a power of an odd prime. Then we have
[TABLE]
Proof.
We begin by taking a large multiple of , call it for some positive integer , and define
[TABLE]
Assume that . By Lemma 5, there is a non-zero polynomial of degree , such that for all . Let be the homogeneous part of of degree , which we know is not the zero polynomial. We aim to show that has high multiplicity everywhere in , and thus must be the zero polynomial. Indeed, we will show it has multiplicity everywhere.
Choose with , and . We aim to show that . The case is trivial, so we assume . As is conical Nikodym, there is a conic such that and . We split into cases depending on the conic , aiming to show that .
Case 1 - Parabola
Assume is a parabola, which we can parametrise as . We know by the properties of that for values of . By Lemma 2, we have . We can now use Lemma 3 to get
[TABLE]
for values of . Note that the polynomial has degree . However, has multiplicity at least for values of , so that by Lemma 4, as , , we have
[TABLE]
so that is in fact the zero polynomial. But then , as needed.
Case 2 - Hyperbola
Assume is a hyperbola, which we can parametrise as . We know by the properties of that for values of . By Lemma 2, we have . We have , and we define the polynomial which has degree , and also has multiplicity at least for values of . By the vanishing lemma, we have
[TABLE]
so that is the zero polynomial. In particular, when we input the value corresponding to on the hyperbola, we get zero. Then as needed.
Case 3 - Ellipse
Assume is an ellipse, which we can parametrise as with and linearly independent. We know by the properties of that for values of . By Lemma 2, we have . We have , and we define the polynomial which has degree , and also has multiplicity at least for values of . By the vanishing lemma, we have
[TABLE]
so that is the zero polynomial. In particular, when we input the value corresponding to on the ellipse, we get zero. Then as needed.
This was for arbitrary , so we have for all , and we may use the vanishing lemma a final time to show
[TABLE]
so is in fact the zero polynomial, a contradiction. We may allow to go to infinity, so that
[TABLE]
as needed. ∎
5.2 Conical Kakeya sets
In this section we adapt the proof of [4] for line Kakeya sets to conical Kakeya sets.
Theorem 3**.**
Let be a conical Kakeya set, with odd q. Then we have
[TABLE]
Proof.
We begin by taking a large multiple of , call it , and define .
Assume that . By Lemma 5, there is a non-zero polynomial of degree , such that for all . Let denote the homogeneous part of with highest degree . We will show that this polynomial has multiplicity everywhere, so that must be the zero polynomial.
Let be arbitrary and non-zero (the zero case is trivial), and take with . As is conical Kakeya, there is either a parabola, hyperbola or an ellipse with direction contained in . We split into cases, with the aim to show .
Case 1 - Parabola Assume there is a parabola of the form contained in . We know by the properties of that for . By Lemma 2, we have . We can now use Lemma 3 to get
[TABLE]
Note that the polynomial has degree . However, has multiplicity at least everywhere in , so that by Lemma 4, as , , we have
[TABLE]
so that is in fact the zero polynomial.
The next observation is crucial; the coefficient of in is precisely , as only this highest degree homogeneous part could reach the highest power of . But then by Lemma 1, we have
[TABLE]
as needed.
Case 2 - Hyperbola Up to a relabelling of , we may parametrise the hyperbola as . As the polynomial has multiplicity everywhere in , for . We then have that for . Let denote the degree of . We have , and we define the polynomial . Note that has multiplicity at least for all , so that by the vanishing lemma,
[TABLE]
Therefore is the zero polynomial. In particular, its highest degree term is zero. The coefficient of in is precisely . By Lemma 1, we have , as needed.
We now have that for all . We may now use Lemma 4 to show
[TABLE]
so that is the zero polynomial, a contradiction. We therefore must have . As was an arbitrary large integer, we may allow , so we have
[TABLE]
as needed. ∎
6 Final remarks
- •
For line Kakeya sets Dvir gave a construction of size at most
[TABLE]
see [11, Theorem 7]. This construction can easily be adjusted to conical Kakeya sets. However, we lose a factor . We explain this for parabolae. For hyperbolae and ellipses one can deal analogously. Since otherwise our result is trivial we assume . For any direction we take with and for if and any vector which is linearly independent to if . We also take with . Then for the parabola lies in which contains points. For choose and for and note that and are linearly independent. Choosing for we see that is of the form with for by the choice of . Hence, the parabola lies in the set . We have choices for , for and for each with . Hence, the size of our conical Kakeya set is at most
[TABLE]
- •
In [2, Definition 6], the authors introduced Kakeya sets of degree which coincide with line Kakeya sets if . For this definition differs from our definition of parabolic Kakeya sets by the condition that and are allowed to be linearly dependent. If , in Lemma 7 they also give constructions of size at most . For the construction is
[TABLE]
However, to satisfy the linear independence condition we have to add lines for the directions for which and are linearly dependent, that is, for some and we have to add further vectors, that is, we have the upper bound
[TABLE]
It is not difficult to extend Theorem 3 to such Kakeya sets of degree (with a linear independence condition) giving the lower bound . (Without the linear independence condition we can get only a weaker lower bound since the polynomial curves may contain only points.)
- •
For line Nikodym sets a lower bound is given in [6] where the implied constant is independent of but depends on the characteristic of .
- •
Improved lower bounds on (line) Kakeya and Nikodym sets in are given in [10]. In particular it is shown that a construction for Nikodym sets in of size cannot exist and Nikodym sets behave differently than Kakeya sets where we have such a construction, see our first remark.
- •
Modular conics, in particular hyperbolae, are well-studied objects. For a survey on modular hyperbolae see [12].
- •
The proofs of the lower bounds for the size of finite field Kakeya and Nikodym sets were inspired by ideas from coding theory, see for example [7, Chapter 4] and [14], more precisely from decoding Reed-Muller codes. The crucial idea is that a single missing value of a polynomial (of sufficiently small degree) on a line can be recovered. Similarly one can design decoding algorithms using non-degenerate conics instead of lines, see [14, Lemma 2.6] for parabolae.
- •
The following example shows for ellipses we can neither take nor as a direction to define elliptic Kakeya sets and prove a lower bound of order of magnitude . We take , and . Note that if and only if is a non-square in , that is, for any non-square in the element is a square in and let be a square-root of , . Moreover, verify that Then set
[TABLE]
which defines only one ellipse with points by [8, Lemma 6.24] and since . Note that with is not possible since is a non-square in for . This example explains why we did not include the case of ellipses into the definition of conical Kakeya sets.
Acknowledgment
The authors are supported by the Austrian Science Fund FWF Project P 30405-N32.
We would like to thank the anonymous referees for their valuable comments, in particular for pointing to [5] and [2].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] Björklund, Andreas; Kaski, Petteri; Williams, Ryan. Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants. 12 12 12 th International Symposium on Parameterized and Exact Computation, Art. No. 6, 13 pp., LIP Ics. Leibniz Int. Proc. Inform., 89, Schloss Dagstuhl. Leibniz-Zent. Inform, Wadern, 2018.
- 3[3] Dvir, Zeev. On the size of Kakeya sets in finite fields. J. Amer. Math. Soc. 22 (2009), no. 4, 1093–1097.
- 4[4] Dvir, Zeev; Kopparty, Swastik; Saraf, Shubhangi; Sudan, Madhu. Extensions to the method of multiplicities, with applications to Kakeya sets and mergers. SIAM J. Comput. 42 (2013), no. 6, 2305–2328.
- 5[5] Ellenberg, Jordan S.; Oberlin, Richard; Tao, Terence. The Kakeya set and maximal conjectures for algebraic varieties over finite fields. Mathematika 56 (2010), no. 1, 1–25.
- 6[6] Guo, Alan; Kopparty, Swastik; Sudan, Madhu. New affine-invariant codes from lifting. ITCS’13-Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science, 529–539, ACM, New York, 2013.
- 7[7] Guth, Larry. Polynomial methods in combinatorics. University Lecture Series, 64. American Mathematical Society, Providence, RI, 2016.
- 8[8] Lidl, Rudolf; Niederreiter, Harald. Finite fields. Second edition. Encyclopedia of Mathematics and its Applications, 20. Cambridge University Press, Cambridge, 1997.
