pith. sign in

arxiv: 2309.09124 · v4 · submitted 2023-09-17 · 🧮 math.NT

Multiplicative structure of shifted multiplicative subgroups and its applications to Diophantine tuples

Seoyoung Kim , Chi Hoi Yip , Semin Yoo This is my paper

Pith reviewed 2026-05-24 07:14 UTC · model grok-4.3

classification 🧮 math.NT
keywords multiplicative subgroupsshifted subgroupsproduct setsDiophantine tuplesfinite fieldsSárközy conjectureVinogradov theorem
0
0 comments X

The pith

If a nontrivial shift of a multiplicative subgroup contains a product set AB, then |A| times |B| is bounded essentially by |G|.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that when a shifted multiplicative subgroup in a finite field contains the product of two sets, the sizes of those sets cannot be too large relative to the subgroup. This structural result is used to improve bounds on the largest sets where pairwise products differ from a power by a fixed amount. It also gives the first nontrivial bound on generalized Diophantine tuples in finite fields and shows that certain quadratic shifts resist nontrivial multiplicative decompositions for most primes.

Core claim

If a nontrivial shift of a multiplicative subgroup G contains a product set AB, then |A||B| is essentially bounded by |G|. This refines a consequence of Vinogradov's result. The paper obtains the first non-trivial upper bound on the maximum size of a generalized Diophantine tuple over a finite field, determines the maximum size for an infinite family over fields of square order, and proves that for almost all primes p the set {x^2-1 : x in F_p^*} excluding 0 cannot be decomposed non-trivially as a product of two sets.

What carries the argument

Containment of a product set AB inside a nontrivial shift of a multiplicative subgroup G, which forces the size bound |A||B| ≲ |G|.

If this is right

  • A sharper upper bound holds for M_k(n), the largest size of a set whose pairwise products are each n less than a k-th power.
  • The first nontrivial upper bound is obtained for the maximum size of a generalized Diophantine tuple over a finite field.
  • The exact maximum size is determined for an infinite family of generalized Diophantine tuples over finite fields of square order.
  • For almost all primes p, the set {x^2-1 : x in F_p^*} excluding 0 admits no nontrivial product decomposition into two sets.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The size restriction on product sets may extend to shifts of subgroups in rings other than finite fields.
  • The finite-field Diophantine bounds could be lifted to give new information on the integer quantity M_k(n) via reduction modulo primes.
  • Similar incidence or character-sum methods might resolve the full Sárközy conjecture for other polynomial shifts.

Load-bearing premise

The arguments require the finite field to have square order or the prime to be large enough for character sum estimates and incidence geometry tools to apply.

What would settle it

An explicit example in a finite field of square order where a shifted multiplicative subgroup contains a product set AB with |A||B| much larger than |G| would disprove the main size bound.

read the original abstract

In this paper, we investigate the multiplicative structure of a shifted multiplicative subgroup and its connections with additive combinatorics and the theory of Diophantine equations. Among many new results, we highlight our main contributions as follows. First, we show that if a nontrivial shift of a multiplicative subgroup $G$ contains a product set $AB$, then $|A||B|$ is essentially bounded by $|G|$, refining a well-known consequence of a classical result by Vinogradov. Second, we provide a sharper upper bound of $M_k(n)$, the largest size of a set such that each pairwise product of its elements is $n$ less than a $k$-th power, refining the recent result of Dixit, Kim, and Murty. One main ingredient in our proof is the first non-trivial upper bound on the maximum size of a generalized Diophantine tuple over a finite field. In addition, we determine the maximum size of an infinite family of generalized Diophantine tuples over finite fields with square order, which is of independent interest. We also make significant progress towards a conjecture of S\'{a}rk\"{o}zy on the multiplicative decompositions of shifted multiplicative subgroups. In particular, we prove that for almost all primes $p$, the set $\{x^2-1: x \in \mathbb{F}_p^*\} \setminus \{0\}$ cannot be decomposed as the product of two sets in $\mathbb{F}_p$ non-trivially.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper studies the multiplicative structure of shifted multiplicative subgroups G in finite fields. It proves that if a nontrivial shift of G contains a product set AB then |A||B| is essentially bounded by |G|, refining a consequence of Vinogradov. It gives a sharper upper bound on M_k(n) (largest set with pairwise products n less than a k-th power), obtains the first non-trivial upper bound on the maximum size of a generalized Diophantine tuple over a finite field F_q, determines the exact maximum size for an infinite family of such tuples over square-order fields, and shows that for almost all primes p the set {x²-1 : x ∈ F_p^*} minus {0} has no nontrivial multiplicative decomposition.

