2000 character limit reached
Improved lower bound on generalized Erdos-Ginzburg-Ziv constants (1712.02069v1)
Published 6 Dec 2017 in math.CO
Abstract: If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then $s_{2n}(C_{n}{r}) > \frac{n}{2}[\frac{5}{4}-O(n{-\frac{3}{2}})]{r}$ and $s_{k n}(C_{n}{r}) > \frac{k n}{4} [1+\frac{1}{e k}-O(\frac{1}{n})]{r}$ for $k > 2$. In this note, we sharpen their general bound by showing that $s_{k n}(C_{n}{r}) > \frac{k n}{4} [1+\frac{(k-1){(k-1)}}{kk}-O(\frac{1}{n})]{r}$ for $k > 2$.