2000 character limit reached
Disproof of a Conjectured Upper Bound for the Davenport Constant
Published 24 Sep 2026 in math.CO and math.NT | (2609.29878v1)
Abstract: Let be a finite abelian group with $1<n_1\mid\cdots\mid n_r$, and let denote its rank. The Davenport constant is the least integer such that every sequence of elements of contains a nonempty zero-sum subsequence, and is its classical lower bound. A long-standing conjecture (\cite[Conjecture 3.7]{GG06}) on the general upper bound of asserts that . In this paper, we disprove this conjecture. More strongly, we prove that Thus the classical lower bound does not approximate the Davenport constant within an additive error depending only on the rank, contrary to what has long been believed in the past some decades.
Paper Prompts
Sign up for free to create and run prompts on this paper.