Indexed metadata

Disproof of a Conjectured Upper Bound for the Davenport Constant

Guoqing Wang

Source record

Source: arXiv

Published: Sep 24, 2026

arXiv: 2609.29878

Open original source ↗

Source abstract

Let G≅Cn1⊕⋯⊕CnrG\cong C_{n_1}\oplus\cdots\oplus C_{n_r} be a finite abelian group with 1<n1∣⋯∣nr1<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∗(G)=1+∑i=1r(ni−1)\mathsf D^*(G)=1+\sum_{i=1}^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∗(G)+r(G)−1\mathsf D(G)\le\mathsf D^*(G)+r(G)-1. In this paper, we disprove this conjecture. More strongly, we prove that sup⁡r(G)=r(D(G)−D∗(G))=∞for every fixed r≥8.\sup_{r(G)=r}\bigl(\mathsf D(G)-\mathsf D^*(G)\bigr)=\infty \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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.