Zero-sums of length kq in Zqd

From MaRDI portal
Publication:4677353





Let \(s_k(\mathbb{Z}_n^d)\) denote the smallest integer \(t\) such that any sequence of length \(t\) in \(\mathbb{Z}_n^d\) contains a subsequence of \(kn\) elements whose sum is \(0\) in \(\mathbb{Z}_n^d\). The case \(k=1\) was studied by many authors. For example \(s_1(\mathbb{Z}_n)=2n-1\) was proved by \textit{P. Erdős, A. Ginzburg} and \textit{A. Ziv} [``Theorem in the additive number theory, Bull. Research Council Israel 10F, 41--43 (1961; Zbl 0063.00009)], \(s_1(\mathbb{Z}_n^2)=4n-3\) by \textit{Reiher} [``On Kemnitz' conjecture concerning lattice point points in the plane, preprint], \(s_1(\mathbb{Z}_n^3)\geq 9n-8\) for odd \(n\) by \textit{C. Elsholtz} [``Lower bounds for multidimensional zero sums, Combinatorica 24, No. 3, 351--358 (2004; Zbl 1064.11018)] \(s_1(\mathbb{Z}_n^d)\leq c_d n\) by \textit{N. Alon} and \textit{M. Dubiner} [``A lattice point problem and additive number theory, Combinatorica 15, No. 3, 301--309 (1995; Zbl 0838.11020)]. Many other results are due to Harborth, Gao and Thangadurai, for example. The case \(k \geq 2\) was introduced by \textit{W. D. Gao} [``On zero-sum subsequences of restricted size. II, Discrete Math. 271, No. 1--3, 51--59 (2003; Zbl 1089.11012 )] and \textit{Gao} and \textit{R. Thangadurai} [``A lattice point problem and zero-sums, preprint]. They proved \(s_k(\mathbb{Z}_p^3)= (k+3)p-3\) for \(k\geq 4\), \(s_k(\mathbb{Z}_q^d)=(k+d)q-d\) for \(k \geq q^{d-1}\). Here \(p\) denotes a prime and \(q\) a power of a prime. In the paper under review the author conjectures: \(s_k(\mathbb{Z}_n^d)= (k+d)n-d\) for \(k\geq d\). This is verified for a large number of cases. In particular: for \(d \leq 4\), \(k \geq 4, p\geq 7\) (many more of the remaining cases are solved). Also, if \(q=p^a\) and \(k\) is a multiple of \(p\). Furthermore, if \(p>2d\) and \(\lfloor \frac{k-d}{p}\rfloor \geq \frac{3}{8}d^2+ \frac{d}{2} - \frac{3}{8}\) hold, then the conjecture holds for \(s_k(\mathbb{Z}_q^d)\). And also for a large number of cases with \(k\) smaller than in Gao's work. The method follows that of \textit{L. Rónyai} [``On a conjecture of Kemnitz, Combinatorica 20, No. 4, 569--573 (2000; Zbl 0963.11013)].




Cited in
(27)








This page was built for publication: Zero-sums of length kq in Zqd

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