Significance. If the stated bounds hold without unstated restrictions on the field order, the results refine existing work on product sets in subgroups and on Diophantine tuples, while advancing Sárközy's conjecture on multiplicative decompositions. The explicit determination of the maximum for square-order fields and the almost-all-p result on decompositions are concrete contributions.

major comments (1)
  1. [abstract and the section proving the general Diophantine-tuple bound] The abstract asserts the first non-trivial upper bound on the size of a generalized Diophantine tuple over an arbitrary finite field F_q. However, the exact determination of the maximum is stated only for fields of square order. If the proof of the general bound (likely the section containing the Diophantine-tuple estimate) relies on character-sum or incidence-geometry tools that require q to be square (or p sufficiently large with explicit constants), then the claimed generality does not hold and the result reduces to the square-order case already treated separately.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for highlighting this point about the scope of our results on generalized Diophantine tuples. We address the concern directly below.

read point-by-point responses

  1. Referee: [abstract and the section proving the general Diophantine-tuple bound] The abstract asserts the first non-trivial upper bound on the size of a generalized Diophantine tuple over an arbitrary finite field F_q. However, the exact determination of the maximum is stated only for fields of square order. If the proof of the general bound (likely the section containing the Diophantine-tuple estimate) relies on character-sum or incidence-geometry tools that require q to be square (or p sufficiently large with explicit constants), then the claimed generality does not hold and the result reduces to the square-order case already treated separately.

    Authors: The non-trivial upper bound on the maximum size of a generalized Diophantine tuple is proved for arbitrary finite fields F_q. The argument in the relevant section uses character-sum estimates (based on Weil bounds and standard estimates for multiplicative characters) that hold over any finite field without requiring the order to be a square. The exact determination of the maximum size is a separate, stronger result that applies to an infinite family of such tuples specifically over fields of square order. The abstract distinguishes these two contributions, and the claimed generality of the upper bound is accurate as stated. We are nevertheless willing to insert an additional clarifying sentence in the abstract and introduction in a revised version to make the distinction even more explicit. revision: partial

Circularity Check

0 steps flagged

No circularity; derivation chain is self-contained

full rationale

The paper derives new bounds on shifted multiplicative subgroups and generalized Diophantine tuples by refining external results (Vinogradov; Dixit-Kim-Murty) and applying character-sum/incidence tools. No step reduces by definition or construction to its own inputs, no fitted parameters are relabeled as predictions, and any self-citation is non-load-bearing refinement rather than the sole justification for a central claim. The stated results remain independent of the paper's own fitted values or prior outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on standard properties of finite fields and multiplicative subgroups; no free parameters or invented entities are mentioned in the abstract.

axioms (1)
  • standard math Standard facts about multiplicative subgroups and character sums in finite fields of prime order or square order.
    Invoked implicitly when bounding product sets and Diophantine tuples over F_p and F_q with q square.

pith-pipeline@v0.9.0 · 5805 in / 1363 out tokens · 23616 ms · 2026-05-24T07:14:17.499280+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. $f$-Diophantine sets over finite fields via quasi-random hypergraphs from multivariate polynomials

    math.CO 2025-03 unverdicted novelty 6.0

    New explicit constructions of quasi-random hypergraphs from multivariate polynomials over finite fields yield an asymptotic count for k-Diophantine m-tuples and unify prior hypergraph families.

Reference graph

Works this paper leans on

