Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 1723, 1739). A subset of a finite abelian group is foncièrement générateur when for some integer . For integers and , is the largest integer for which there are an integer and a foncièrement générateur subset of with elements such that
(i) , and
(ii) ;
such a satisfies . Then .
Théorème 20 (p. 1739). For every positive integer , .
Lemme 26 (p. 1756). For every positive integer , , with as defined on the Théorème 1 page.
The construction (p. 1756): for a foncièrement générateur meeting (i) with , the set , the residues of lifted to integers, is a basis of order at most , and is a basis of order exactly . The example (1.5) on p. 1719, , which gives , has this shape.
Théorème 20 is proved (pp. 1739--1741) by exhibiting, for , an integer with prime to such that meets (i). Conjecture 21 (p. 1741) states for every positive ; Table 1 (p. 1742) lists exhaustively computed values of for small and , none exceeding .
Read depth
Claims checked: the definitions, Théorème 20 and Lemme 26 were read clause by clause on the page images of pp. 1739 and 1756, and the proof of Lemme 26 was followed. The case computations in the proof of Théorème 20 were not checked. Nothing here is independently reviewed.
Dependencies
None in the corpus. Together they give the lower bound of Théorème 1 (p. 1756).
Source. Alain Plagne, À propos de la fonction X d'Erdős et Graham, Annales de l'Institut Fourier 54 (2004), no. 6, 1717--1767; the edition read is named on the source card.
Bears on
- Problem 336: the construction produces bases of exact order such that has exact order at most ; the paper states these as lower bounds for and states no relation to the problem's .