pith. sign in

arxiv: 2606.07310 · v1 · pith:UK5Y63CFnew · submitted 2026-06-05 · 🧮 math.CO

On growth rates of infinite and finite sumsets

Felipe Hern\'andez , Luke Hetzel This is my paper

Pith reviewed 2026-06-27 21:45 UTC · model grok-4.3

classification 🧮 math.CO
keywords sumsetslower densitygrowth ratesadditive combinatoricsinfinite sumsetsfinite sumsetsdensity one sets
0
0 comments X

The pith

For any growth rate H tending to infinity there exists a set A of lower density 1 such that every infinite B + C inside A satisfies min(|B ∩ [N]|, |C ∩ [N]|) < H(N) for infinitely many N.

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

The paper establishes that infinite sumsets inside positive-density sets of the naturals cannot obey any prescribed growth rate that tends to infinity. For every function H from naturals to naturals that diverges, the authors produce a single set A whose lower density is 1 yet every pair of infinite sets B and C whose sum lies inside A must have at least one of them growing slower than H on an infinite sequence of initial segments. In the finite setting the same authors show that every subset of {1,…,N} whose relative size is bounded away from zero contains a sumset B + C in which both |B| and |C| are at least on the order of log N; the result extends to k-fold sums.

Core claim

For every function H:ℕ→ℕ tending to infinity there exists A⊆ℕ with lower density 1 such that if B,C⊆ℕ are infinite and B+C⊆A then min(|B∩[N]|,|C∩[N]|)<H(N) for infinitely many N. Moreover, for every δ∈(0,1) and all sufficiently large N, every A⊆{1,…,N} with |A|/N≥δ contains B,C with B+C⊆A and |B|,|C|≳log N; the same holds for k-fold sums.

What carries the argument

A lower-density-1 set A constructed so that it intersects every sufficiently large sumset B+C only when at least one of B or C remains smaller than the prescribed H(N) on infinitely many scales.

If this is right

  • No uniform growth rate exists that works for all infinite sumsets inside every positive-density set.
  • The finite result supplies summands of logarithmic size inside every dense subset of an interval.
  • The finite result extends directly to k-fold sumsets inside the same dense subsets.
  • The infinite result gives a negative answer to the question posed by Kra, Moreira, Richter and Robertson.

Where Pith is reading between the lines

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

  • The construction may adapt to other notions of largeness such as upper density or Banach density.
  • The finite logarithmic bound suggests that stronger quantitative versions of the infinite result might be possible if one replaces lower density by a weaker notion.
  • The same technique could be used to control growth rates of restricted sumsets or difference sets.

Load-bearing premise

Such a set A of lower density 1 can be built for every given growth function H that tends to infinity.

What would settle it

An explicit function H tending to infinity together with a proof that no lower-density-1 set A forces every infinite sumset inside it to violate H(N) infinitely often.

read the original abstract

We study growth rates of infinite and finite sumset patterns in sets of positive density. In the infinite setting, we show that no such rate exists, answering a question of Kra, Moreira, Ritcher, and Robertson. Namely, for any proposed growth rate $\mathcal{H}: \mathbb{N} \to \mathbb{N}$ tending to infinity, we construct a set $A$ of lower density $1$ such that whenever $B,C \subseteq \mathbb{N}$ are infinite and $B+C \subseteq A$ we have the minimum of $|B\cap [N]|$ and $|C \cap [N]|$ is less than $\mathcal{H}(N)$ for infinitely many $N$. In the finitary setting, we prove that for all $\delta \in (0,1)$, for all sufficiently large $N$, for all subsets $A$ of $\{1,\dots,N\}$ of proportion $\delta$, one can always find sumset patterns $B+C\subseteq A$ with $|B|$ and $|C|$ of order $\log N$, partially resolving a conjecture of Kra, Moreira, Richter, and Robertson. Moreover, we generalize our second result to the case of the $k$-fold sum $B_1 + B_2 + \ldots + B_k \subseteq A$.

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

0 major / 3 minor

Summary. The manuscript claims that for any H:ℕ→ℕ tending to infinity there exists A⊆ℕ with lower density 1 such that every pair of infinite B,C with B+C⊆A satisfies min(|B∩[N]|,|C∩[N]|)<H(N) for infinitely many N; this answers a question of Kra–Moreira–Richter–Robertson. In the finitary regime it asserts that for every δ∈(0,1) and all sufficiently large N, every A⊆[N] with |A|≥δN contains B,C with B+C⊆A and both |B|,|C|≫log N, partially resolving the same authors’ conjecture; the result is extended to k-fold sums B1+⋯+Bk⊆A.

Significance. The infinite result supplies an explicit density-1 construction that forces arbitrarily slow summand growth, furnishing a strong negative answer to the existence of uniform rates. The finitary logarithmic bound is a concrete quantitative statement, and the k-fold generalization broadens its scope. The explicit, inductive nature of the constructions is a clear strength of the work.

