Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation (p. 4). For a finite subset of an abelian group , is the largest size of an independent subset of (independence as defined on the page of Theorem 2). For , , and for real the set of -popular differences is .
Theorem 4 (p. 4). Let be the smallest order of a non-zero element of an abelian group . For every finite, non-empty and every real ,
If moreover , then
The range is as printed in the theorem, while was defined just above it for ; at the right-hand sides are not finite numbers. Read literally, the definition of independence on p. 3 also admits sets containing (for instance , so that while the right-hand sides vanish at ); the proof on p. 10 applies Theorem 2 with every element of of order at least , which holds for independent sets not containing .
Sharpness (p. 4). The paper says the estimate is sharp for homocyclic of exponent and reasonably close to sharp for . Example 4: for integers and with , write with each and put . Then , every non-zero has , and with
Dissociated sets (pp. 4-5, 10). A subset is dissociated if the sums , , are pairwise distinct, and the additive dimension is the size of its largest dissociated subset. The paper reads Shkredov and Yekhanin [SY11, Theorem 3.1] as saying essentially that for in a finite abelian group, with an absolute implicit constant, its (1). Every independent set is dissociated, and the two notions coincide in groups of exponent or , so for every subset , with equality in exponent or . The paper concludes that (1) is qualitatively stronger than Theorem 4 for groups of exponent larger than , while Theorem 4 is stronger than (1) in exponents and , where its coefficients are sharp.
A remark credited to Thomas Bloom (personal communication) at the start of Section 5 (p. 10) states that if is dissociated, then implies with an absolute constant . The paper indicates that it follows from Hölder's inequality and basic Fourier analysis, gives no proof, and states no further hypothesis on the group beyond the abelian group of its setting. The paper asks for the best possible coefficient in Theorem 4 for homocyclic groups of exponent larger than (p. 11).
Source. Vsevolod F. Lev, On Isoperimetric Stability, Discrete Analysis 2018:14, 11 pp., doi:10.19086/da.3699: the notation, Theorem 4, Example 4 and the comparison with [SY11] (I. Shkredov and S. Yekhanin, J. Combin. Theory Ser. A 118 (2011), 1086-1093) on pp. 4-5, the proof in Section 4 on p. 10, the remark and question in Section 5 on pp. 10-11. The edition read is identified on the source card.
Read depth. Claims checked: the notation, the statement, Example 4, the comparison with (1) and the Section 5 remark were read clause by clause on the printed pages. The proof (p. 10) was read but not checked step by step. The Section 5 remark has no proof in the paper and none was checked here.
Proof pointer
Page 10. If is independent with , each has at least representations , so at least pairs have and . Theorem 2 gives , and taking gives the first estimate. For , Corollary 1 in place of Theorem 2 gives .
Dependencies
Theorem 2 and Corollary 1 of the same paper.
Bears on
- Problem 963: the problem asks for a lower bound on the largest dissociated subset of every -element set of reals. Theorem 4 bounds independent subsets of a popular-difference set from above. In no non-zero element has finite order; the theorem does not say how is read there, and the argument of Section 4 with the infinite-order reading of Theorem 2 gives for every independent , with finite and non-empty and . Over independence (no non-trivial integer relation) is stronger than dissociativity, so this does not bound dissociated subsets. The Section 5 remark concerns dissociated sets but is stated without proof. Neither gives a bound on the problem's .