Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Notation (printed p. 45): "Let a1,…,asa_1,\ldots,a_s be distinct non-zero residue classes modulo the prime pp and let rr be the number of residue classes xx of the form

x=ϵ1a1+⋯+ϵsas,(1)x=\epsilon_1a_1+\cdots+\epsilon_sa_s, \tag{1}

where the ϵi\epsilon_i are restricted to the values 0 and 1 and are not all 0."

Theorem 1 (printed p. 45). "If s>(4p−3)1/2s>(4p-3)^{1/2}, then r=pr=p."

The introduction places it (p. 45): "P. Erdös and H. Heilbronn [1] showed that r=pr=p if s>3(6p)1/2s>3(6p)^{1/2} and conjectured that r=pr=p if s>2p1/2s>2p^{1/2}." Since (4p−3)1/2<2p1/2(4p-3)^{1/2}<2p^{1/2}, the theorem contains the conjecture, as the abstract says: "we verify a conjecture of P. Erdös and H. Heilbronn: every residue class is represented if s>2p1/2s>2p^{1/2}." The paper adds (p. 45): "As shown in [1], this is nearly best possible: If a1=1a_1=1, a2=−1,…,as=(−1)s−1[12(s+1)]a_2=-1,\ldots,a_s=(-1)^{s-1}[\tfrac12(s+1)] and s<(4p+5)1/2−2s<(4p+5)^{1/2}-2, then (for p>3p>3) the residue 12(p+1)\tfrac12(p+1) cannot be expressed in the form (1)."

In the problem's notation. The class x=0x=0 is among the rr classes exactly when some nonempty subfamily of a1,…,asa_1,\ldots,a_s sums to 00. So Theorem 1 says: every set AA of distinct nonzero residues modulo a prime pp with ∣A∣>(4p−3)1/2|A|>(4p-3)^{1/2} has a nonempty S⊆AS\subseteq A with ∑n∈Sn≡0(modp)\sum_{n\in S}n\equiv0\pmod p; a set containing the residue 00 has the subset {0}\{0\}. This is the site's question for N=pN=p prime with any constant c≥2c\ge2, since cp≥2p>(4p−3)1/2c\sqrt p\ge2\sqrt p>(4p-3)^{1/2}. The near-sharpness example concerns the full representation property r=pr=p, not the zero-sum question alone, whose prime threshold is 2p+O(1)\sqrt{2p}+O(1) by Balandraud's Theorem 9.

Source. J. E. Olson, An Addition Theorem Modulo p, J. Combinatorial Theory 5 (1968), no. 1, 45--52, DOI 10.1016/S0021-9800(68)80027-4; Theorem 1 and the surrounding introduction on printed p. 45 (PDF p. 1 of the publisher's open-archive scan), its proof on printed pp. 46--47 (PDF pp. 2--3), read on the page images (the OCR text layer garbles the displays). The edition is identified in the source digest.

Read depth. Claims checked: the statement, the definition of rr and display (1), the recalled theorem and conjecture of Erdős and Heilbronn, the near-best-possible example and the statement of Theorem 2 with its displays (2)--(4) were read clause by clause on the page images of PDF pp. 1--2 on 2026-09-22. The proof of Theorem 1 (pp. 46--47) was read in full on the page images and its reduction to Theorem 2 was followed; the proof of Theorem 2 (pp. 47--52) was read in the text layer for structure only and not checked. Nothing here is independently reviewed.

Proof pointer

Pages 46--47, from Theorem 2 (pp. 45--46): for nonzero classes a1,…,asa_1,\ldots,a_s with ai≠±aja_i\ne\pm a_j for i≠ji\ne j, the number ρ\rho of classes of the form ϵ1a1+⋯+ϵsas\epsilon_1a_1+\cdots+\epsilon_sa_s, ϵi∈{0,1}\epsilon_i\in\{0,1\}, including 00, satisfies ρ≥min⁡{(p+3)/2, 1+s(s+1)/2}\rho\ge\min\{(p+3)/2,\,1+s(s+1)/2\} for ss even and ρ≥min⁡{(p+3)/2, s(s+1)/2}\rho\ge\min\{(p+3)/2,\,s(s+1)/2\} for ss odd (display (4)). The paper writes out the case s≡3(mod4)s\equiv3\pmod4 ("the proofs for the other three cases, where we obtain slightly smaller lower estimates for ss, are similar"). Put u=(s−1)/2u=(s-1)/2 and v=(s+1)/2v=(s+1)/2, and order the aia_i so that no two of a1,…,aua_1,\ldots,a_u and no two of au+1,…,asa_{u+1},\ldots,a_s are negatives of each other. With S={0,a1}+⋯+{0,au}S=\{0,a_1\}+\cdots+\{0,a_u\} and T={0,au+1}+⋯+{0,as}T=\{0,a_{u+1}\}+\cdots+\{0,a_s\}, Theorem 2 gives ∣S∣≥min⁡{(p+3)/2, u(u+1)/2}≥(p+1)/2|S|\ge\min\{(p+3)/2,\,u(u+1)/2\}\ge(p+1)/2 (uu is odd, and u(u+1)/2=(s2−1)/8>(p−1)/2u(u+1)/2=(s^2-1)/8>(p-1)/2 from s2>4p−3s^2>4p-3) and ∣T∣≥min⁡{(p+3)/2, 1+v(v+1)/2}=(p+3)/2|T|\ge\min\{(p+3)/2,\,1+v(v+1)/2\}=(p+3)/2 (vv is even). Let T′T' be TT with zero removed; then ∣S∣+∣T′∣≥p+1|S|+|T'|\ge p+1, so S+T′S+T' is the whole group (p. 47), and every element of S+T′S+T' is a sum of the form (1) with some ϵi=1\epsilon_i=1, so r=pr=p. The proof of Theorem 2 (pp. 47--52) is an elementary induction on ss through the difference-counting function λB(x)=∣(x+B)∩Bˉ∣\lambda_B(x)=|(x+B)\cap\bar B| (Lemma 2.1), a sumset lower bound for symmetric sets not in arithmetic progression derived from Vosper's theorem (Lemma 2.2), and a lower bound for max⁡a∈AλB(a)\max_{a\in A}\lambda_B(a) (Lemma 2.3). Not reconstructed here.

Dependencies

Within the paper: Theorem 2 (pp. 45--46), through Lemmas 2.1--2.3 (pp. 47--49). Outside it: Vosper's theorem on sumsets in Z/pZ\mathbb Z/p\mathbb Z, cited to Mann, Addition Theorems (Wiley, 1965), Theorem 1.3, p. 3, not held; and the ideas of Erdős and Heilbronn 1964 (erdos_1964_addition_residue_classes_mod), whose Theorem I is the 3(6p)1/23(6p)^{1/2} bound the paper improves.

Bears on

  • Problem 540: the prime case of the question, with the constant 22 of Erdős and Heilbronn's Conjecture 3 and the slightly better threshold (4p−3)1/2(4p-3)^{1/2}; the site's "proved for NN prime by Olson [Ol68]". Composite NN and general finite abelian groups are Szemerédi's Theorem; the constant 2\sqrt2 for primes is Balandraud's Theorem 9.