minor comments (3)
  1. [Theorem 1.3] The dependence of the implicit constants in the finitary theorem on δ is not made explicit; adding a sentence quantifying this dependence would improve precision.
  2. [Section 2] The inductive construction in the infinite case is described in prose; a short pseudocode block or numbered steps would aid readability without lengthening the argument.
  3. [Proof of Theorem 1.1] A few citations to standard density lemmas (e.g., the fact that the removed set has density zero) are missing; inserting them would make the density calculation fully self-contained.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, significance assessment, and recommendation of minor revision. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper's central results are existence theorems proved via explicit constructions (inductive or diagonal removal of a density-zero set to enforce the slow-growth condition on all potential fast-growing pairs B, C) and separate finitary counting arguments. No step reduces a claimed prediction or uniqueness result to a fitted parameter, self-citation chain, or definitional renaming; the argument is self-contained against external benchmarks and does not invoke load-bearing prior results by the same authors.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides no information on free parameters, axioms, or invented entities; full text unavailable for audit.

pith-pipeline@v0.9.1-grok · 5758 in / 1091 out tokens · 29804 ms · 2026-06-27T21:45:33.795482+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

17 extracted references

  1. [1]

    Bergelson

    V. Bergelson. Sets of recurrence of Zm-actions and properties of sets of differences in Zm. J. Lond. Math. Soc. (2) , 31(2):295–304, 1985

    1985

  2. [2]

    Charamaras and A

    D. Charamaras and A. Mountakis. Finding product sets in some classes of amenable groups. Forum Math. Sigma , 13, 2025

    2025

  3. [3]

    Di Nasso, I

    M. Di Nasso, I. Goldbring, R. Jin, S. Leth, M. Lupini, and K. Mahlburg. On a sumset conjecture of Erd˝ os.Can. J. Math. , 67(4):795–809, 2015

    2015

  4. [4]

    Erd˝ os and P

    P. Erd˝ os and P. Tur´ an. On some sequences of integers.J. London Math. Soc. , 11:261–264, 1936

    1936

  5. [5]

    Hern´ andez

    F. Hern´ andez. Infinite linear patterns in sets of positive density, 2025

    2025

  6. [6]

    Hern´ andez, I

    F. Hern´ andez, I. Kousek, and T. Radi´ c. On density analogs of Hindman’s finite sums theorem, 2025

    2025

  7. [7]

    B. Host. A short proof of a conjecture of Erd˝ os proved by Moreira, Richter and Robertson. Discrete Anal., page 19, 2019

    2019

  8. [8]

    Konyagin and I

    S. Konyagin and I. Shkredov. On subgraphs of random cayley sum graphs. Eur. J. Comb. , 70:61–74, 2018

    2018

  9. [9]

    I. Kousek. Asymmetric infinite sumsets in large sets of integers. Forum Math. Sigma , 14:e7, 2026

    2026

  10. [10]

    B. Kra, J. Moreira, F. K. Richter, and D. Robertson. Infinite sumsets in sets with positive density. J. Am. Math. Soc. , 36(4), 2023

    2023

  11. [11]

    B. Kra, J. Moreira, F. K. Richter, and D. Robertson. A proof of Erd˝ os’s B + B + t conjecture. Comm. Am. Math. Soc. , 4:480–494, 2024. 17

    2024

  12. [12]

    B. Kra, J. Moreira, F. K. Richter, and D. Robertson. The density finite sums theorem. Invent. Math., pages 1–31, 2025

    2025

  13. [13]

    B. Kra, J. Moreira, F. K. Richter, and D. Robertson. Problems on infinite sumset configurations in the integers and beyond. Bull. Am. Math. Soc. , 62(4):537–574, 2025

    2025

  14. [14]

    Moreira, F

    J. Moreira, F. K. Richter, and D. Robertson. A proof of a sumset conjecture of Erd˝ os. Ann. of Math. (2) , 189(2):605–652, 2019

    2019

  15. [15]

    K. F. Roth. On certain sets of integers. J. Lond. Math. Soc. , 28:245–252, 1953

    1953

  16. [16]

    Szemer´ edi

    E. Szemer´ edi. On the sets of integers containing no k elements in arithmetic progressions. Acta Arith., 27:299–345, 1975

    1975

  17. [17]

    B. L. van der Waerden. Beweis einer baudetschen vermutung. Nieuw. Arch. Wisk. , 15:212–216, 1927. Felipe Hern´ andez ´Ecole Polytechnique F´ed´erale de Lausanne (EPFL) felipe.hernandezcastro@epfl.ch Luke Hetzel University of Denver luke.hetzel@du.edu 18

    1927