The generalized k-resultant modulus set problem in finite fields
David Covert, Doowon Koh, Youngjin Pi

TL;DR
This paper investigates the size of the generalized k-resultant modulus set in finite fields, establishing new lower bounds under certain size conditions of the sets, and improves previous results by removing an epsilon term from the exponents.
Contribution
It extends previous work by providing sharper bounds for the size of the generalized k-resultant modulus set in finite fields, removing the epsilon from the exponents.
Findings
If the product of set sizes exceeds a certain threshold, the resultant set covers a positive proportion of the field.
Improved bounds for the size of the resultant set for specific dimensions and number of sets.
Generalization of previous results with tighter exponents and removal of epsilon in the bounds.
Abstract
Let be the -dimensional vector space over the finite field with elements. Given sets for , the generalized -resultant modulus set, denoted by , is defined by where for We prove that if for with a sufficiently large constant , then for some constant and if for even then $|\Delta_4(E_1,E_2,E_3,β¦
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
TopicsCoding theory and cryptography
The generalized -resultant modulus set problem in finite fields
David Covert, Doowon Koh, and Youngjin Pi
Department of Mathematics and Computer Science
University of Missouri-St. Louis
St. Louis, MO 63121 USA
Department of Mathematics
Chungbuk National University
Cheongju Chungbuk 28644, Korea
Department of Mathematics
Chungbuk National University
Cheongju Chungbuk 28644, Korea
Abstract.
Let be the -dimensional vector space over the finite field with elements. Given sets for , the generalized -resultant modulus set, denoted by , is defined by
[TABLE]
where for We prove that if for with a sufficiently large constant , then for some constant and if for even then This generalizes the previous result in [5]. We also show that if for even then This result improves the previous work in [5] by removing from the exponent.
2010 Mathematics Subject Classification:
52C10, 42B05, 11T23
Key words and phrases: ErdΕs distance problem, finite fields, -resultant modulus set.
Doowon Koh was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education, Science and Technology(NRF-2015R1A1A1A05001374)
1. Introduction
The ErdΕs distance problem asks us to determine the minimal number of distinct distances between any points in This problem was initially posed by Paul ErdΕs [8] who conjectured that and for where denotes the minimal number of distinct distances between distinct points of , and for means that there is a constant independent of such that This conjecture in two dimension was resolved up to the logarithmic factor by Guth and Katz [10]. However, the problem is still open in higher dimensions.
In [3], Bourgain, Katz, and Tao initially introduced the finite field analog of the ErdΕs distance problem and Iosevich and Rudnev [15] developed the problem in the general finite field setting. Let be the -dimensional vector space over the finite field with elements. Throughout this paper we always assume that the characteristic of is strictly greater than two. For a set the distance set, denoted by , is defined as
[TABLE]
where for With this definition of the distance set, Bourgain, Katz, and Tao [3] proved that if is prime and with for then there exists such that . Here we recall that for means that there exists a constant independent of such that and we write for We also use if This result was obtained by finding the connection between incidence geometry in and the distance set. Unfortunately, it is not simple to find the relationship between and from their proof. Furthermore, if , then which shows that the exponent can not be generically improved. If is a square in , another unpleasant example exists with the finite field ErdΕs distance problem. For instance, let where denotes an element of such that Then it is straightforward to see that and In view of aforementioned examples, Iosevich and Rudnev [15] reformulated the ErdΕs distance problem in general finite field setting as follows.
Question 1.1**.**
Let What is the smallest exponent such that if for a sufficiently large constant then for some
The problem in this question is called the ErdΕs-Falconer distance problem in the finite field setting. Note that a distance can be viewed as an 1-dimensional simplex. Readers may refer to [7, 2, 25, 1, 21] and references contained therein for the -simplices problems. In [15], it was shown that for all dimensions The authors in [11] proved that for general odd dimensions On the other hand, they conjectured that if the dimension is even, then can be improved to In dimension two, the authors in [4] applied the sharp finite field restriction estimate for the circle on the plane so that they show which improves the exponent , a sharp exponent in general odd dimensions It was also observed in [1] that the exponent can be obtained by applying the group action. Furthermore, considering the perpendicular bisector of two points in a set of the authors in [12] proved that the exponent holds for the pinned distance problem case. However, in higher even dimensions the exponent has not been improved. To demonstrate some possibility that the exponent could be improved for even dimensions the authors in [5] introduced a -resultant modulus set which generalizes the distance set in the sense that any points can be selected from a set to determine an object similar to a distance. More precisely, for a set we define a -resultant modulus set as
[TABLE]
Since the sign does not affect on our results in this paper, we shall simply take signs. That is, we will use the definition
[TABLE]
for consistency. With this definition of the -resultant modulus set, the following question was proposed in [5].
Question 1.2**.**
Let and be an integer. What is the smallest exponent such that if for a sufficiently large constant , then for some
This problem is called the -resultant modulus problem. When , this question is simply the finite field ErdΕs-Falconer distance problem, and in this sense the -resultant modulus problem is a direct generalization of the distance problem. It is obvious that the smallest exponent in Question 1.1 is greater than or equal to the smallest exponent in Question 1.2. In [5], it was conjectured that must be equal to This conjecture means that the solution of Question 1.2 is independent of the integer In other words, it is conjectured that the solution of the ErdΕs-Falconer distance problem is the same as that of the -resultant modulus problem. In fact, the authors in [6] provided a simple example which shows that for any integer in odd dimensions provided that is a square number in On the other hand, they conjectured that the smallest exponent in Question 1.2 is for even dimensions and all integers . In addition, they showed that if and the dimension is even, then one can improve the exponent which is sharp in odd dimensional case. More precisely they obtained the following result.
Theorem 1.3**.**
*Let Suppose that is a sufficiently large constant. Then the following statements hold:
(1) If or and then for some
(2) If is even and then for some
(3) If is even, then for any there exists such that if then for some *
The purpose of this paper is to generalize Theorem 1.3. In particular, in the general setting, we improve the third conclusion of Theorem 1.3 by removing the in the exponent.
The generalized ErdΕs-Falconer distance problem has been recently studied by considering the distances between any two sets (see, for example, [13, 16, 17, 18, 22, 24, 26]). Given two sets the generalized distance set is defined by
[TABLE]
The generalized ErdΕs-Falconer distance problem is to determine the smallest exponent such that if with for a sufficiently large constant , then for some From the ErdΕs-Falconer distance conjecture, it is natural to conjecture that the smallest exponent is for odd dimension and for even dimension Shparlinski [22] obtained the exponent for all dimensions Thus, the generalized ErdΕs-Falconer distance conjecture was established in odd dimensions. On the other hand, the conjectured exponent in even dimensions has not been obtained. The currently best known result is the exponent for even dimensions except for two dimensions. In dimension two the best known result is the exponent due to Koh and Shen [16].
We now consider a problem which extends both the generalized ErdΕs-Falconer distance problem and the -resultant modulus set problem. For sets we define the generalized -resultant set as
[TABLE]
Problem 1.4**.**
Let be an integer. Suppose that Determine the smallest exponent such that if for a sufficiently large constant , then for some
We call this problem the generalized -resultant modulus problem. As in the -resultant modulus problem, we are only interested in studying this problem in even dimensions If for some odd prime , then contains the subfield . In this case, if the dimension is even and for all then and This example proposes the following conjecture.
Conjecture 1.5**.**
Suppose that is even and is an integer. Then the smallest exponent in Problem 1.4 must be
1.1. Statement of the main result
As mentioned before, the known results on the generalized ErdΕs-Falconer distance problem says that if then for , and for even dimensions where denotes the smallest exponent in Problem 1.4. In this paper we study the generalized -resultant modulus problem for Our main result is as follows.
Theorem 1.6**.**
*Let be an integer and for Assume that is a sufficiently large constant. Then the following statements hold:
(1) If or and then
(2) If is even and then
(3) If is even and then *
Taking for all , the first and second conclusions of Theorem 1.3 follow immediately from of Theorem 1.6, respectively. Moreover, the third conclusion of Theorem 1.6 implies that the in the statement of Theorem 1.3 is not necessary.
Theorem 1.6 also implies the following result.
Corollary 1.7**.**
For any integer let for Assume that is a sufficiently large constant. Then if is even and we have
Proof.
Without loss of generality, we may assume that Notice that if then Since the statement follows by induction argument with conclusions of Theorem 1.6. β
2. Discrete Fourier analysis
We shall use the discrete Fourier analysis to deduce the result of our main theorem, Theorem 1.6. In this section, we recall notation and basic concept in the discrete Fourier analysis. Throughout this paper, we shall denote by a nontrivial additive character of Since our result is independent of the choice of the character we assume that is always a fixed nontrivial additive character of The orthogonality relation of states that
[TABLE]
where for Given a function we shall denote by the Fourier transform of which is defined by
[TABLE]
On the other hand, we shall denote by the normalized Fourier transform of the function Namely we define that
[TABLE]
In particular, if and we take as an indicator function of a set then we see that
[TABLE]
Here, and throughout this paper, we write for the indicator function of a set We define the normalized inverse Fourier transform of , denoted by as for It is not hard to see that for Hence, we obtain the Fourier inversion theorem:
[TABLE]
Using the orthogonality relation of the character we see that
[TABLE]
We shall call this formula the Plancherel theorem. Notice that if we take as an indicator function of a set then the Plancherel theorem yields that
[TABLE]
Recall from HΓΆlderβs inequality that if then we have
[TABLE]
where and Applying HΓΆlderβs inequality repeatedly, we see that if and for with then
[TABLE]
We refer to this formula as the generalized HΓΆlderβs inequality.
Lemma 2.1**.**
Let be an integer. If for all then we have
[TABLE]
Proof.
Notice that if and then Since applying generalized HΓΆlderβs inequality yields the desirable result:
[TABLE]
β
To estimate a lower bound of , we shall utilize the Fourier decay estimate on spheres. Recall that the sphere for is defined by
[TABLE]
It is not hard to see that for and (see Theorem 6.26 and Theorem 6.27 in [20]). It is well known that the value of can be written in terms of the Gauss sum and the Kloosterman sum. In particular, when the dimension is even, the following result can be obtained from Lemma 4 in [14].
Lemma 2.2**.**
Let be even. If and then we have
[TABLE]
where for and otherwise, and denotes the Gauss sum
[TABLE]
where is the quadratic character of and . In particular, we have
[TABLE]
We shall invoke the following result which was given in Proposition 2.2 in [18].
Lemma 2.3**.**
If then we have
[TABLE]
3. Formula for a lower bound of
This section devotes to proving the following result which is useful to deduce a lower bound of
Theorem 3.1**.**
Let be even and be an integer. If for and , then we have
[TABLE]
Proof.
For each we define a counting function by
[TABLE]
Since and for , we see that
[TABLE]
Square both sides of this equation and use the Cauchy-Schwarz inequality. It follows
[TABLE]
Thus, we obtain
[TABLE]
Now, we claim three facts below.
Claim 3.2**.**
Suppose that is even and is an integer. If for with , then we have
[TABLE]
Claim 3.3**.**
Let and be integers. If for then we have
[TABLE]
Claim 3.4**.**
Assume that is even and is an integer. If for with , then we have
[TABLE]
For a moment, let us accept Claims 3.2, 3.3, and 3.4 which shall be proved in the following subsections (see Subsections 3.1, 3.2, and 3.3). From (3.1) and Claim 3.2, we see that if then
[TABLE]
Observe from Claims 3.3 and 3.4 that if then
[TABLE]
where Lemma 2.1 was used to obtain the last inequality. From this estimate and (3.2), it follows that
[TABLE]
Then the statement of Theorem 3.1 follows by applying generalized HΓΆlderβs inequality (2.2):
[TABLE]
β
3.1. Proof of Claim 3.2
Suppose that is even and is an integer. Let for with We aim to show that
[TABLE]
To prove this, we begin by estimating the counting function for For each it follows that
[TABLE]
Applying the Fourier inversion theorem to the indicate function , it follows that
[TABLE]
By the definition of the normalized Fourier transform, we can write
[TABLE]
To prove (3.3), we first find an upper bound of By (2.4) of Lemma 2.2, we can write
[TABLE]
Since and it follows that
[TABLE]
Applying Lemma 2.1,
[TABLE]
Since it follows that
[TABLE]
Note that if then the second term above is nonnegative. Thus we obtain that
[TABLE]
Squaring the both sizes, we complete the proof of Claim 3.2.
3.2. Proof of Claim 3.3
We want to prove the following estimate of the counting function
[TABLE]
By (3.4), we see that
[TABLE]
Using Lemma 2.3, we see that
[TABLE]
By the definition of the normalized Fourier transform, the orthogonality relation of , and basic property of summation, it follows that
[TABLE]
Since the third term above is not positive, we obtain that
[TABLE]
which completes the proof of Claim 3.3.
3.3. Proof of Claim 3.4
For even and an integer , let for with We must show that
[TABLE]
We begin by recalling from (3.1) that if is even, then
[TABLE]
It follows that
[TABLE]
Thus we can write
[TABLE]
Since the absolute value of the Gauss sum is , we have
[TABLE]
It follows that
[TABLE]
Now, notice that
[TABLE]
and
[TABLE]
Since using Lemma 2.1 yields the following two estimates:
[TABLE]
and
[TABLE]
From these estimates and (3.8), we have
[TABLE]
Finally, we obtain the estimate (3.7) by observing that if , then
[TABLE]
Thus the proof of Claim 3.4 is complete.
4. connection between restriction estimates for spheres and
Theorem 3.1 shows that a good lower bound of can be obtained by estimating an upper bound of the quantity
[TABLE]
This quantity is closely related to the restriction estimates for spheres with non-zero radius. In this section, we review the restriction problem for spheres and we restate Theorem 3.1 in terms of the restriction estimates for spheres. We begin by reviewing the extension problem for spheres which is also called the dual restriction problem for spheres. We shall use the notation to denote the -dimensional vector space over the finite field where a normalized counting measure is given. On the other hand, we denote by the dual space of the vector space where we endow the dual space with the counting measure Since the space can be identified with its dual space as an abstract group, we shall use the notation to indicate both the space and its dual space. To distinguish the space with its dual space, we always use the variable for the element of the space with the normalized counting measure On the other hand, the variable will be used to denote the element of the dual space with the counting measure For example, we write and for and , respectively. With these notations, the classical norm notation can be used to indicate the following sums: for
[TABLE]
and
[TABLE]
where is a function on and is a function on For each let be the sphere defined as in (2.3). We endow the sphere with the normalized surface measure which is defined by measuring the mass of each point on as Notice that the total mass of is and we have
[TABLE]
We also recall that if then the inverse Fourier transform of is defined by
[TABLE]
Since the sphere is symmetric about the origin, we can write
[TABLE]
With the above notation, the extension problem for the sphere asks us to determine such that there exists satisfying the following extension estimate:
[TABLE]
where the constant may depend on but it must be independent of the functions and the size of the underlying finite field By duality, this extension estimate is the same as the following restriction estimate (see [19, 23]) :
[TABLE]
where is defined as in (2.1) and , denote the HΓΆlder conjugates of and respectively (namely, and
Now, we address the relation between the restriction estimates for spheres with non-zero radius and a lower bound of By Theorem 3.1 and the definition of the restriction estimates for spheres in (4.4), we obtain the following result.
Lemma 4.1**.**
For even and an integer , let for Assume that and the following restriction estimate holds for some and :
[TABLE]
Then we have
[TABLE]
Proof.
By Theorem 3.1, it suffices to prove that
[TABLE]
Since for we see that
[TABLE]
Using the definition of in (4.2) and the fact that the above quantity is similar to the following value:
[TABLE]
By assumption (4.5), this can be dominated by
[TABLE]
Putting all estimates together yields the inequality (4.6), which completes the proof. β
5. Restriction theorems for spheres
We see from Lemma 4.1 that the restriction estimates for spheres play an important role in determining lower bounds of the cardinality of the generalized -resultant set In particular, our main result (Theorem 1.6) will be proved by making an effort on finding possibly large exponent such that the restriction inequality (4.5) holds for or In this section, we shall obtain such restriction estimates. To this end, we shall apply the following dual restriction estimate for spheres with non-zero radius due to the authors in [14].
Lemma 5.1** ([14], Theorem 1).**
If be even, then
[TABLE]
To obtain a restriction estimate for spheres, we shall use the dual estimate of (5.1). To this end, it is useful to review Lorentz spaces in our setting. For a function we denote by the distribution function on :
[TABLE]
We see that for
[TABLE]
The function is defined on by
[TABLE]
For and a function , define
[TABLE]
In particular, we see that
[TABLE]
It is not hard to see that for and ,
[TABLE]
See [9] for further information about Lorentz spaces. With the above notation, the following fact can be deduced.
Lemma 5.2**.**
Let be the normalized surface measure on the sphere Assume that the estimate
[TABLE]
holds for all subsets of Then we have
[TABLE]
for all functions
Proof.
Without loss of generality, we may assume that is a nonnegative simple function given by the form
[TABLE]
where and for all Notice that
[TABLE]
It follows that
[TABLE]
[TABLE]
Namely, we see that
[TABLE]
Using this estimate along with (5.3) and the hypothesis (5.2), we see that
[TABLE]
Hence, the proof is complete.β
We shall invoke the following weak-type restriction estimate.
Lemma 5.3**.**
If is even and we put , then the weak-type restriction estimate
[TABLE]
holds for all and for all functions
Proof.
Since , its dual exponent is given by
[TABLE]
Combining Lemma 5.1 with Lemma 5.2, it follows that
[TABLE]
for all functions with By duality, this estimate is same as (5.4), which completes the proof. β
The following restriction estimate will play an important role in proving the third part of Theorem 1.6.
Lemma 5.4**.**
If and then we have
[TABLE]
Proof.
Since and for it is enough to show that if with then
[TABLE]
Notice from the definition of the Fourier transforms that
[TABLE]
Now, we apply the well known fact (Lemma 2.2 in [15]) that if for and then
[TABLE]
Then we see that
[TABLE]
where the last inequality follows from our assumption that Thus, (5.5) holds and we complete the proof.
β
Now, we introduce the interpolation theorem which enables us to derive the restriction estimates we need for the proof of our main results.
Theorem 5.5**.**
Let be a collection of subsets of Assume that the following two restriction estimates hold for all sets and :
[TABLE]
and
[TABLE]
Then for we have
[TABLE]
Namely, if for some then we have
[TABLE]
Proof.
Let which will be chosen later.
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Now we choose such that
[TABLE]
Namely, we choose
[TABLE]
It follows that
[TABLE]
which implies (5.6). By a direct computation, (5.7) follows from (5.6).
β
6. Proof of main theorem (Theorem 1.6)
In this section, we shall give the complete proof of Theorem 1.6. Since it is clear that
[TABLE]
On the other hand, it follows from Lemma 5.3 that if is even, then
[TABLE]
6.1. Proof of statement of Theorem 1.6
We need the following lemma.
Lemma 6.1**.**
If or , then we have
[TABLE]
Proof.
Note that if or then Therefore, using Theorem 5.5, we are able to interpolate (6.1) and (6.2) so that we obtain
[TABLE]
Namely, we see that
[TABLE]
Thus, the proof is complete. β
We are ready to prove statement (1) of Theorem 1.6. We aim to prove that if or , and with , then Combining Lemma 4.1 and Lemma 6.1, we see that
[TABLE]
Since for a sufficiently large , we see from a direct computation that
[TABLE]
6.2. Proof of statement of Theorem 1.6
We shall utilize the following key lemma.
Lemma 6.2**.**
If is even, then we have
[TABLE]
Proof.
Since for all even interpolating (6.1) and (6.2) yields
[TABLE]
Since , the statement follows. β
Let us prove statement (2) of Theorem 1.6. Recall that we must show that if is even and with then Combining Lemma 4.1 and Lemma 6.2, we obtain that
[TABLE]
Since for a sufficiently large , it follows from a direct computation that
[TABLE]
6.3. Proof of statement of Theorem 1.6
We begin by proving the following lemma.
Lemma 6.3**.**
Let If is even and then we have
[TABLE]
Proof.
Since and , we see from Lemma 5.4 that
[TABLE]
As in (6.2), we also see that
[TABLE]
Since for by using Theorem 5.5 we are able to interpolate (6.3) and (6.4). Hence, if is even and , then we have
[TABLE]
By a direct computation, we conclude
[TABLE]
which completes the proof of the lemma. β
Let us prove the statement of Theorem 1.6 which states that if is even and then To prove this, let us first assume that one of is less than , say that Then by our hypothesis that it must follow that
[TABLE]
This implies that which was proved by Shparlinski [22]. Thus it is clear that , because For this reason, we may assume that all of are greater than or equal to and Combining Lemma 4.1 with Lemma 6.3 , we obtain that
[TABLE]
where we take and By a direct comparison, it is not hard to see that if then we have We have finished the proof of the third part of Theorem 1.6.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Bennett, D. Hart, A. Iosevich, J. Pakianathan, and M. Rudnev, Group actions and geometric combinatorics in π½ q d superscript subscript π½ π π \mathbb{F}_{q}^{d} , Forum Math. 29 (2017), no.1, 91-110.
- 2[2] M. Bennett, A. Iosevich, and J. Pakianathan, Three-point conο¬gurations determined by subsets of π½ q 2 superscript subscript π½ π 2 \mathbb{F}_{q}^{2} via the Elekes-Sharir Paradigm, Combinatorica, 34 (2014), no.6, 689-706.
- 3[3] J. Bourgain, N. Katz, and T. Tao, A sum-product estimate in finite fields, and applications, Geom. Funct. Anal. 14 (2004), 27-57.
- 4[4] J. Chapman, M. ErdogΜan, D. Hart, A. Iosevich, and D. Koh, Pinned distance sets, Wolffβs exponent in finite fields and sum-product estimates , Math.Z. 271 (2012), 63-93.
- 5[5] D. Covert, D. Koh, and Y. Pi, On the sums of any k π k points in finite fields, SIAM J. Discrete Math. 30 (2016), no.1, 367-382.
- 6[6] D. Covert, D. Koh, and Y. Pi, The k π k -resultant modulus set problem on algebraic varieties over finite fields, www.arxiv(2015).
- 7[7] D. Hart, and A. Iosevich, Ubiquity of simplices in subsets of vector spaces over finite fields, Anal. Math. 34 (2008), no.1, 29-38.
- 8[8] P. ErdΓΆs, On sets of distances of n π n points , Amer. Math. Monthly, 53 (1946), 248-250.