40 extracted references · 40 canonical work pages · cited by 1 Pith paper

  1. [1]

    Becker and M

    R. Becker and M. R. Murty. Diophantine m-tuples with the property D(n). Glas. Mat. Ser. III, 54(74)(1):65–75, 2019

    work page 2019

  2. [2]

    B ´erczes, A

    A. B ´erczes, A. Dujella, L. Hajdu, and F. Luca. On the size of sets whose elements have perfect powern-shifted products. Publ. Math. Debrecen, 79(3-4):325–339, 2011

    work page 2011

  3. [3]

    S. R. Blackburn, S. V . Konyagin, and I. E. Shparlinski. Counting additive decompositions of quadratic residues in finite fields. Funct. Approx. Comment. Math., 52(2):223–227, 2015

    work page 2015

  4. [4]

    Bugeaud and A

    Y . Bugeaud and A. Dujella. On a problem of Diophantus for higher powers.Math. Proc. Cambridge Philos. Soc., 135(1):1– 10, 2003

    work page 2003

  5. [5]

    J. P. Buhler, H. W. Lenstra, Jr., and C. Pomerance. Factoring integers with the number field sieve. In The development of the number field sieve, volume 1554 of Lecture Notes in Math., pages 50–94. Springer, Berlin, 1993

    work page 1993

  6. [6]

    Caporaso, J

    L. Caporaso, J. Harris, and B. Mazur. Uniformity of rational points. J. Amer. Math. Soc., 10(1):1–35, 1997

    work page 1997

  7. [7]

    A. B. Dixit, S. Kim, and M. R. Murty. Generalized Diophantine m-tuples. Proc. Amer. Math. Soc., 150(4):1455–1465, 2022

    work page 2022

  8. [8]

    A. Dujella. On the size of Diophantine m-tuples. Math. Proc. Cambridge Philos. Soc., 132(1):23–33, 2002

    work page 2002

  9. [9]

    A. Dujella. There are only finitely many Diophantine quintuples. J. Reine Angew. Math., 566:183–214, 2004

    work page 2004

  10. [10]

    A. Dujella. Diophantine m-tuples and Elliptic Curves , volume 79 of Developments in Mathematics . Springer, Cham, 2024

    work page 2024

  11. [11]

    Dujella and V

    A. Dujella and V . Petriˇcevi´c. Strong Diophantine triples. Experiment. Math., 17(1):83–89, 2008

    work page 2008

  12. [12]

    J.-H. Evertse. On the quantitative subspace theorem. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI), 377(Issledovaniya po Teorii Chisel. 10):217–240, 245, 2010

    work page 2010

  13. [13]

    Faltings

    G. Faltings. Endlichkeitss ¨atze f¨ur abelsche Variet¨aten ¨uber Zahlk¨orpern. Invent. Math., 73(3):349–366, 1983

    work page 1983

  14. [14]

    K. Ford. The distribution of integers with a divisor in a given interval. Ann. of Math. (2), 168(2):367–433, 2008

    work page 2008

  15. [15]

    P. X. Gallagher. A larger sieve. Acta Arith., 18:77–81, 1971

    work page 1971

  16. [16]

    A. M. G ¨ulo˘glu and M. R. Murty. The Paley graph conjecture and Diophantine m-tuples. J. Combin. Theory Ser. A , 170:105155, 9, 2020

    work page 2020

  17. [17]

    Gyarmati

    K. Gyarmati. On a problem of Diophantus. Acta Arith., 97(1):53–65, 2001

    work page 2001

  18. [18]

    Hajdu and A

    L. Hajdu and A. S ´ark¨ozy. On multiplicative decompositions of polynomial sequences, I. Acta Arith., 184(2):139–150, 2018

    work page 2018

  19. [19]

    Hajdu and A

    L. Hajdu and A. S ´ark¨ozy. On multiplicative decompositions of polynomial sequences, II. Acta Arith., 186(2):191–200, 2018

    work page 2018

  20. [20]

    Hajdu and A

    L. Hajdu and A. S ´ark¨ozy. On multiplicative decompositions of polynomial sequences, III. Acta Arith., 193(2):193–216, 2020

    work page 2020

  21. [21]

    Hanson and G

    B. Hanson and G. Petridis. Refined estimates concerning sumsets contained in the roots of unity. Proc. Lond. Math. Soc. (3), 122(3):353–358, 2021

    work page 2021

  22. [22]

    B. He, A. Togb ´e, and V . Ziegler. There is no Diophantine quintuple.Trans. Amer. Math. Soc., 371(9):6665–6709, 2019

    work page 2019

  23. [23]

    A. A. Karatsuba. Distribution of values of Dirichlet characters on additive sequences.Dokl. Akad. Nauk SSSR, 319(3):543– 545, 1991

    work page 1991

  24. [24]

    S. Kim, C. H. Yip, and S. Yoo. Explicit constructions of Diophantine tuples over finite fields. Ramanujan J., 65(1):163– 172, 2024

    work page 2024

  25. [25]

    E. Kummer. ¨Uber die erg ¨anzungss¨atze zu den allgemeinen reciprocit ¨atsgesetzen. Journal f¨ur die reine und angewandte Mathematik, 44:93–146, 1852

    work page

  26. [26]

    Lidl and H

    R. Lidl and H. Niederreiter. Finite fields, volume 20 of Encyclopedia of Mathematics and its Applications . Cambridge University Press, Cambridge, second edition, 1997

    work page 1997

  27. [27]

    Macourt, I

    S. Macourt, I. D. Shkredov, and I. E. Shparlinski. Multiplicative energy of shifted subgroups and bounds on exponential sums with trinomials in finite fields. Canad. J. Math., 70(6):1319–1338, 2018. 30

    work page 2018

  28. [28]

    H. L. Montgomery and R. C. Vaughan.Multiplicative number theory. I. Classical theory, volume 97 ofCambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2007

    work page 2007

  29. [29]

    I. Z. Ruzsa. Cardinality questions about sumsets. In Additive combinatorics, volume 43 of CRM Proc. Lecture Notes , pages 195–205. Amer. Math. Soc., Providence, RI, 2007

    work page 2007

  30. [30]

    S ´ark¨ozy

    A. S ´ark¨ozy. On additive decompositions of the set of quadratic residues modulo p. Acta Arith., 155(1):41–51, 2012

    work page 2012

  31. [31]

    S ´ark¨ozy

    A. S ´ark¨ozy. On multiplicative decompositions of the set of the shifted quadratic residues modulo p. In Number theory, analysis, and combinatorics, De Gruyter Proc. Math., pages 295–307. De Gruyter, Berlin, 2014

    work page 2014

  32. [32]

    Schoen and I

    T. Schoen and I. D. Shkredov. Character sums estimates and an application to a problem of Balog.Indiana Univ. Math. J., 71(3):953–964, 2022

    work page 2022

  33. [33]

    I. D. Shkredov. Any small multiplicative subgroup is not a sumset. Finite Fields Appl., 63:101645, 15, 2020

    work page 2020

  34. [34]

    I. E. Shparlinski. Additive decompositions of subgroups of finite fields. SIAM J. Discrete Math., 27(4):1870–1879, 2013

    work page 2013

  35. [35]

    S. A. Stepanov. On the number of points of a hyperelliptic curve over a finite prime field.Izv. Akad. Nauk SSSR, Ser. Mat., 33:1171–1181, 1969

    work page 1969

  36. [36]

    I. M. Vinogradov. Elements of number theory. Dover Publications, Inc., New York, 1954. Translated by S. Kravetz

    work page 1954

  37. [37]

    I. V . Vyugin and I. D. Shkredov. On additive shifts of multiplicative subgroups.Mat. Sb., 203(6):81–100, 2012

    work page 2012

  38. [38]

    C. H. Yip. Additive decompositions of large multiplicative subgroups in finite fields. Acta Arith., 213(2):97–116, 2024

    work page 2024

  39. [39]

    C. H. Yip. Improved upper bounds on Diophantine tuples with the propertyD(n), 2024. Bull. Aust. Math. Soc., to appear. arXiv:2406.00840

    work page arXiv 2024

  40. [40]

    C. H. Yip. Restricted sumsets in multiplicative subgroups, 2025. Canad. J. Math., to appear. https://doi.org/10. 4153/S0008414X24000920. APPENDIX A. A LGORITHM AND COMPUTATIONS We continue our discussion from the introduction on the following constant γk = lim sup n→∞ Mk(n) log n . It is implicit in [7] that γk ≤ 3ϕ(k). We also write νk = 2k k−2 ηkϕ(k). O...

    work page 2025