A simple proof of a theorem of Bollobás and Leader

Yu, Hong

doi:10.1090/S0002-9939-03-07091-6

A simple proof of a theorem of Bollobás and Leader
HTML articles powered by AMS MathViewer

by Hong Bing Yu PDF

Proc. Amer. Math. Soc. 131 (2003), 2639-2640 Request permission

Abstract:

By using Scherk’s lemma we give a simple combinatorial proof of a theorem due to Bollobás and Leader. For any sequence of elements of an abelian group of order $k$, calling the sum of $k$ terms of the sequence a $k$-sum, if 0 is not a $k$-sum, then there are at least $r-k+1$ $k$-sums.

References

N. Alon and M. Dubiner, Zero-sum sets of prescribed size, Combinatorics, Paul Erdős is eighty, Vol. 1, Bolyai Soc. Math. Stud., János Bolyai Math. Soc., Budapest, 1993, pp. 33–50. MR 1249703
Béla Bollobás and Imre Leader, The number of $k$-sums modulo $k$, J. Number Theory 78 (1999), no. 1, 27–35. MR 1706937, DOI 10.1006/jnth.1999.2405
P. Erdös, A. Ginzburg, and A. Ziv, Theorem in the additive number theory, Bull. Res. Council Israel(F) 10 (1961), 41–43.
H. Halberstam and K. F. Roth, Sequences. Vol. I, Clarendon Press, Oxford, 1966. MR 0210679
Melvyn B. Nathanson, Additive number theory, Graduate Texts in Mathematics, vol. 165, Springer-Verlag, New York, 1996. Inverse problems and the geometry of sumsets. MR 1477155, DOI 10.1007/978-1-4757-3845-2
P. Scherk, Solution to Problem 4466, Amer. Math. Monthly 62 (1955), 46–47.