English

Zero-sum Subsequences of Length kq over Finite Abelian p-Groups

Combinatorics 2017-07-19 v1 Number Theory

Abstract

For a finite abelian group GG and a positive integer kk, let sk(G)s_{k}(G) denote the smallest integer N\ell\in\mathbb{N} such that any sequence SS of elements of GG of length S|S|\geq\ell has a zero-sum subsequence with length kk. The celebrated Erd\H{o}s-Ginzburg-Ziv theorem determines sn(Cn)=2n1s_{n}(C_{n})=2n-1 for cyclic groups CnC_{n}, while Reiher showed in 2007 that sn(Cn2)=4n3s_{n}(C_{n}^{2})=4n-3. In this paper we prove for a pp-group GG with exponent exp(G)=q\exp(G)=q the upper bound skq(G)(k+2d2)q+3D(G)3s_{kq}(G)\le(k+2d-2)q+3D(G)-3 whenever kdk\geq d, where d=D(G)qd=\Big\lceil\frac{D(G)}{q}\Big\rceil and pp is a prime satisfying p2d+3D(G)2q3p\ge2d+3\Big\lceil\frac{D(G)}{2q}\Big\rceil-3, where D(G)D(G) is the Davenport constant of the finite abelian group GG. This is the correct order of growth in both kk and dd. As a corollary, we show skq(Cqd)=(k+d)qds_{kq}(C_{q}^{d})=(k+d)q-d whenever kp+dk\geq p+d and 2p7d32p\geq7d-3, resolving a case of the conjecture of Gao, Han, Peng, and Sun that skexp(G)(G)=kexp(G)+D(G)1s_{k\exp(G)}(G)=k\exp(G)+D(G)-1 whenever kexp(G)D(G)k\exp(G)\geq D(G). We also obtain a general bound skn(Cnd)9kns_{kn}(C_{n}^{d})\leq9kn for nn with large prime factors and kk sufficiently large. Our methods are inspired by the algebraic method of Kubertin, who proved that skq(Cqd)(k+Cd2)qds_{kq}(C_{q}^{d})\leq(k+Cd^{2})q-d whenever kdk\geq d and qq is a prime power.

Keywords

Cite

@article{arxiv.1503.06905,
  title  = {Zero-sum Subsequences of Length kq over Finite Abelian p-Groups},
  author = {Xiaoyu He},
  journal= {arXiv preprint arXiv:1503.06905},
  year   = {2017}
}