English

On the lower bounds of Davenport constant

Combinatorics 2021-09-24 v2 Number Theory

Abstract

Let G=Cn1CnrG = C_{n_1} \oplus \cdots \oplus C_{n_r} with 1<n1nr1 < n_1 | \cdots | n_r be a finite abelian group. The Davenport constant D(G)\mathsf D(G) is the smallest integer tt such that every sequence SS over GG of length St|S|\ge t has a non-empty zero-sum subsequence. It is a starting point of zero-sum theory but only has a trivial lower bound D(G)=n1++nrr+1\mathsf D^*(G) = n_1 + \cdots + n_r - r + 1, which equals D(G)\mathsf D(G) over pp-groups. We investigate the non-dispersive sequences over group CnrC_n^r, thereby revealing the growth of D(G)D(G)\mathsf D(G)-\mathsf D^*(G) over non-pp-groups G=CnrCknG = C_n^r \oplus C_{kn} with n,k1n,k \ne 1. We give a general lower bound of D(G)\mathsf D(G) over non-pp-groups and show that, let GG be abelian groups with exp(G)=m\exp(G)=m and rank rr, fix m>0m>0 a non-prime-power, then for each N>0N>0 there exists an ε>0\varepsilon>0 such that if G/mr<ε|G|/m^r<\varepsilon , then D(G)D(G)>N\mathsf D(G)-\mathsf D^*(G)>N.

Keywords

Cite

@article{arxiv.1810.08346,
  title  = {On the lower bounds of Davenport constant},
  author = {Chao Liu},
  journal= {arXiv preprint arXiv:1810.08346},
  year   = {2021}
}