betaFeedback

WorksMathematics

Geometric progressions in distance sets in odd dimensions over prime fields

Abstract

For E⊂FpdE\subset\mathbb{F}_p^d, let Δ(E)={Qd(x−y):x,y∈E}Δ(E)=\{Q_d(x-y):x,y\in E\}, where Qd(z)=z12+⋯+zd2Q_d(z)=z_1^2+\cdots+z_d^2. We introduce and study the problem of the existence of nondegenerate three-term geometric progressions in the distance set Δ(E)Δ(E) when dd is odd. Let MGP,d(p)M_{GP,d}(p) be the largest size of a set whose distance set contains no such progression. For every prime p≥7p\geq7 and every integer m≥0m\geq0, we prove pmMGP,1(p)≤MGP,2m+1(p)≤4pmMGP,1(p). p^mM_{GP,1}(p)\leq M_{GP,2m+1}(p) \leq4p^mM_{GP,1}(p). For all sufficiently large primes pp, we also prove pm+726≤MGP,2m+1(p)≤Cpm+1625, p^{m+\frac{7}{26}}\leq M_{GP,2m+1}(p) \leq Cp^{m+\frac{16}{25}}, where CC is an absolute positive constant.

Introduction

Throughout the paper, pp is an odd prime and Fp\mathbb{F}_p is the field with pp elements. For d≥1d \ge1, let

Qd(z)=z12+⋯+zd2,Δ(E)={Qd(x−y):x,y∈E}(E⊂Fpd).Q_d(z)=z_1^2+\cdots+z_d^2,\qquad\Delta(E)=\{Q_d(x-y):x,y\in E\}\quad(E\subset\mathbb{F}_p^d).

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 d≥2d \ge2, the condition ∣E∣≥Cpd+12|E| \ge Cp^{\frac{d+1}{2}} implies ∣Δ(E)∣≥cp|\Delta(E)| \ge cp. Hart, Iosevich, Koh, and Rudnev [7] showed that the exponent d+12\frac{d+1}{2} cannot in general be lowered in odd dimensions. In even dimensions, it is conjectured that the sharp exponent is d/2d/2. This was confirmed recently, up to a log factor, in [15].

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 EE 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, 14].

In particular, we take a first step in this direction by studying three-term geometric progressions in distance sets. We start with the following definition.

Definition 1.1. Let D⊂FpD \subset\mathbb{F}_p. A nondegenerate three-term geometric progression in DD is a triple

x, xr, xr2∈D,x,r∈Fp×,r2≠1.x,\ xr,\ xr^2\in D,\qquad x,r\in\mathbb{F}_p^\times,\qquad r^2\ne1.

The three terms are nonzero and pairwise distinct. Equivalently, they are distinct nonzero values t1,t2,t3t_1,t_2,t_3 satisfying t22=t1t3t_2^2=t_1t_3. 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 E⊂FpdE \subset\mathbb{F}_p^d be in order that Δ(E)\Delta(E) contain a nondegenerate geometric progression?

Positive-density results already give partial answers for the existence of such progressions. Szemerédi’s theorem [20] states that, for each fixed k≥3k \ge3 and δ>0\delta> 0, every subset of {1,…,N}\{1,\ldots,N\} of size at least δN\delta N contains a kk-term arithmetic progression when NN is sufficiently large. Applying this theorem to a short interval of exponents in the cyclic group Fp×\mathbb{F}_p^\times gives the corresponding assertion for geometric progressions of every fixed length in sets of fixed positive density. For three terms, Roth’s theorem [18] is sufficient. The quantitative bounds of Bloom and Sisask [3] and Raghavan [17] give more information: for every fixed c,K>0c,K>0, the condition

∣D∣≥cp(log⁡p)K|D|\ge\frac{cp}{(\log p)^K}

forces such a progression in D⊂FpD \subset\mathbb{F}_p when pp is sufficiently large in terms of c,Kc,K.1 Therefore, combining this conclusion with [15], the condition ∣E∣≫pd2|E| \gg p^{\frac{d}{2}} is sufficient when dd even. For d=2md=2m, the exponent mm is sharp in the split cases, namely when mm is even or p≡1(mod4)p \equiv1 \pmod{4}: there is a totally isotropic subspace of size pmp^m whose distance set is {0}\{0\}. In the nonsplit case, when mm is odd and p≡3(mod4)p \equiv3 \pmod{4}, the optimal exponent remains open; see Section 5.1.

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 ε>0\varepsilon>0, a size condition ∣D∣≥p1−ε|D| \ge p^{1-\varepsilon} does not force a nondegenerate three-term geometric progression in D⊂FpD \subset\mathbb{F}_p. Indeed, applying Behrend’s construction [2] to a short interval of exponents gives sets of size at least pe−Clog⁡pp e^{-C\sqrt{\log p}} with no such progression; see Section 5.

