Pith.

Combinatorics · arXiv:2611.17205 v1 · submitted 12 Nov 2026 · 26 references

Forbidden subset sums in a linear range: an inverse theorem and the Erdős-Graham irregularity problem

Mateo Matijasevick

The paper says

“For c > 0 let fc(n) be the largest size of a set $A\subseteq\{1,\dots,\lfloor cn\rfloor\}$ such that n is not a sum of distinct elements of A.”

more of the abstract

Erdős and Graham asked whether fc(n) depends on n in an irregular way (Erdős Problem #361). We prove that $f_c(n)=\lfloor cn\rfloor-\lceil n/2\rceil$ for c ≥ 1, while for 0 < c < 1 the ratio fc(n)/n has $\limsup$ equal to c/2, attained along odd n, and, along the integers n whose least non-divisor equals a prime power q, tends to \[ \max\Bigl\{\frac cq,\; c-\frac12+\frac1-cq\Bigr\} \qquad\textwhenever 2^q-2\min\{c,1-c\}\le 1 . \] Consequently fc(n)/n converges if and only if c ≥ 1; for 0 < c < 1 it has at least two limit points, and arbitrarily many as c → 0+ or c → 1−. For c = 1/2 the set of limit points is exactly {1/6,1/4}. The upper bounds follow from an inverse theorem of independent interest: if s ≥ 1, q is the least positive integer not dividing s, and ε > 0, then every A ⊆ {1,…,E} with |A| ≥ E/q + εT has a subset summing to sT, uniformly for all sufficiently large T and all E ≤ sT/2q−2. For s = 2, this extends Alon's theorem on subsets of {1,…,N} with no subset sum equal to 2N. The results for c ≥ 1 and the $\limsup$, as well as the limits and the inverse theorem for q ∈ {2,3}, have been formalized and machine-checked in the Lean 4 proof assistant.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up. This paper actually settles Erdős–Graham #361 in the linear range, and the main irregularity claim already rests on the machine-checked q=2,3 cases. This line is wrong

3 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 26 references say.

3 minor objections

The paper says, at Sections 1.2 and 5.4

Pith says: minor objection 1 of 3

Cross-references to 'Theorem 5.5' and 'Theorem 5.1' do not match the numbering in the text, where the statements appear as Remark 5.5 and Lemma 5.1; these labels should be made uniform.

The paper says, at Section 7, Table 2 and Figure 1

Pith says: minor objection 2 of 3

For c≤1/2 the table caption correctly notes that n≤127 is below the asymptotic regime, but Figure 1 shows only c=2/3 and c=3/4; adding an explicit sentence to the figure caption that small-c numerical values are not asymptotic evidence would prevent overreading of Table 2.

show 1 more

The paper says, at Section 8

Pith says: minor objection 3 of 3

The sentence that the Comparator configurations were not run is a useful limitation and should remain in the verification record; I suggest moving it into the main verification paragraph so that the kernel-checked status of the eleven statements is not confused with the weaker comparator check.

What would settle it

Re-run the formal verification for the q=2,3 cases (already done) and confirm that the statement erdos361_irregular (non-convergence for 0<c<1) is indeed proved. This is already recorded in the paper. No further test is needed to settle the central claim.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up confidence high
  2. Skeptic partly agrees 27 s · 25,577 tokens read, 536 written
  3. Editor wrote the verdict above 20 s · 24,609 tokens read, 1,844 written
  4. Referee accept: 3 minor 2 min 27 s · 24,045 tokens read, 25,962 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

Bottom line: this is the real thing. The paper gives the first inverse theorem for forbidden subset sums in the linear range and uses it to answer Erdős–Graham #361. The c≥1 formula is elementary and was already floating around the problem discussion; the actual content is the 0<c<1 regime, where the paper proves non-convergence and identifies limit points along the snd(n)=q classes. The small-c and c-near-1 consequences are a nice bonus, and the c=1/2 exact limit set is a clean corollary.

The proof chain holds together. The distinctification lemma, the central interval lemma, and the dyadic Freiman iteration line up, and the inverse theorem is genuinely independent of the lower constructions. There is no fitted constant anywhere, and the forum values reproduced in Section 7 are treated as a sanity check, not as a source of parameters. The Lean formalization is also real evidence, not decoration. It covers c≥1, the limsup, non-convergence, and the inverse theorem for q=2,3; the statement/Challenge.lean separation and the axiom reports are clean. Since the main non-convergence claim needs only q=2 and q=3, the machine-checked part is load-bearing for the central answer.

Soft spots are real but mostly acknowledged. The full inverse theorem for q≥4 depends on the range constant θq, which is only known between max{2,q−2+1/q} and 2q−2. That makes the q≥4 limit results conditional, and the authors say so. It does not undermine the main irregularity theorem, but anyone citing the inverse theorem in full generality needs to know the q≥4 part is not yet unconditional. The exact set of limit points for c≠1/2 is also left open. On the formalization side, the short deduction from the formalized inverse form to the full Theorem 1.2 for q=2,3 is not machine-checked, and the Comparator configurations were not run; both are minor. The C program from Section 7 is not in the repository, which is a small reproducibility annoyance but not a correctness issue.

Who should read this? Anyone working in additive combinatorics, subset sums, or inverse problems in the linear regime. It deserves a serious referee and will likely survive contact with one. I would send it out without hesitation, with the q≥4 and repository points as minor revision requests.

The strongest objection

The paper's main conclusion—that fc(n)/n does not converge for any 0<c<1—is already established by Theorem 1.5 using only the q=2 and q=3 cases of Theorem 1.4(ii). Those cases are covered by the formal verification in Lean (Section 8, Table 3). The additional results for q≥4 (more limit points, exact limits along specific subsequences) depend on the condition 2^{q-2} min{c,1-c} ≤ 1, which the authors explicitly note is not known to be optimal (Problem 9.2, Remark 3.2). The formal verification does not cover q≥4, and the optimal range constant θ_q is open. However, the central claim of the paper—the irregularity answer to the Erdős–Graham problem—does not require those q≥4 results; it is already fully supported by the q=2,3 cases. Therefore, no load-bearing concern about the central claim remains unresolved. The paper's own limitations are clearly stated, and the core argument is machine-checked.

The reader's weakest_assumption identified Lemma 2.5 (bounded additive basis) as the most fragile premise, and noted that the formal verification covers only q=2,3. That is accurate. However, the reader's verdict of ACCEPT with high confidence is appropriate because the central irregularity claim does not depend on q≥4. The stress-test confirms that the core result is securely established. The partial agreement reflects that while the reader correctly identified a fragile point, that point is not load-bearing for the main conclusion; the main conclusion is already supported by the verified q=2,3 cases. The paper's own limitations are transparent, and the formal verification provides strong evidence for the essential part of the claim.

The referee's report

If accepted, this resolves the irregularity question of Erdős and Graham (Problem #361) in a strong form: for linear ranges, the ratio fc(n)/n is regular exactly for c≥1 and irregular for every 0<c<1. The inverse theorem is of independent interest and extends Alon's theorem on subsets of [1,N] with no subset sum equal to 2N. The paper's main claims rest on a carefully structured proof: elementary lower constructions, a distinctification lemma, a central interval lemma, and a dyadic iteration of Freiman's 3k−4 theorem. The formal verification covers precisely the decisive cases q=2 and q=3, so the central convergence/non-convergence dichotomy is machine-checked. The q≥4 results inherit the possibly non-optimal range constant 2^{q−2}; this is explicitly acknowledged in Remark 3.2 and Problem 9.2, and it does not affect the main irregularity theorem, which only needs q=2 and q=3. I found no fitted parameters, no post-hoc selection of constants, and no circularity in the derivations.

Pith's reading of the paper (a machine's summary, not the authors')

The paper answers Erdős–Graham Problem #361 in the linear range: for $c>0$, how large can a set $A\subseteq\{1,\ldots,\lfloor cn\rfloor\}$ be while no subset of $A$ sums to $n$? For $c\ge 1$ the answer is exact and regular: $f_c(n)=\lfloor cn\rfloor-\lceil n/2\rceil$ for every $n$, so $f_c(n)/n\to c-1/2$. For $0<c<1$ the answer is genuinely irregular: the ratio has $\limsup$ equal to $c/2$, attained along the odd integers, and along the classes of $n$ with the same least non-divisor $q$ it tends to $\varphi_q(c)=\max\{c/q,\;c-\tfrac12+\tfrac{1-c}{q}\}$ for every prime power $q$ with $2^{q-2}\min\{c,1-c\}\le 1$. Consequently $f_c(n)/n$ converges if and only if $c\ge 1$, it has at least two limit points for every $0<c<1$, and at $c=1/2$ the limit set is exactly $\{1/6,1/4\}$. The upper bounds rest on a new inverse theorem — dense sets in a short interval must already represent the target as a subset sum — proved by iterating Freiman's $3k-4$ theorem along dyadic sumsets; the author also shows the hypothesis $q\in Q(c)$ cannot simply be dropped.

What carries the argument. The object that carries the argument is the inverse theorem (Theorem 1.2): if $q=\operatorname{snd}(s)$ is the least positive integer not dividing $s$ (always a prime power, with $\operatorname{lcm}(1,\ldots,q-1)\mid s$), then for every $\varepsilon>0$ and all sufficiently large $T$, every $A\subseteq[1,E]$ with $|A|\ge E/q+\varepsilon T$ and $E\le sT/2^{q-2}$ has a subset summing to $sT$, using at most $2^{q-2}(\lceil 2s/\varepsilon\rceil+1)$ distinct elements. Setting $s=2$ and $E=T$ recovers the upper bound in Alon's theorem that a subset of $[1,N]$ with no subset sum $2N$ has at most $(1/3+o(1))N$ elements. The proof passes through three devices: a 'distinctification' lemma that converts sums with repetitions into subset sums using Roth's theorem; a normalization to a set $B\subseteq[0,L]$ of density at least $1/q+\eta$ with $\gcd(B)=1$; and the bounded additive basis lemma (Lemma 2.5), which iterates Freiman's $3k-4$ theorem on the dyadic sumsets $2^jB$ to show that every $y\in[2^{q-2}L,KL]$ is a sum of at most $2^{q-2}(\lceil K\rceil+1)$ elements of $B$. The multiples of $q$ supply the matching lower bound of density $1/q$ whenever $q\nmid sT$, while the exponential range constant $2^{q-2}$ is proved sharp only for $q\in\{2,3\}$.

Core claim. The central claim is a dichotomy between regular and irregular behaviour of the extremal size $f_c(n)$. For $c\ge 1$, an injection argument gives the exact value $f_c(n)=\lfloor cn\rfloor-\lceil n/2\rceil$: a set avoiding $n$ holds at most one element from each pair $\{x,n-x\}$, and the interval $[\lceil n/2\rceil,n-1]\cup[n+1,\lfloor cn\rfloor]$ achieves the bound. For $0<c<1$ the paper proves that $f_c(n)/n$ has $\limsup\, c/2$, achieved along odd $n$ by the multiples of $2$, and that along every class $\{n:\operatorname{snd}(n)=q\}$ with $q$ a prime power and $2^{q-2}\min\{c,1-c\}\le 1$, the ratio tends to $\varphi_q(c)=\max\{c/q,\;c-\tfrac12+\tfrac{1-c}{q}\}$, the larger of two competing behaviours: the multiples of $q$ (density $c/q$) versus a mixed set of multiples of $q$ together with one residue class above $n/2$ (density $c-\tfrac12+\tfrac{1-c}{q}$). Since the values $\varphi_q(c)$ are pairwise distinct and $\{2,3\}\subseteq Q(c)$, the sequence has at least two limit points always, and arbitrarily many as $c\to 0^+$ or $c\to 1^-$, so $f_c(n)/n$ converges exactly when $c\ge 1$. At $c=1/2$ the description is complete: odd $n$ give $1/4$ and even $n$ give $1/6$, so the limit set is exactly $\{1/6,1/4\}$; the even case reproduces Alon's $f(N,2N)=(1/3+o(1))N$. The paper frames its contribution as the matching upper bounds: the lower-bound constructions were largely known from the problem's discussion, while the arithmetic-sensitive upper bounds are new (Theorem 1.2 and its consequences).

The premise it rests on. Every upper bound for $0<c<1$ passes through the bounded additive basis lemma, which asserts that a set of density at least $1/q+\eta$ in $[0,L]$ represents every integer in the dyadic window $[2^{q-2}L,KL]$ with $2^{q-2}(\lceil K\rceil+1)$ summands; the exponential window comes from iterating Freiman's $3k-4$ theorem and is proved optimal only for $q=2,3$, so if the true window for $q\ge4$ were smaller the theorem's scope would only widen, whereas if this growth estimate failed the $c<1$ upper bounds would collapse.

If the paper is right (Pith's inferences, not the authors')

At $c=1/2$ the irregularity is completely described: the set of limit points of $f_{1/2}(n)/n$ is exactly $\{1/6,1/4\}$, with $1/4$ along odd $n$ and $1/6$ along even $n$ (Corollary 1.6).

For every $0<c<1$, $f_c(n)/n$ has at least as many limit points as there are prime powers $q\le 2+\log_2(1/\min\{c,1-c\})$, and this number grows without bound as $c\to 0^+$ or $c\to 1^-$; the ratio never converges unless $c\ge 1$ (Corollary 1.5).

Outside the regular range the extremal sets change shape: for $c>1/2$ and $q\ge 3$ the maximizing sets are mixed — multiples of $q$ together with one residue class above $n/2$ — rather than the plain multiples of the least non-divisor (Theorem 5.3(b)).

The inverse theorem converts density into representation uniformly: every $A\subseteq[1,\lfloor xT\rfloor]$ with $|A|>(x/q+\varepsilon)T$ contains a subset summing to $sT$ whenever $x\le s/2^{q-2}$, and then $F(\lfloor xT\rfloor,sT)=(x/q+o(1))T$ along $T$ with $p\nmid T$ (Corollary 1.3).

The hypothesis $q\in Q(c)$ is necessary, not cosmetic: for $2/3\le c<3/4$ an interval construction gives $f_c(n)\ge n/4-1$ for every $n$, which beats every $\varphi_q(c)$ for all large $q$ (Remark 5.5).

If the true range constant $\theta_q$ in Theorem 1.2 were linear in $q$ — a route the author explicitly leaves open via structure theorems for $h$-fold sumsets — then Theorem 1.4(ii) would extend to far more classes $\mathrm{snd}(n)=q$ for each fixed $c$, the number of limit points would grow like $1/\min\{c,1-c\}$ instead of logarithmically, and the open case $q=4$ with $1/4<c<3/4$ would likely f

The complete picture at $c=1/2$ suggests a general conjecture the paper does not state: that for every $0<c<1$ the full set of limit points of $f_c(n)/n$ is $\{\varphi_q(c):q\in Q(c)\}$ together with the values forced by interval constructions where those exceed $\varphi_q(c)$ (such as $1/4$ for $2/3\le c<3/4$); the author's Conjecture 9.4, asserting $f_c(n)=\lfloor\lfloor cn\rfloor/2\rfloor$ for

Because the Section 6 zero-sum proof derives non-convergence from bounded zero-sum estimates alone, the qualitative irregularity does not depend on the sharp inverse theorem, and this is the route the Lean formalization takes; the author notes that the short deduction of Theorem 1.2's final form and the bound on the number of summands are not part of that formalization, so the machine-checked stat

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

For c > 0 let fc(n) be the largest size of a set $A\subseteq\{1,\dots,\lfloor cn\rfloor\}$ such that n is not a sum of distinct elements of A. Erdős and Graham asked whether fc(n) depends on n in an irregular way (Erdős Problem #361). We prove that $f_c(n)=\lfloor cn\rfloor-\lceil n/2\rceil$ for c ≥ 1, while for 0 < c < 1 the ratio fc(n)/n has $\limsup$ equal to c/2, attained along odd n, and, along the integers n whose least non-divisor equals a prime power q, tends to \[ \max\Bigl\{\frac cq,\; c-\frac12+\frac1-cq\Bigr\} \qquad\textwhenever 2^q-2\min\{c,1-c\}\le 1 . \] Consequently fc(n)/n converges if and only if c ≥ 1; for 0 < c < 1 it has at least two limit points, and arbitrarily many as c → 0+ or c → 1−. For c = 1/2 the set of limit points is exactly {1/6,1/4}. The upper bounds follow from an inverse theorem of independent interest: if s ≥ 1, q is the least positive integer not dividing s, and ε > 0, then every A ⊆ {1,…,E} with |A| ≥ E/q + εT has a subset summing to sT, uniformly for all sufficiently large T and all E ≤ sT/2q−2. For s = 2, this extends Alon's theorem on subsets of {1,…,N} with no subset sum equal to 2N. The results for c ≥ 1 and the $\limsup$, as well as the limits and the inverse theorem for q ∈ {2,3}, have been formalized and machine-checked in the Lean 4 proof assistant.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-14

The authors' main claim, as the classifier picked it out 0.80

“We prove that $f_c(n)=\lfloor cn\rfloor-\lceil n/2\rceil$ for $c\ge 1$, while for $0<c<1$ the ratio $f_c(n)/n$ has $\limsup$ equal to $c/2$, attained along odd $n$, and, along the integers $n$ whose least non-divisor equals a prime power $q$, tends to \[ \max\Bigl\{\frac cq,\; c-\frac12+\frac{1-c}{q}\Bigr\} \qquad\text{whenever } 2^{q-2}\min\{c,1-c\}\le 1 .”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.32 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.98 · compares with prior results 0.89 · mentions code or data availability 0.24

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
For $c>0$ let $f_c(n)$ be the largest size of a set $A\subseteq\{1,\dots,\lfloor cn\rfloor\}$ such that $n$ is not a sum of distinct elements of $A$. background 0.95 0.18 0.03 asserted 0.77
Erd\H{o}s and Graham asked whether $f_c(n)$ depends on $n$ in an irregular way (Erd\H{o}s Problem \#361). background 0.93 0.03 0.02 asserted 0.46
We prove that $f_c(n)=\lfloor cn\rfloor-\lceil n/2\rceil$ for $c\ge 1$, while for $0<c<1$ the ratio $f_c(n)/n$ has $\limsup$ equal to $c/2$, attained along odd $n$, and, along the integers $n$ whose least non-divisor equals a prime power $q$, tends to \[ \max\Bigl\{\frac cq,\; c-\frac12+\frac{1-c}{q}\Bigr\} \qquad\text{whenever } 2^{q-2}\min\{c,1-c\}\le 1 . result 0.98 0.95 0.88 asserted 1.00
\] Consequently $f_c(n)/n$ converges if and only if $c\ge1$; for $0<c<1$ it has at least two limit points, and arbitrarily many as $c\to0^+$ or $c\to1^-$. interpretation 0.67 0.91 0.27 asserted 1.00
For $c=1/2$ the set of limit points is exactly $\{1/6,1/4\}$. result 1.00 0.89 0.07 asserted 1.00
The upper bounds follow from an inverse theorem of independent interest: if $s\ge1$, $q$ is the least positive integer not dividing $s$, and $\varepsilon>0$, then every $A\subseteq\{1,\dots,E\}$ with $|A|\ge E/q+\varepsilon T$ has a subset summing to $sT$, uniformly for all sufficiently large $T$ and all $E\le sT/2^{q-2}$. contribution 0.42 0.84 0.12 asserted 1.00
For $s=2$, this extends Alon's theorem on subsets of $\{1,\dots,N\}$ with no subset sum equal to $2N$. interpretation 0.56 0.41 0.03 asserted 1.00
The results for $c\ge1$ and the $\limsup$, as well as the limits and the inverse theorem for $q\in\{2,3\}$, have been formalized and machine-checked in the Lean~4 proof assistant. contribution 0.52 0.84 0.03 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-14: 1 request, 7,006 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (1)
Figure 1 of the paper
Figure 1. Exact values of fc(n)/n for 40 ≤ n ≤ 127, for c = 2/3 (left) and c = 3/4 (right), by class of n. Dashed lines: the limits c/2 (odd n) and 2c/3−1/6 (n ≡ 2, 4 mod 6) of Theorem 1.4; for c = 3/4 also φ4(3/4) = 5/16, the limit along n ≡ 6 (mod 12); for c = 2/3 the lower bound 1/4 of Theorem 5.5, valid for all n. 8. Formal verification The formalization, available at https://github.com/matejasevick/erdos361, uses Lean 4 (toolchain v4.31.0) and Mathlib (revision fabf563a). The trusted statement layer is a file that

Figures are the authors', reproduced from the paper.

References (26)
  1. [1] N. Alon,Subset sums, J. Number Theory27(1987), no. 2, 196–205 on Pith
  2. [2] N. Alon,Combinatorial Nullstellensatz, Combin. Probab. Comput.8(1999), no. 1–2, 7–29 on Pith
  3. [3] N. Alon and G. Freiman,On sums of subsets of a set of integers, Combinatorica8(1988), no. 4, 297–306 on Pith
  4. [4] N. Alon, M. B. Nathanson and I. Z. Ruzsa,The polynomial method and restricted sums of congruence classes, J. Number Theory56(1996), no. 2, 404–417. 16 MATEO MATIJASEVICK on Pith
  5. [5] T. F. Bloom,Erdős Problem #361,https://www.erdosproblems.com/361, with discussion athttps://www. erdosproblems.com/forum/thread/361(accessed November 2026) on Pith
  6. [6] Comparator,https://github.com/leanprover/comparator on Pith
  7. [7] D. Conlon, J. Fox and H. T. Pham,Subset sums, completeness and colorings, J. Eur. Math. Soc. (JEMS), to appear; arXiv:2104.14766 on PithPith's reviewarXiv
  8. [8] J. A. Dias da Silva and Y. O. Hamidoune,Cyclic spaces for Grassmann derivatives and additive theory, Bull. London Math. Soc.26(1994), no. 2, 140–146 on Pith
  9. [9] P. Erdős and G. Freiman,On two additive problems, J. Number Theory34(1990), no. 1, 1–12 on Pith
  10. [10] P. Erdős and R. L. Graham,Old and New Problems and Results in Combinatorial Number Theory, Monogra- phies de L’Enseignement Mathématique 28, Université de Genève, Geneva, 1980 on Pith
  11. [11] P. Erdős, M. B. Nathanson and A. Sárközy,Sumsets containing infinite arithmetic progressions, J. Number Theory28(1988), no. 2, 159–166 on Pith
  12. [12] G. A. Freiman,Foundations of a Structural Theory of Set Addition, Translations of Mathematical Mono- graphs 37, American Mathematical Society, Providence, RI, 1973 on Pith
  13. [13] Y. O. Hamidoune and A. Plagne,A generalization of Freiman’s3k− 3theorem, Acta Arith.103(2002), no. 2, 147–156 on Pith
  14. [14] Z. Kelley and R. Meka,Strong bounds for 3-progressions, in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2023, 933–973 on Pith
  15. [15] V. F. Lev,Optimal representations by sumsets and subset sums, J. Number Theory62(1997), no. 1, 127–143 on Pith
  16. [16] V. F. Lev,Blocks and progressions in subset sum sets, Acta Arith.106(2003), no. 2, 123–142 on Pith
  17. [17] V. F. Lev and P. Y. Smeliansky,On addition of two distinct sets of integers, Acta Arith.70(1995), no. 1, 85–91 on Pith
  18. [18] E. Lipkin,On representation ofr-th powers by subset sums, Acta Arith.52(1989), no. 4, 353–365 on Pith
  19. [19] L. de Moura and S. Ullrich,The Lean 4 theorem prover and programming language, in: Automated Deduction – CADE 28, Lecture Notes in Comput. Sci. 12699, Springer, 2021, 625–635 on Pith
  20. [20] The mathlib Community,The Lean mathematical library, in: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2020), ACM, 2020, 367–381 on Pith
show 6 more
  1. [21] M. Nair,On Chebyshev-type inequalities for primes, Amer. Math. Monthly89(1982), no. 2, 126–129 on Pith
  2. [22] M. B. Nathanson,Additive Number Theory: Inverse Problems and the Geometry of Sumsets, Graduate Texts in Mathematics 165, Springer, New York, 1996 on Pith
  3. [23] M. B. Nathanson and A. Sárközy,Sumsets containing long arithmetic progressions and powers of2, Acta Arith.54(1989), no. 2, 147–154 on Pith
  4. [24] K. F. Roth,On certain sets of integers, J. London Math. Soc.28(1953), 104–109 on Pith
  5. [25] E. Szemerédi and V. Vu,Long arithmetic progressions in sumsets: thresholds and bounds, J. Amer. Math. Soc.19(2006), no. 1, 119–169 on Pith
  6. [26] L. Tran, V. Vu and P. M. Wood,On a conjecture of Alon, J. Number Theory129(2009), no. 11, 2801–2807. Purdue University, West Lafayette, Indiana, USA Email address:mmatijas@purdue.edu on Pith

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment