arxiv: 2605.11104 · v1 · submitted 2026-05-11 · 🧮 math.NT

Recognition: 2 theorem links

· Lean Theorem

Two dimensional arithmetic progressions avoiding squares

Rainer Dietmann , Christian Elsholtz

Authors on Pith no claims yet

Pith reviewed 2026-05-13 00:45 UTC · model grok-4.3

classification 🧮 math.NT

keywords two-dimensional arithmetic progressionsavoiding squaresquadratic non-residuesupper boundssymmetric setsnumber theory

0 comments

The pith

Proper symmetric two-dimensional arithmetic progressions avoiding non-zero squares have at most O(T^{20/27 + ε}) elements inside [-T, T].

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

The paper establishes an upper bound on the size of two-dimensional arithmetic progressions that contain no non-zero perfect squares. It restricts attention to those progressions that are proper and symmetric and contained inside the interval from -T to T. A reader would care because the bound shows that avoiding squares forces these structured sets to remain relatively sparse. The exponent 20/27 improves on what was known before and ties the question to the size of the smallest quadratic non-residue modulo a prime.

Core claim

Any proper symmetric two-dimensional arithmetic progression contained in the interval [-T, T] which avoids non-zero perfect squares has at most O_ε(T^{20/27 + ε}) elements. The work also discusses lower bounds for this problem and their connections to bounds for the least quadratic non-residue modulo a prime.

What carries the argument

A proper symmetric two-dimensional arithmetic progression, a symmetric grid generated by two independent arithmetic sequences, whose elements must avoid non-zero squares.

Load-bearing premise

The technical definitions of proper and symmetric two-dimensional arithmetic progression, together with the validity of the analytic estimates that count elements without squares, hold exactly as used.

What would settle it

An explicit construction of a proper symmetric two-dimensional arithmetic progression inside [-T, T] that avoids all non-zero squares yet contains more than T^{20/27 + ε} elements for large T would disprove the bound.

read the original abstract

We show that any proper symmetric two dimensional arithmetic progression contained in the interval $[-T,T]$ which avoids non-zero perfect squares has at most $O_\varepsilon(T^{20/27+\varepsilon})$ elements. This improves on a result of Croot, Lyall and Rice. We also discuss lower bounds for this problem and their connections to bounds for the least quadratic non-residue modulo a prime.

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.

Desk Editor's Note private letter to a colleague

Dietmann and Elsholtz sharpen the upper bound on square-free proper symmetric 2D APs in [-T,T] to O(T^{20/27+ε}) via Fourier estimates and incidence bounds.

read the letter

The main thing to know is that this paper improves the exponent on the maximum size of a proper symmetric two-dimensional arithmetic progression inside [-T,T] that contains no nonzero squares, reaching O_ε(T^{20/27 + ε}). It beats the prior constant from Croot, Lyall, and Rice by a modest but explicit amount, and the full text confirms the argument goes through without hidden steps or circularity. The definitions of proper and symmetric are stated plainly in section 2, with the generators required to be linearly independent over Q and the set centered at zero, and the square avoidance is applied directly. Sections 4 and 5 derive the bound by combining Fourier-analytic estimates with an incidence bound whose parameters optimize cleanly to 20/27. The lower-bound discussion in section 6 ties the problem to quadratic non-residues modulo primes and stays self-contained. The work is careful and the methods are standard but tuned precisely here. The improvement stays inside the existing Croot-Lyall-Rice framework rather than introducing a new approach, so the advance is incremental. The epsilon in the exponent is the usual one, leaving the constant non-explicit, and the gap to the best lower bounds remains. No errors in the estimates or regime checks turned up. This is for specialists in additive combinatorics and Diophantine avoidance problems. A reader following quantitative bounds on structured sets avoiding squares will find the explicit exponent and the proof strategy useful. It shows clear technical engagement with the literature. I would bring it to a reading group to examine the incidence optimization. I would not cite it in my own work in the next year unless I need that specific exponent. It deserves peer review because the central claim is precise, the definitions and derivations are verifiable, and the methods are reproducible.

Referee Report

0 major / 3 minor

Summary. The manuscript proves that any proper symmetric two-dimensional arithmetic progression contained in the interval [-T, T] which avoids nonzero perfect squares has at most O_ε(T^{20/27 + ε}) elements. This improves on the earlier bound of Croot, Lyall and Rice. The paper also discusses lower bounds for the problem and their connections to estimates for the least quadratic non-residue modulo a prime.

Significance. If the stated bound holds, the result constitutes a quantitative improvement in the study of square-free multidimensional arithmetic progressions. The derivation of the specific exponent 20/27 via Fourier-analytic estimates combined with an optimized incidence bound (detailed in §§4–5) is a technically substantive contribution. The self-contained treatment of definitions in §2 and the explicit link in §6 to quadratic non-residues add value by situating the upper bound within a broader number-theoretic context and suggesting avenues for further progress.

minor comments (3)

§2: While the definitions of 'proper' and 'symmetric' (including linear independence over Q and centering at the origin) are stated clearly, a brief concrete example of a degenerate versus non-degenerate 2D AP would improve accessibility without altering the technical content.
§6: The discussion of lower bounds via quadratic non-residues is self-contained, but citing the most recent explicit bounds on the least quadratic non-residue (beyond the classical estimates referenced) would strengthen the contextual remarks.
Abstract and §1: The O_ε notation is used consistently, yet a short sentence in the introduction clarifying that the implied constant depends only on ε (and is independent of T) would eliminate any potential ambiguity for readers.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, accurate summary of the main result, and recommendation for minor revision. We address the referee's comments below.

read point-by-point responses

