WorksMathematics
Geometric progressions in distance sets in odd dimensions over prime fields
Abstract
For , let , where . We introduce and study the problem of the existence of nondegenerate three-term geometric progressions in the distance set when is odd. If denotes the largest size of a set whose distance set contains no such progression, then, for every prime and every integer , For all sufficiently large primes , we also prove where is an absolute positive constant.
Introduction
Throughout the paper, is an odd prime and is the field with elements. For , let
The finite-field Erdős–Falconer problem asks how large a set must be to determine a positive proportion of all possible distances. Bourgain, Katz, and Tao [4] connected planar distance estimates with the sum–product problem. Iosevich and Rudnev [10] developed a Fourier-analytic approach and proved that, for , the condition implies . Hart, Iosevich, Koh, and Rudnev [7] showed that the exponent cannot in general be lowered in odd dimensions. In even dimensions, it is conjectured that the sharp exponent is . This was confirmed recently, up to a log factor, in [16].
In this paper, we ask whether the structure of distance sets allows us to obtain a prescribed configuration, such as an arithmetic or a geometric progression, under weaker size assumptions on than those in the distance estimates above. Previous work has considered square and nonsquare distances [12], and the values that can be represented as ratios of nonzero distances [8, 9, 15].
In particular, we take a first step in this direction by studying three-term geometric progressions in distance sets.
We start with a definition.
Definition 1.1. Let . A nondegenerate three-term geometric progression in is a triple
The three terms are nonzero and pairwise distinct. Equivalently, they are distinct nonzero values satisfying . Multiplication by a nonzero scalar preserves the existence of such a progression. Unless otherwise stated, geometric progressions have three terms.
The main question is formulated formally as follows.
Question 1.2. How large must be in order that contain a nondegenerate geometric progression?
Positive-density results already give partial answers for the existence of such progressions. Szemerédi’s theorem [21] states that, for each fixed and , every subset of of size at least contains a -term arithmetic progression when is sufficiently large. Applying this theorem to a short interval of exponents in the cyclic group gives the corresponding assertion for geometric progressions of every fixed length in sets of fixed positive density. For three terms, Roth’s theorem [19] is sufficient. The quantitative bounds of Bloom and Sisask [3] and Raghavan [18] give more: for every fixed , , the condition
forces such a progression in when is sufficiently large in terms of , .4 Therefore, regarding Question 1.2, by [16], the condition is sufficient when is even. This condition is also necessary, except in one case involving nonsplit forms, which will be explained in § 5.
It is worth noting that the arithmetic and geometric properties of the distance set play an important role in the study of Question 1.2. For arbitrary sets of field elements, a lower bound with a fixed exponent below one does not force such a progression. More precisely, for each fixed , a size condition does not force a nondegenerate three-term geometric progression in . Indeed, applying Behrend’s construction [2] to a short interval of exponents gives sets of size at least with no such progression; see § 5.
We now turn to odd dimensions. For each , define
Our main result gives upper and lower bounds for this extremal quantity.
Theorem 1.3. There are absolute constants and such that, for every prime and every integer ,
The constants are independent of the dimension. For , the sufficient exponent is strictly smaller than the exponent for a positive proportion of distances in odd dimensions.
The main ingredient in the proof is the following one-dimensional result.
Proposition 1.4. The following statements hold.
(i) There is an absolute constant such that, for every prime and every , the condition
implies that contains a nondegenerate geometric progression.
(ii) For every sufficiently large prime , there exists a set such that
and contains no nondegenerate geometric progression for every .
In dimension one, , where .
Geometric progressions in sumsets provide another relevant comparison. Ahmadi and Shparlinski [1] proved that contains three distinct nonzero terms in geometric progression whenever and . Taking gives such a progression in when . Shparlinski [20] strengthened the vector-space result and obtained progressions with a separate ratio in each coordinate.
The upper bound of Theorem 1.3 gives the following improvement for the case .
Corollary 1.5. There is an absolute constant such that, for every prime and every with , there exist such that
Sketch of main ideas of the proofs. We first reduce the problem in odd dimensions to dimension one, using a one-dimensional version of the quotient argument of Pham, Shen, and Xue [17]. We choose an -dimensional totally isotropic subspace . More precisely, averaging over its orthogonal-group orbit controls the number of pairs of points of in common affine cosets of . In a suitable affine coset of , projection to the one-dimensional space then produces a large set with for some . For the lower bound, replacing each point of by a translate of multiplies the cardinality by and changes the distance set only by a nonzero scalar.
To prove Proposition 1.4(i), suppose that contains no nondegenerate geometric progression. For with , the map
is injective on . This gives and bounds the sizes of intersections of translates and dilates of . Plünnecke’s inequality also gives . We apply these estimates to the variance of the number of representations as a product of two nonzero differences. At every nonzero squared difference this number is small, whereas its mean is large when is large. Comparing the resulting lower and upper bounds for the variance gives .
For part (ii), we select vectors in with prescribed digit counts and project them linearly to . We delete points to remove relations that would produce nondegenerate geometric progressions among squared differences. The choice of four digits ensures that polynomial identities give only degenerate progressions. Suitable digit weights bound the number of deleted points and leave a set of size at least . The cylinder construction then gives the examples in every odd dimension.
Structure. Section 2 contains the reduction to dimension one and deduces Theorem 1.3 from Proposition 1.4. Sections 3 and 4 prove parts (i) and (ii) of that proposition, respectively. Section 5 discusses even dimensions and the remaining extremal questions.
We write if for an absolute constant , if , and if both inequalities hold. Constants may vary from one occurrence to the next.
Reduction: from to
We compare the extremal problem in odd dimensions with the one-dimensional problem. The comparison does not depend on the exponents in Theorem 1.3.
Proposition 2.1. For every prime and every integer ,
The constants are independent of the dimension. Thus, every one-dimensional upper bound or construction transfers to all odd dimensions, with the factor . For the upper bound, we extract a large set in an isotropic quotient. For the lower bound, we replace each point of a one-dimensional set by a translate of a totally isotropic subspace. We first record the quadratic-form and Fourier identities used in these two arguments.
Quadratic forms and isotropic quotients
Let be a nondegenerate quadratic form on . Its associated bilinear form is
For a subspace , we write
For the standard form , we have . All orthogonal complements below are taken with respect to the form under consideration.
The subspace is totally isotropic if for every . Since is odd, this implies for all . Hence, . If and , then
Thus, the value of depends only on the coset , so defines a quadratic form on . In particular, passing from an affine coset of to this quotient preserves the quadratic values of all differences.
The induced form is nondegenerate. Since , we also have
Witt decomposition shows that every nondegenerate quadratic form on has a totally isotropic subspace of dimension ; see [9 Lemma 2.1]. For such a subspace , the quotient is one-dimensional and nondegenerate. Therefore, the induced quadratic form is with .
Extraction of a one-dimensional set
The next lemma extracts a set whose squared differences, after multiplication by a nonzero scalar, belong to .
Lemma 2.2. Let , let , and let . There are and such that
When , the denominator in parentheses in (4) is at most 3. We retain the full bound so that Proposition 2.1 can be proved without an initial restriction on .
Proof. We seek a totally isotropic -dimensional subspace and an affine coset of in which many cosets of meet . After translation, their images in will form the required set . To find , we estimate the number of pairs of points of lying in the same coset of .
We first bound the number of pairs at distance zero. Write . We have and
a proof can be found in [11].
We now average over isotropic subspaces. Choose one such subspace of dimension , and choose uniformly from its orbit under the orthogonal group. To compute the probability that a fixed vector lies in , we use transitivity on the nonzero isotropic vectors. This can be checked directly. For two such vectors , reflection across the hyperplane orthogonal to sends to if . If , choose with and first reflect across the hyperplane orthogonal to . Its inner product with is then nonzero. Such a exists because the displayed nonzero polynomial has degree four, less than , and so cannot vanish at every point of . It follows by double counting that, for every nonzero isotropic vector ,
The sum counts ordered pairs of points whose difference lies in . By (5) and (6), its expectation is at most
Fix for which this bound holds. The Cauchy–Schwarz inequality then shows that at least
affine cosets of meet . Each lies in one affine coset of . Since there are cosets of , some affine subspace contains at least
cosets of that meet .
Translate by and take its image in . By (3), the quotient is one-dimensional and nondegenerate, so its form can be written as with . Identify the image with a set , and choose one representative for each . The quotient form gives
This proves both assertions and completes the proof. □
The cylinder construction
The reverse construction replaces each element of by a translate of an -dimensional totally isotropic subspace. This multiplies the cardinality by , while the distances depend only on the corresponding elements of . The following lemma is the coordinate-free form of the construction in [9 Lemma 2.1(ii) and Section 4.2].
Lemma 2.3. Let be an integer and let . There exist a totally isotropic -dimensional subspace and a vector such that and, for every , the set
satisfies
Proof. If , then the conclusion follows by taking and , so that . Therefore, it remains to prove the result in the case .
Choose a totally isotropic subspace of dimension , as in Section 2.1. The quadratic form induced by on is nondegenerate and one-dimensional. Hence, for any ,
Since , the representation , with and , is unique. Therefore,
Moreover, for and , the total isotropy of and the fact that give
Consequently,
Thus, . The reverse inclusion follows by taking . Hence, . This completes the proof.
Proof of Proposition 2.1, Theorem 1.3, and Corollary 1.5
We now combine the two lemmas. The estimate allows us to absorb the dependence on in the denominator of (4).
Proof of Proposition 2.1. If , then (2) follows directly from the definition of . We henceforth assume that . We first note that
Indeed, if has more than elements, then and intersect for every , so . Hence, contains all nonzero squares. The set of nonzero squares is a cyclic multiplicative subgroup of order . Therefore, it contains a nondegenerate geometric progression.
Let be nonempty and suppose that its distance set contains no nondegenerate geometric progression. By Lemma 2.2 and the invariance under nonzero scaling noted after Definition 1.1,
Multiplying through by the denominator and collecting the terms containing , we obtain
Since , the factor on the left is greater than . Hence, . This proves the upper bound in (2).
For the lower bound, choose with such that contains no nondegenerate geometric progression. Lemma 2.3 constructs a set satisfying and for some . Since multiplication by preserves nondegeneracy, also contains no nondegenerate geometric progression. Consequently, . This proves (2) and completes the proof.
The main theorem follows by applying the comparison to the two one-dimensional bounds.
Proof of Theorem 1.3. Proposition 1.4(i) gives an absolute constant such that for every prime . Part (ii) gives an absolute such that for every prime . Hence, Proposition 2.1 yields
Taking proves the theorem. Both and are independent of . This completes the proof.
Proof of Corollary 1.5. By Proposition 1.4(i), there exist such that are pairwise distinct and form a geometric progression. Thus,
and hence
Therefore, or . Since is symmetric, replacing by if necessary, we may assume that .
Set and . Then and
Thus, . Moreover,
since . This completes the proof.
We prove the two parts of Proposition 1.4 in the next two sections.
Proof of Proposition 1.4(i)
The proof compares two bounds for the variance of the number of representations of a nonzero field element as a product of two differences from . The absence of a progression makes this number small at every nonzero squared difference. We first show that there are many such squared differences and establish the injectivity estimate needed for the upper bound on the variance.
Consequences of the absence of a progression
The three conclusions of the next lemma have different roles. The bound for controls the exceptional slopes in the variance estimate, the bound for supplies many squared differences, and the bound for the number of solutions to controls the remaining slopes. All three follow from the injectivity of when and $t^4 \ne 1.
Lemma 3.1. Let be a prime and let . If contains no nondegenerate geometric progression, then
Moreover, for with and every ,
Proof. Fix with and consider the map
If two triples and have the same image, then
If the triples are distinct, then , and these three differences are nonzero and have common ratio . Their squares would form a nondegenerate geometric progression in , since . Thus, is injective. Since for , taking yields .
To obtain the lower bound for , apply Plünnecke’s inequality [14 Theorem 1.1] to and . This gives a nonempty set such that
For every , we have
Since is injective,
Since , it follows that .
Finally, for each , the map sends injectively into . Comparing cardinalities gives
which proves (3.2). This completes the proof.
The variance argument
For a nonempty set , let for . Thus, if and only if . To count products of nonzero differences with their multiplicities, define
Its mean is
The formula for the mean follows from .
Let . If satisfy and , then . Consequently, and
Thus, these three values form a geometric progression, possibly degenerate. When no nondegenerate progression is present, only a bounded number of pairs are possible. Thus, is small. For , these values lie below half the mean and give the lower bound in the following lemma. The upper bound will follow from Lemma 3.1.
Lemma 3.2. Let be a prime and let . Suppose that contains no nondegenerate geometric progression. Then
If , then also
where the implied constant is absolute.
Proof of Lemma 3.2. We first bound the variance from above by counting pairs on lines of a fixed slope. We then obtain the lower bound from the small values of at nonzero squared differences.
The equation can be written as and for some . This relates the second moment of to the numbers of solutions of . We count these solutions through the fibers of . For , let
Since , expanding the square in reduces the calculation to counting solutions of . When , each choice of gives one value of ; when , a solution requires and then all values of are allowed. Hence,
Subtracting gives
For with , (3.2) implies . For the at most four values of satisfying , we use . For with , we have . The values satisfying contribute at most . Thus, (3.3) and the bound from Lemma 3.1 yield
We now transfer this estimate to . Grouping the weighted solutions of by gives
Moreover, since multiplication by any permutes ,
Thus, and the function have the same mean and second moment.
For , the sum counts solutions of in . Removing the solutions with gives
Combining this identity with (3.5) and the equality of the means, we obtain
where the last inequality follows from (3.4).
We now prove the lower bound. For , each nonzero summand in corresponds to nonzero with . The terms form a geometric progression with ratio . This progression must be degenerate, so , or equivalently . There are at most four choices for , each determining . Since , we obtain
Assume now that . Then
Since , we also have .
Since is symmetric and is odd, the squaring map is two-to-one on , so the set has cardinality . Moreover, (3.7) and the bound give for every . Therefore,
This completes the proof.
We can now prove the upper bound. The next calculation explains the exponent .
Proof of Proposition 1.4(i). Assume that contains no nondegenerate geometric progression. If , then the required bound is immediate. Hence, we may assume . Comparing the two estimates in Lemma 3.2, we obtain
Since (3.1) and imply , it follows that
Choosing the constant in Proposition 1.4(i) sufficiently large proves the assertion. This completes the proof.
Proof of Proposition 1.4(ii)
We construct a large family of integer vectors, project it to , and delete points to remove the relations that would produce a nondegenerate geometric progression.
Random projection and deletion
To construct the set in Proposition 1.4(ii), we must control relations among all differences of . The following criterion allows us to work before squaring those differences.
For , the set contains a nondegenerate geometric progression if and only if there exist with
Indeed, gives the progression . The inequality is precisely its nondegeneracy condition. Conversely, a progression of squared differences satisfies . Thus, . Since is symmetric, we may replace with to remove the minus sign.
We begin with a family of integer vectors in and project it linearly to . A collision in the projection or an unwanted quadratic relation can be removed by deleting points so that one of its differences no longer occurs. There are two kinds of quadratic relations. If the defining polynomial is nonzero, its probability of vanishing is at most . If it is identically zero, the choice of four digits will imply that the progression is degenerate.
In the next lemma, counts the ordered pairs with difference . For a relation involving three differences, we delete the occurrences of a least frequent difference. The cost is at most the geometric mean of the three multiplicities. This is why the cube-root sum appears in the estimate.
Lemma 4.1. Let and . With differences and intersections taken in , let
For every prime , there exists such that contains no nondegenerate geometric progression and
Proof. We will choose a map from to and delete points from . The set will be the image of the remaining subset . For , define
where is the residue class of the integer modulo . Thus, we first reduce the coordinates modulo and then take their dot product with in . We use this map on and on its difference set .
We need to satisfy two requirements. First, must be injective on . Second, with , every must satisfy
By (16), the second requirement excludes nondegenerate geometric progressions in . The first gives , so the required cardinality bound follows if
We choose uniformly. A collision occurs when a nonzero difference vector projects to zero. A relation among three projected differences gives a quadratic equation in . We will delete points to remove all collisions and all such relations defined by nonzero polynomials. Each deletion will make one of the relevant difference vectors disappear. For a fixed , the event has probability . A fixed nonzero quadratic polynomial vanishes with probability at most . These estimates will bound the expected number of deleted points. Polynomial identities require a separate argument: we will show at the end that the four-digit assumption makes every remaining relation degenerate.
We now define the deletions. For each , define
We have . Whenever satisfy , we have , so deleting leaves no pair with difference .
For each ordered triple , define
Choose among to minimize , resolving ties by a fixed rule independent of . Let be obtained from by deleting whenever and , and deleting whenever and .
We next estimate the expected number of deleted points. Every nonzero remains nonzero modulo , since its coordinates have absolute value at most and . Hence, with probability . Similarly, if , then has total degree two and at most zeros in , so with probability at most . Since the number of deleted points is bounded by the sum of the cardinalities of the deleted sets, its expectation is at most
For , we have
Enlarging the triple sum to bounds the expected number of deleted points by
Fix a choice of for which the number of deleted points does not exceed this bound, and set . The restriction of to is injective: if distinct had the same image, then would satisfy and , so would have been deleted. Consequently, , which gives (17).
It remains to show that contains no nondegenerate geometric progression. Suppose that nonzero differences satisfy . Choose nonzero vectors whose images under are , respectively. For , we then have . If , the set would have been deleted, contradicting . Therefore, .
Unique factorization in implies that the three nonzero linear forms , , and are proportional. Every minor formed from their coefficient vectors vanishes modulo . Since each such minor is an integer of absolute value at most , it also vanishes over . Thus, the vectors are proportional over , so we may write
where is a primitive integer vector and are nonzero integers. The coordinate bounds give . Since is primitive, it is nonzero modulo , and substituting these expressions into yields
Together with , this gives the integer equality . The only factorizations of , , or into two nonzero integers of absolute value at most have factors of equal absolute value. It follows that
In particular, , so (16) shows that contains no nondegenerate geometric progression. This completes the proof.
The choice of the four digits ensures that the polynomial identities left untreated by our deletion rule produce only degenerate progressions. This property fails for five consecutive digits. Indeed, the difference set of contains , , , where is a coordinate vector, and
For any projection with , these differences give the squared values , , , which form a nondegenerate geometric progression when . Since the displayed polynomial is identically zero, it vanishes with probability one, and the bound for nonzero polynomials does not apply. Thus, extending this construction to five consecutive digits would require an additional argument to handle such identities.
A family with prescribed digit counts
To apply Lemma 4.1, we need a large family for which is small compared with . We prescribe the digit counts so that all vectors in the family have the same weight. The weighted pair count in the full cube then factors over the coordinates and gives the required estimate for .
Proof of Proposition 1.4(ii). We choose a family in which each digit has a prescribed number of occurrences. First we estimate its size and the quantity . We then choose so that the deletion bound in Lemma 4.1 leaves at least half the family.
Let be a positive multiple of 26, to be chosen below. For , write for , and set
With
Stirling’s formula gives absolute constants such that
To estimate , set and define
For every , we have
For , let
so that
Write and use the difference multiplicity defined in Lemma 4.1. For each , we obtain
Taking cube roots and enlarging the sum to gives
where
In particular,
We now choose so that Lemma 4.1 gives a set of size at least . Since and , we have
Hence,
The logarithmic correction in the following choice of compensates for the factor in (19). For a fixed constant , to be specified below, take
For all sufficiently large , this is a positive multiple of and satisfies . Applying Lemma 4.1 to and using (23), we obtain a set such that contains no nondegenerate geometric progression and
Fix so that the last expression is at most . Moreover, since for all sufficiently large , we have
It follows that for all sufficiently large .
It remains to estimate the size of in terms of . The definition of also gives
Therefore,
Combining this with (19), , and , we obtain
To verify that , it suffices to show , since . Substituting the definitions yields
The integer inequalities
imply , while direct integer arithmetic gives
Thus, the ratio in (26) is greater than 1, proving . Since
the bound (25) implies for all sufficiently large . Finally, multiplication by any preserves the absence of a nondegenerate geometric progression, as noted after Definition 1.1. This completes the proof.
Numerically, , so is a convenient rational exponent below the exponent obtained in (25). We do not claim that the digit set, the prescribed counts, or the weights are optimal, or that is the optimal lower exponent.
Further remarks
The preceding sections reduce the odd-dimensional extremal problem to dimension one. We now explain what is known in even dimensions, where the split and nonsplit forms behave differently. We then show why the condition , for fixed , does not force a progression in an arbitrary set , and state the remaining questions.
Even dimensions
The distance estimate of Pham, Shen, Tran, and Xue [16], combined with a quantitative form of Roth’s theorem, gives a uniform sufficient threshold in even dimensions. This threshold is sharp for split forms. For the standard nonsplit form, the remaining extremal problem reduces to the plane. We first bound the cardinality of an arbitrary set containing no nondegenerate geometric progression. This will be applied to distance sets in both cases.
Lemma 5.1. There is an absolute constant such that, for every sufficiently large prime , every set containing no nondegenerate geometric progression satisfies
Consequently, for every , there exists such that
whenever is prime and .
Proof. Let be the largest cardinality of a subset of containing no three distinct terms in arithmetic progression. By Raghavan [18 Theorem 1.4], there is an absolute constant such that
for all sufficiently large .
Suppose that contains no nondegenerate geometric progression. Choose a primitive root and let
If contained integers with , then would be three distinct nonzero elements of in geometric progression. Their distinctness follows because their exponents belong to . Thus, and
for all sufficiently large , with a suitable absolute constant . The final assertion follows since
for every fixed . This completes the proof. □
A uniform sufficient threshold. We apply the preceding lemma to the recent distance estimate. For a quadratic form on , let
A nondegenerate form on is called split if it has an -dimensional totally isotropic subspace, and nonsplit otherwise. In the nonsplit case, the largest dimension of a totally isotropic subspace is . Pham, Shen, Tran, and Xue [16 Theorem 1.1 and Remark 1.2] proved that, for every nondegenerate and every with ,
where is absolute. If is nonsplit, the same conclusion holds when ; in fact, their estimate gives in this case, after decreasing if necessary. The constants are independent of .
Corollary 5.2. There is an absolute constant such that the following holds for every odd prime and every integer . Let be a nondegenerate quadratic form on and let . If , then contains a nondegenerate geometric progression. The same conclusion holds if and is nonsplit.
Proof. For , we have . Thus, (28) gives
Lemma 5.1, with and , proves the assertion when . The quoted estimate for nonsplit forms gives the conclusion at equality as well. Since is absolute, the lower bound on is independent of and . This completes the proof.
Split forms. The strict inequality is sharp when is split. Indeed, a split form has a totally isotropic subspace of dimension . Taking gives and . For the standard form , the split condition is that be a square in ; see [17 Lemma 2.7]. Consequently,
for all sufficiently large primes whenever is even or .
Nonsplit forms. For the standard form, the remaining case is and odd. A totally isotropic subspace then has dimension at most , so the preceding example does not establish sharpness of the exponent . A cylinder over a planar set gives a lower comparison with , and the extraction theorem gives the upper comparison. We record both inequalities together with the available planar bounds.
Proposition 5.3. There are absolute constants , , and such that, for every prime with and every odd integer ,
Moreover,
Proof. We first prove (30) and then establish the planar bounds in (31).
By the classification of quadratic forms over , a linear change of coordinates identifies with
see [17 Lemma 2.7]. If has no nondegenerate geometric progression in its distance set, then, in these coordinates, the set
has elements and distance set . This proves the lower bound in (30).
For the upper bound, let have no nondegenerate geometric progression in . Corollary 5.2 gives . The extraction theorem of Pham, Shen, and Xue [17 Theorem 1.1], with the residual binary form identified with , gives a set such that and
where is absolute. Since , the upper bound follows.
To prove (31), let be the set from Proposition 1.4(ii). Then , giving . Next, let be nonempty and have no nondegenerate geometric progression in . Again, Corollary 5.2 gives . Since is anisotropic, the planar estimate of Pham, Shen, Tran, and Xue [16 Theorem 1.3] yields
where the last inequality is Lemma 5.1. Since , we obtain
for a suitable absolute constant . This completes the proof.
In particular, for and odd ,
Thus, as tends to infinity through these primes. The upper bound does not give a fixed power improvement below , and the lower bound does not establish sharpness of the exponent . Determining the optimal exponent in this nonsplit case reduces, by (30), to determining it for when .
Cardinality alone is not enough
Lemma 5.1 forces a progression at every density . A fixed power bound is different: for every , the size condition does not force a nondegenerate geometric progression in an arbitrary set . Indeed, let . Behrend’s construction [2] gives a set with containing no arithmetic progression of three distinct terms. Choose a generator of and set . A nondegenerate geometric progression in would give distinct satisfying . Since , this congruence would imply over the integers, contrary to the choice of .
After increasing the absolute constant if necessary, we obtain
for all sufficiently large . For every fixed , this lower bound exceeds once is sufficiently large, showing that such a size condition alone does not force a nondegenerate geometric progression. The argument in Section 3 uses the additional structure of squared difference sets.
Remarks over arbitrary finite fields
Let be a power of a prime . Define and over by the same formulas as over . The arguments in Sections 2–4 extend to this setting. For every integer ,
Moreover, there are absolute constants and such that
whenever . These constants are independent of , , and the degree of the field extension. Questions of sharpness and the construction of extremal examples are more involved over general finite fields. To keep the presentation focused and consistent with recent progress on the distance problem over prime fields, we state and prove the main results only over prime fields.
Open questions
The one-dimensional extremal problem. Proposition 1.4 gives, for all sufficiently large primes ,
The gap between these bounds leads to the following question.
Question 5.4. What is the order of magnitude of as tends to infinity through the primes?
By Proposition 2.1,
with absolute implied constants, so an answer to Question 5.4 would also determine the extremal order in every odd dimension.
Other arithmetic patterns. A natural next question is how large must be for to contain other patterns, such as a nontrivial three-term arithmetic progression or a geometric progression of length at least four.
On –Salem sets. Fraser introduced –Salem sets and studied their distance sets in [6]; see also [5] for subsequent results. It would be interesting to determine whether suitable –Salem hypotheses lower the size thresholds for geometric progressions proved in this paper.
Acknowledgement. D. T. Tran would like to thank the Vietnam Institute for Advanced Study in Mathematics (VIASM) for its warm hospitality and excellent research environment.
References
- [1]O. Ahmadi and I. E. Shparlinski, Geometric progressions in sumsets over finite fields, Monatshefte für Mathematik, 152(3) (2007), 177–185.DOI
- [2]F. A. Behrend, On sets of integers which contain no three terms in arithmetical progression, Proceedings of the National Academy of Sciences of the United States of America, 32(12) (1946), 331–332.pubmed.ncbi.nlm.nih.gov/16578230
- [3]T. F. Bloom and O. Sisask, An improvement to the Kelley–Meka bounds on three-term arithmetic progressions, arXiv:2309.02353, 2023.arxiv.org/abs/2309.02353
- [4]J. Bourgain, N. H. Katz, and T. Tao, A sum-product estimate in finite fields, and applications, Geometric and Functional Analysis, 14(1) (2004), 27–57.
- [5]D. Cheong, G. Ge, D. Koh, T. Pham, D. T. Tran, and T. Zhang, Additive structures imply more distances in F_q^d, arXiv:2510.26364, 2025.arxiv.org/abs/2510.26364
- [6]J. M. Fraser, L^p averages of the Fourier transform in finite fields, Indiana University Mathematics Journal, to appear. arXiv:2407.08589.arxiv.org/abs/2407.08589
- [7]D. Hart, A. Iosevich, D. Koh, and M. Rudnev, Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdős–Falconer distance conjecture, Transactions of the American Mathematical Society, 363(6) (2011), 3255–3275.arxiv.org/abs/0707.3473
- [8]A. Iosevich, D. Koh, and H. Parshall, On the quotient set of the distance set, Moscow Journal of Combinatorics and Number Theory, 8(2) (2019), 103–115.DOI
- [9]A. Losevich, D. Koh, and F. Rakhmonov, The quotient set of the quadratic distance set over finite fields, Forum Mathematicum, 36(5) (2024), 1341–1358.
- [10]A. Losevich and M. Rudnev, Erdős distance problem in vector spaces over finite fields, Transactions of the American Mathematical Society, 359(12) (2007), 6127–6142.
- [11]A. Losevich, D. Koh, and M. Lewko, Finite field restriction estimates for the paraboloid in high even dimensions, Journal of Functional Analysis, 278(11) (2020), 108450.
- [12]D. Koh, M. Q. Pham, and T. Pham, Structural theorems on the distance sets over finite fields, Forum Mathematicum, 35(4) (2023), 925–938.arxiv.org/abs/2111.14076
- [14]G. Petridis, New proofs of Plünnecke-type estimates for product sets in groups, Combinatorica, 32(6) (2012), 721–733.
- [15]T. Pham, Group action and L²-norm estimates of geometric problems, Journal of Mathematical Analysis and Applications, 531(1) (2024), 127748.DOI
- [16]T. Pham, C.-Y. Shen, D. T. Tran, and B. Xue, Quadratic distances in even dimensions over prime fields, arXiv:2610.01795v2, 2026.arxiv.org/abs/2610.01795
- [17]T. Pham, C.-Y. Shen, and B. Xue, On Erdős–Falconer distance problem in even dimensions, arXiv:arXiv:2607.17324v1, 2026.arxiv.org/abs/2607.17324
- [18]R. Raghavan, Improved bounds for 3-progressions, arXiv:2603.27045v3, 2026.arxiv.org/abs/2603.27045
- [19]K. F. Roth, On certain sets of integers, Journal of the London Mathematical Society, 28(1) (1953), 104–109.DOI
- [20]I. E. Shparlinski, Geometric progressions in vector sumsets over finite fields, Finite Fields and Their Applications, 68 (2020), 101747.DOI
- [21]E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arithmetica, 27(1) (1975), 199–245.