Wiki
Wiki

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

Updated


Claim. The answer to Problem 476 is yes: for a prime pp and A⊆FpA\subseteq\mathbb F_p, the restricted sumset A+^A={a+b:a≠b∈A}A\hat{+}A=\{a+b:a\ne b\in A\} has at least min⁡(2∣A∣−3,p)\min(2|A|-3,p) elements. The claimed result is Theorem 4.1 of J. A. Dias da Silva and Y. O. Hamidoune, Cyclic spaces for Grassmann derivatives and additive theory: for a finite subset AA of a field of characteristic pp (with p=∞p=\infty in characteristic zero) and a positive integer mm, the set ∧mA\wedge^mA of sums of mm distinct elements of AA satisfies

∣∧mA∣≥min⁡{p, m∣A∣−m2+1};|\wedge^mA|\ge\min\{p,\,m|A|-m^2+1\};

the remark after the proof states the case m=2m=2 for A⊆ZpA\subseteq Z_p as the conjecture of Erdős and Heilbronn, and Example 4.1, the image of {1,…,a}\{1,\ldots,a\} in ZpZ_p, shows the bound sharp. The theorem, read for sums of exactly mm distinct elements, implies conjecture (73) of Erdős's 1965 lectures, which asks for min⁡(p,rk−r2+1)\min(p,rk-r^2+1) distinct sums of at most rr distinct residues out of kk; the paper does not state that conjecture. The proof is by linear algebra and the representation theory of the symmetric group: the diagonal operator with spectrum AA has a derivative on the mmth Grassmann space whose spectrum is ∧mA\wedge^mA, and the degree of that derivative's minimal polynomial is bounded below through a cyclic-subspace bound (Theorem 3.2) and a hook-length identity drawn from the characters of the symmetric group (Corollary 2.3). Read depth: claims checked for the statement, the remark and the example on the result page of the source card; the proof read for structure, and nothing in its chain checked. For ∣A∣≤1|A|\le1 the restricted sumset is empty and the bound is at most 00, so the content of the statement is the case ∣A∣≥2|A|\ge2.

Depends on. Nothing in this wiki.

Acceptance. Refereed publication: Bulletin of the London Mathematical Society 26 (1994), no. 2, 140--146, issued March 1994 (Crossref record; the date of this page). Reviewed: the site's curator (T. F. Bloom) labels the problem proved and credits Dias da Silva and Hamidoune with the affirmative answer, citing [dSHa94] (page last edited 30 September 2025); the theorem is standard in the literature on restricted sumsets, restated with credit by Alon, Nathanson and Ruzsa in 1995 and 1996 (their page) and reported by Guy in section C15 of his 2004 collection. The paper's printed Corollary 3.3 omits a min⁡\min with pp that Theorem 3.2 carries and the proof of Theorem 4.1 uses, a filing observation recorded on the source card. The site's Lean mark refers to an external Lean proof that follows the polynomial method and is recorded as a formalization link on the Alon--Nathanson--Ruzsa page; it does not formalize this paper's argument and is third-party Lean, so no formalized evidence is listed.