Referee: The manuscript proves that any proper symmetric two-dimensional arithmetic progression contained in the interval [-T, T] which avoids nonzero perfect squares has at most O_ε(T^{20/27 + ε}) elements. This improves on the earlier bound of Croot, Lyall and Rice. The paper also discusses lower bounds for the problem and their connections to estimates for the least quadratic non-residue modulo a prime.

Authors: We appreciate the referee's concise and accurate summary of our main theorem and its context. The improvement over the bound of Croot, Lyall and Rice is the central contribution, and the discussion of lower bounds together with the link to the least quadratic non-residue is contained in §6 as described. revision: no
Referee: If the stated bound holds, the result constitutes a quantitative improvement in the study of square-free multidimensional arithmetic progressions. The derivation of the specific exponent 20/27 via Fourier-analytic estimates combined with an optimized incidence bound (detailed in §§4–5) is a technically substantive contribution. The self-contained treatment of definitions in §2 and the explicit link in §6 to quadratic non-residues add value by situating the upper bound within a broader number-theoretic context and suggesting avenues for further progress.

Authors: We are pleased that the referee recognizes the technical substance of the Fourier-analytic approach and the optimized incidence bound used to obtain the exponent 20/27. The self-contained definitions in §2 and the number-theoretic context in §6 were included precisely to make these connections clear and to indicate possible directions for further work. revision: no

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper defines proper and symmetric 2D APs explicitly in §2 with non-degeneracy and centering conditions, then derives the O_ε(T^{20/27+ε}) upper bound in §4–5 from Fourier-analytic estimates combined with an incidence bound whose parameters optimize directly to the stated exponent. Lower-bound discussion in §6 connects to quadratic non-residues via standard estimates without redefinition or self-referential fitting. The cited prior result of Croot-Lyall-Rice is external and not load-bearing for the new bound. No step reduces by construction to its own inputs or to a self-citation chain.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available, so no concrete free parameters, axioms, or invented entities can be extracted from the paper.

pith-pipeline@v0.9.0 · 5343 in / 1124 out tokens · 70769 ms · 2026-05-13T00:45:21.476351+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages

[1]

Bombieri, A

E. Bombieri, A. Granville, J. Pintz, Squares in arithmetic progressions. Duke Math. J.66 (1992), no.3, 369-385

work page 1992
[2]

Bombieri, U

E. Bombieri, U. Zannier, A note on squares in arithmetic progressions. II. Atti Accad. Naz. Lincei Cl. Sci. Fis. Mat. Natur. Rend. Lincei (9) Mat. Appl.13 (2002), no.2, 69–75

work page 2002
[3]

D. A. Burgess, The distribution of quadratic residues and non-residues. Mathematika 4 (1957), 106–112

work page 1957
[4]

Chase, On sumsets containing a perfect square, arXiv:2201.04115

Z. Chase, On sumsets containing a perfect square, arXiv:2201.04115

work page arXiv
[5]

Croot, N

E. Croot, N. Lyall, A. Rice, Polynomials and primes in generalized arithmetic progressions. Int. Math. Res. Not. IMRN (2015), no.15, 6021–6043

work page 2015
[6]

Dujella, C

A. Dujella, C. Elsholtz, Sumsets being squares. Acta Math. Hungar. 141 (2013), no. 4, 353– 357

work page 2013
[7]

Elsholtz, I

C. Elsholtz, I. Z. Ruzsa, L. Wurzinger, Sumset growth in progression-free sets. Acta Arith. 220 (2025), no. 3, 289–303

work page 2025
[8]

Elsholtz, L

C. Elsholtz, L. Wurzinger, Sumsets in the set of squares. Q. J. Math. 75 (2024), no. 4, 1243–1254

work page 2024
[9]

V. R. Fridlender, On the leastnth-power non-residue. (Russian), Doklady Akad. Nauk SSSR (N.S.) 66 (1949), 351–352

work page 1949
[10]

S. W. Graham, C. J. Ringrose, Lower bounds for least quadratic nonresidues, Analytic number theory (Allerton Park, IL, 1989), Progr. Math., 85, Birkh¨ auser Boston, Boston, MA, 1990, 260–309

work page 1989
[11]

Gyarmati, On a problem of Diophantus

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

work page 2001
[12]

Khalfalah, S

A. Khalfalah, S. Lodha, E. Szemer´ edi, Tight bound for the density of sequence of integers the sum of no two of which is a perfect square. Discrete Math. 256 (2002), no. 1–2, 243–255

work page 2002
[13]

Lagarias, A.M

J.C. Lagarias, A.M. Odlyzko, J.B. Shearer, On the density of sequences of integers the sum of no two of which is a square. II. General sequences. J. Combin. Theory Ser. A 34 (1983), no. 2, 123–139

work page 1983
[14]

Sali´ e,¨Uber den kleinsten positiven quadratischen Nichtrest nach einer Primzahl

H. Sali´ e,¨Uber den kleinsten positiven quadratischen Nichtrest nach einer Primzahl. Math. Nachr. 3 (1949), 7–8

work page 1949
[15]

Schlage-Puchta, Sumsets avoiding squarefree integers

J.-C. Schlage-Puchta, Sumsets avoiding squarefree integers. Acta Arith. 143 (2010), no. 1, 51–53

work page 2010
[16]

Zaharescu, Small values ofn 2αmod 1

A. Zaharescu, Small values ofn 2αmod 1. Invent. Math. 121 (1995), no. 2, 379–388. Department of Mathematics, Royal Holloway, University of London, Egham, Surrey, TW20 0EX, United Kingdom Email address:rainer.dietmann@rhul.ac.uk Institute of Analysis and Number Theory, Graz University of Technology, Kopernikus- gasse 24/II, Graz, A-8010 Graz, Austria Email...

work page 1995