Abstract
In 1961, Erdős, Ginzburg and Ziv proved a remarkable theorem stating that each set of 2n−1 integers contains a subset of size n, the sum of whose elements is divisible by n. We will prove a similar result for pairs of integers, i.e. planar lattice-points, usually referred to as Kemnitz’ conjecture.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alon, N., Dubiner, D.: A lattice point problem and additive number theory. Combinatorica 15, 301–309 (1995)
Erdős, P., Ginzburg, A., Ziv, A.: Theorem in the additive number theory. Bull Research Council Israel 10F, 41–43 (1961)
Gao, W.: Note on a zero-sum problem. J. Combin. Theory, Series A 95, 387–389 (2001)
Kemnitz, A.: On a lattice point problem. Ars Combin. 16b, 151–160 (1983)
Rónyai, L.: On a conjecture of Kemnitz. Combinatorica 20, 569–573 (2000)
Schmidt, W.M.: Equations Over Finite Fields, An Elementary Approach. Springer Verlag, Lecture Notes in Math (1976)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Richard Askey on the occasion of his 70th birthday.
2000 Mathematics Subject Classification Primary—11B50.
Rights and permissions
About this article
Cite this article
Reiher, C. On Kemnitz’ conjecture concerning lattice-points in the plane. Ramanujan J 13, 333–337 (2007). https://doi.org/10.1007/s11139-006-0256-y
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11139-006-0256-y