Davenport Constants of Finite Abelian Groups
Dongchun Han, Hanbin Zhang
Abstract
A central problem in zero-sum theory is to determine the Davenport constant of a finite abelian group. For a finite abelian group G Cn1·s Cnr, with 1<n1·s nr, let D(G) be the least integer t such that every sequence of t elements of G contains a nonempty zero-sum subsequence, and denote D*(G):= 1+Σi=1r(ni-1). The standard construction shows that D(G) D*(G). Equality holds for several important classes of groups but fails in general, and even the question whether D(G)/ D*(G) is bounded by an absolute constant remains open. In this paper, we prove the upper bound \[ D(G)<4.86\,(G)|G|(G) \] for every finite abelian group. When |G| is large compared with (G), it improves the previous classical upper bound by a factor of order (G). We also prove that, for almost all finite abelian groups (counting isomorphism classes by order), \[ D(G)(G)|G|(G) D*(G). \] We also study the difference D(G)- D*(G): for every function L with L(x)∞, almost all groups satisfy D(G)- D*(G) L( D*(G)). However, for every fixed C0, the groups with D(G)- D*(G)>C have positive lower density.
Create a lesson
Related papers
Cones of Theta Graphs are Enumeratively Chromatic-Choosable
Kingston Barnes, Vincent Fesenmeier, Braxton Gaither et al.
Polynomial Identities for Generalized Fibonacci Sequences
Joey Glampe, Aryaman Joshi, Swagat Malla et al.
How iterated sumsets grow under the assumption of small doubling
Dongchun Han, Qinghai Zhong
Sharp lower bounds for bisections of graphs with bounded maximum degree
Qiwen Guo, Gregory Gutin
Hilbert functions over the exterior algebra and f-vectors in higher rank II: Generalizing Linusson's count to sumsets of f-vectors
Jan Snellman
Sharp bounds and extremal structure of minimally strongly k-connected digraphs
Junran Yu, Gregory Gutin, Hong-Jian Lai et al.