Wiki
Wiki

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

Updated


Source. Theorem 2.1 and Corollaries 2.2 and 2.3, p. 5, of Javier Cilleruelo, Imre Z. Ruzsa and Carlos Vinuesa, Generalized Sidon sets, Advances in Mathematics 225 (2010), 2786--2807, arXiv:0909.5024. Labels and pages are those of arXiv:0909.5024v1 (28 Sep 2009), the edition named on the source card.

Read depth. Claims checked: the statements were read clause by clause on the page images; the proof (p. 6) was read but not checked step by step. Nothing here is independently reviewed.

Statement

Setting (pp. 1--2, 5). For AA in a commutative group, r(x)r(x) is the number of ordered pairs (a1,a2)∈A2(a_1,a_2)\in A^2 with a1+a2=xa_1+a_2=x, r′(x)r'(x) counts those with a1≠a2a_1\ne a_2 (Definition 1.1, p. 1), and 2⋅A={2a:a∈A}2\cdot A=\{2a:a\in A\} (p. 5). A gg-Sidon set has r(x)≤gr(x)\le g for all xx, a weak gg-Sidon set r′(x)≤gr'(x)\le g for all xx (Definition 1.2, p. 2).

Theorem 2.1 (p. 5). Let GG be a finite commutative group with ∣G∣=q\lvert G\rvert=q, let k≥2k\ge2 and l≥0l\ge0 be integers, and let A⊂GA\subset G satisfy r(x)≤kr(x)\le k for x∉2⋅Ax\notin2\cdot A and r(x)≤k+lr(x)\le k+l for x∈2⋅Ax\in2\cdot A. Then

∣A∣<(k−1)q+1+l2+l(l+1)2(k−1).(2.1)\lvert A\rvert<\sqrt{(k-1)q}+1+\frac l2+\frac{l(l+1)}{2(k-1)}. \tag{2.1}

Corollary 2.2 (p. 5). If A⊂GA\subset G is a gg-Sidon set in a finite commutative group of order qq, then ∣A∣≤(g−1)q+1\lvert A\rvert\le\sqrt{(g-1)q}+1 when gg is even and ∣A∣≤(g−2)q+32+1g−2\lvert A\rvert\le\sqrt{(g-2)q}+\frac32+\frac1{g-2} when gg is odd (the cases k=gk=g, l=0l=0 and k=g−1k=g-1, l=1l=1).

Corollary 2.3 (p. 5). If A⊂ZqA\subset\mathbb Z_q is a weak gg-Sidon set, then ∣A∣≤(g−1)q+2+3g−1\lvert A\rvert\le\sqrt{(g-1)q}+2+\frac3{g-1} when qq is even and ∣A∣≤(g−1)q+32+1g−1\lvert A\rvert\le\sqrt{(g-1)q}+\frac32+\frac1{g-1} when qq is odd (the cases k=gk=g with l=2l=2, respectively l=1l=1).

The paper presents the theorem as a slight improvement of the obvious bound αg(q)≤gq\alpha_g(q)\le\sqrt{gq} (pp. 4--5).

Proof pointer

Page 6. The sum R=∑xr(x)2R=\sum_x r(x)^2 is bounded above by k∣A∣2+l(k+l)∣A∣k\lvert A\rvert^2+l(k+l)\lvert A\rvert from the hypothesis, and below by ∣A∣2+∣A∣2(∣A∣−1)2/q\lvert A\rvert^2+\lvert A\rvert^2(\lvert A\rvert-1)^2/q through the difference function, whose square sum is also RR, and the inequality between the arithmetic and quadratic means; comparing the two gives (2.1).

Dependencies

None.

Bears on

The theorem concerns finite groups and bears on no Erdős problem directly.