On Kemnitz' conjecture concerning lattice-points in the plane

From MaRDI portal
Publication:2369915



Abstract: In 1961, P. ErdH{o}s, A. Ginzburg, and A. 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.


Let \(f(n,k)\) be the minimal number \(f\) such that each set of \(f\) lattice-points in the \(k\)-dimensional Euclidean space contains a subset of cardinality \(n\) whose centroid is a lattice-point as well. It was proved by \textit{P. Erdős, A. Ginzburg} and \textit{A. Ziv} [Bull. Res. Council Israel 10F, 41--43 (1961; Zbl 0063.00009)] that \(f(n,1)=2n-1\) and conjectured by \textit{A. Kemnitz} [Ars Comb. 16-B, 151--160 (1983; Zbl 0539.05008)] that \(f(n,2)=4n-3\) who gave some partial results concerning this conjecture. In this note the author proves Kemnitz' conjecture in general.




Cited in
(51)








This page was built for publication: On Kemnitz' conjecture concerning lattice-points in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369915)