Wiki
Wiki

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 A\mathcal A of a finite abelian group GG is foncièrement générateur when iA=Gi\mathcal A=G for some integer ii. For integers h≥1h\ge1 and c≥2c\ge2, K2(h,c)K_2(h,c) is the largest integer kk for which there are an integer gg and a foncièrement générateur subset A\mathcal A of Z/gZ\mathbb Z/g\mathbb Z with cc elements such that

(i) A∪2A∪⋯∪hA=Z/gZ\mathcal A\cup2\mathcal A\cup\cdots\cup h\mathcal A=\mathbb Z/g\mathbb Z, and

(ii) (k−1)A≠Z/gZ(k-1)\mathcal A\ne\mathbb Z/g\mathbb Z;

such a kk satisfies kA=Z/gZk\mathcal A=\mathbb Z/g\mathbb Z. Then K(h)=max⁡c≥2K2(h,c)K(h)=\max_{c\ge2}K_2(h,c).

Théorème 20 (p. 1739). For every positive integer hh, K2(h,2)≥[h(h+4)3]K_2(h,2)\ge\left[\frac{h(h+4)}{3}\right].

Lemme 26 (p. 1756). For every positive integer hh, X(h)≥K(h)X(h)\ge K(h), with XX as defined on the Théorème 1 page.

The construction (p. 1756): for a foncièrement générateur A⊂Z/gZ\mathcal A\subset\mathbb Z/g\mathbb Z meeting (i) with (K(h)−1)A≠Z/gZ(K(h)-1)\mathcal A\ne\mathbb Z/g\mathbb Z, the set B={0}∪(A+gN)\mathcal B=\{0\}\cup(\mathcal A+g\mathbb N), the residues of A\mathcal A lifted to integers, is a basis of order at most hh, and B∖{0}\mathcal B\setminus\{0\} is a basis of order exactly K(h)K(h). The example (1.5) on p. 1719, {0}∪({2,5}+11N)\{0\}\cup(\{2,5\}+11\mathbb N), which gives X(4)≥10X(4)\ge10, has this shape.

Théorème 20 is proved (pp. 1739--1741) by exhibiting, for g=[h(h+4)/3]+1g=[h(h+4)/3]+1, an integer x0x_0 with x0−1x_0-1 prime to gg such that {1,x0}\{1,x_0\} meets (i). Conjecture 21 (p. 1741) states K2(h,2)=[h(h+4)/3]K_2(h,2)=[h(h+4)/3] for every positive hh; Table 1 (p. 1742) lists exhaustively computed values of K2(h,c)K_2(h,c) for small hh and cc, none exceeding K2(h,2)K_2(h,2).

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 B∖{0}\mathcal B\setminus\{0\} of exact order K(h)≥[h(h+4)/3]K(h)\ge[h(h+4)/3] such that B\mathcal B has exact order at most hh; the paper states these as lower bounds for X(h)X(h) and states no relation to the problem's h(r)h(r).