Papers
Topics
Authors
Recent
Search
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 G≅Cn1⊕⋯⊕CnrG\cong C_{n_1}\oplus\cdots\oplus C_{n_r} be a finite abelian group with $1&lt;n_1\mid\cdots\mid n_r$, and let r(G)=rr(G)=r denote its rank. The Davenport constant D(G)\mathsf D(G) is the least integer ℓ\ell such that every sequence of ℓ\ell elements of GG contains a nonempty zero-sum subsequence, and D<sup>∗(G)=1+∑i=1<sup>r(ni−1)\mathsf D<sup>*(G)=1+\sum_{i=1}<sup>r(n_i-1) is its classical lower bound. A long-standing conjecture (\cite[Conjecture 3.7]{GG06}) on the general upper bound of D(G)\mathsf D(G) asserts that D(G)≤D<sup>∗(G)+r(G)−1\mathsf D(G)\le\mathsf D<sup>*(G)+r(G)-1. In this paper, we disprove this conjecture. More strongly, we prove that sup⁡r(G)=r(D(G)−D<sup>∗(G))=∞</sup>for every fixed r≥8.\sup_{r(G)=r}\bigl(\mathsf D(G)-\mathsf D<sup>*(G)\bigr)=\infty</sup> \qquad\text{for every fixed }r\ge8. 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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.