We now turn to odd dimensions. For each d≥1d \ge1, define

MGP,d(p)=max⁡{∣E∣:E⊂Fpd, Δ(E) contains no nondegenerate geometric progression}.M_{\mathrm{GP},d}(p)=\max\{|E|: E\subset\mathbb{F}_p^d,\ \Delta(E)\text{ contains no nondegenerate geometric progression}\}.

Our main result gives upper and lower bounds for this extremal quantity.

Theorem 1.3. There are absolute constants C≥1C\ge1 and p0≥7p_0\ge7 such that, for every prime p≥p0p\ge p_0 and every integer m≥0m\ge0,

pm+726≤MGP,2m+1(p)≤Cpm+1625.(1)p^{m+\frac{7}{26}} \le M_{\mathrm{GP},2m+1}(p) \le Cp^{m+\frac{16}{25}}. \tag*{(1)}

The constants are independent of the dimension. For m≥1m\ge1, the sufficient exponent m+1625m+\frac{16}{25} is strictly smaller than the exponent m+1=d+12m+1=\frac{d+1}{2} for a positive proportion of distances in odd dimensions.

For A⊂FpA\subset\mathbb{F}_p, we have Δ(A)=(A−A)2\Delta(A)=(A-A)^2, where (A−A)2={(a−b)2:a,b∈A}(A-A)^2=\{(a-b)^2:a,b\in A\}.

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 CC such that, for every prime p≥7p\ge7 and every A⊂FpA\subset\mathbb{F}_p, the condition

∣A∣≥Cp1625|A|\ge Cp^{\frac{16}{25}}

implies that (A−A)2(A-A)^2 contains a nondegenerate geometric progression.

(ii) For every sufficiently large prime pp, there exists a set A⊂FpA\subset\mathbb{F}_p such that

∣A∣≥p726|A|\ge p^{\frac{7}{26}}

and κ(A−A)2\kappa(A-A)^2 contains no nondegenerate geometric progression for every κ∈Fp×\kappa\in\mathbb{F}_p^\times.

Geometric progressions in sumsets provide another relevant comparison. Ahmadi and Shparlinski [1 Theorem 1] proved that A+BA+B contains three distinct nonzero terms in geometric progression whenever A,B⊂FpA,B\subset\mathbb{F}_p and ∣A∣∣B∣≥20p43|A||B|\ge20p^{\frac{4}{3}}. Taking B=−AB=-A gives such a progression in A−AA-A when ∣A∣≥20 p23|A|\ge\sqrt{20}\,p^{\frac{2}{3}}. Shparlinski [19] strengthened the vector-space result and obtained progressions with a separate ratio in each coordinate.

Proposition 1.4(i) gives the following improvement for difference sets.

Corollary 1.5. There is an absolute constant CC such that, for every prime p≥7p \ge7 and every A⊂FpA \subset\mathbb{F}_p with ∣A∣≥Cp16/25|A| \ge Cp^{16/25}, there exist x,r∈Fp×x,r \in\mathbb{F}_p^\times such that

x, xr, xr2∈A−A,r4≠1.x,\ xr,\ xr^2 \in A-A,\qquad r^4 \ne1.

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 [16]. We choose an mm-dimensional totally isotropic subspace WW. More precisely, averaging over its orthogonal-group orbit controls the number of pairs of points of EE in common affine cosets of WW. In a suitable affine coset of W⊥W^\perp, projection to the one-dimensional space W⊥/WW^\perp/W then produces a large set A⊂FpA \subset\mathbb{F}_p with κ(A−A)2⊆Δ(E)\kappa(A-A)^2 \subseteq\Delta(E) for some κ≠0\kappa\ne0. For the lower bound, replacing each point of AA by a translate of WW multiplies the cardinality by pmp^m and changes the distance set only by a nonzero scalar.

To prove Proposition 1.4(i), suppose that (A−A)2(A-A)^2 contains no nondegenerate geometric progression. For t≠0t \ne0 with t4≠1t^4 \ne1, the map

