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 in a commutative group, is the number of ordered pairs with , counts those with (Definition 1.1, p. 1), and (p. 5). A -Sidon set has for all , a weak -Sidon set for all (Definition 1.2, p. 2).
Theorem 2.1 (p. 5). Let be a finite commutative group with , let and be integers, and let satisfy for and for . Then
Corollary 2.2 (p. 5). If is a -Sidon set in a finite commutative group of order , then when is even and when is odd (the cases , and , ).
Corollary 2.3 (p. 5). If is a weak -Sidon set, then when is even and when is odd (the cases with , respectively ).
The paper presents the theorem as a slight improvement of the obvious bound (pp. 4--5).
Proof pointer
Page 6. The sum is bounded above by from the hypothesis, and below by through the difference function, whose square sum is also , 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.