Disproof of a Conjectured Upper Bound for the Davenport Constant
Guoqing Wang
Source abstract
Let be a finite abelian group with , 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.
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.