(a,b,c)⟼(b−ta,c−tb)(a,b,c) \longmapsto(b-ta,c-tb)

is injective on A3A^3. This gives ∣A∣3≤p2|A|^3 \le p^2 and bounds the sizes of intersections of translates and dilates of AA. Combining this injectivity with Plünnecke’s inequality gives ∣A−A∣≥∣A∣5/4|A-A| \ge|A|^{5/4}. 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 ∣A∣|A| is large. Comparing the resulting lower and upper bounds for the variance gives ∣A∣≪p16/25|A| \ll p^{16/25}.

For part (ii), we select vectors in {0,1,2,3}L\{0,1,2,3\}^{L} with prescribed digit counts and project them by a random linear map to Fp\mathbb{F}_p. 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 p7/26p^{7/26}. 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 X≪YX \ll Y if X≤CYX \le CY for an absolute constant C>0C > 0, X≫YX \gg Y if Y≪XY \ll X, and X≍YX \asymp Y if both inequalities hold. Constants may vary from one occurrence to the next. We use log for the natural logarithm.

Reduction: from 2m+12m+1 to 11

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 p≥7p \ge7 and every integer m≥0m \ge0,

pmMGP,1(p)≤MGP,2m+1(p)≤4pmMGP,1(p).(2)p^m M_{\mathrm{GP},1}(p) \le M_{\mathrm{GP},2m+1}(p) \le4p^m M_{\mathrm{GP},1}(p). \tag*{(2)}

The constants are independent of the dimension. Thus, every one-dimensional upper bound or construction transfers to all odd dimensions, with the factor pmp^m. 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 QQ be a nondegenerate quadratic form on Fpd\mathbb{F}_p^d. Its associated bilinear form is

BQ(u,v)=Q(u+v)−Q(u)−Q(v)2.B_Q(u,v)=\frac{Q(u+v)-Q(u)-Q(v)}{2}.

For a subspace W⊂FpdW\subset\mathbb{F}_p^d, we write

W⊥={u∈Fpd:BQ(u,w)=0 for every w∈W}.W^\perp=\{u\in\mathbb{F}_p^d:B_Q(u,w)=0\text{ for every }w\in W\}.

For the standard form QdQ_d, we have BQd(u,v)=u⋅vB_{Q_d}(u,v)=u\cdot v. All orthogonal complements below are taken with respect to the form under consideration.

References

  1. [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. [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. [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. [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.DOI
  5. [5]D. Cheong, G. Ge, D. Koh, T. Pham, D. T. Tran, and T. Zhang, Additive structures imply more distances in Fᵈ_q, arXiv:2510.26364, 2025.arxiv.org/abs/2510.26364
  6. [6]J. M. Fraser, Lᵖ averages of the Fourier transform in finite fields, Indiana University Mathematics Journal, to appear, arXiv:2407.08589.arxiv.org/abs/2407.08589
  7. [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. [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.
  9. [9]A. Iosevich, D. Koh, and F. Rakhmonov, The quotient set of the quadratic distance set over finite fields, Forum Mathematicum, 36(5) (2024), 1341–1358.
  10. [10]A. Iosevich 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. [11]A. Iosevich, 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. [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
  13. [13]G. Petridis, New proofs of Plünnecke-type estimates for product sets in groups, Combinatorica, 32(6) (2012), 721–733.
  14. [14]T. Pham, Group action and L²-norm estimates of geometric problems, Journal of Mathematical Analysis and Applications, 531(1) (2024), 127748.arxiv.org/abs/2208.04827
  15. [15]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
  16. [16]T. Pham, C.-Y. Shen, and B. Xue, On Erdős–Falconer distance problem in even dimensions, arXiv:2607.17324v1, 2026.arxiv.org/abs/2607.17324
  17. [17]R. Raghavan, Improved bounds for 3-progressions, arXiv:2603.27045v3, 2026.arxiv.org/abs/2603.27045
  18. [18]K. F. Roth, On certain sets of integers, Journal of the London Mathematical Society, 28(1) (1953), 104–109.DOI
  19. [19]I. E. Shparlinski, Geometric progressions in vector sumsets over finite fields, Finite Fields and Their Applications, 68 (2020), 101747.DOI
  20. [20]E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arithmetica, 27(1) (1975), 199–245.

Paper details

vlnc:W_ce5c37pc
Version
v2 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents