Searcharxiv⌕ Search

arXiv · 2609.29878

Disproof of a Conjectured Upper Bound for the Davenport Constant

Abstract

Let $G= C_{n_1}\oplus\cdots\oplus C_{n_r}$ be a finite abelian group with $1<n_1\mid\cdots\mid n_r$, and let $\rr(G)=r$ denote its rank. The Davenport constant $\DD(G)$ is the least integer $\ell$ such that every sequence of $\ell$ elements of $G$ contains a nonempty zero-sum subsequence, and $\DD^*(G)=1+\sum_{i=1}^r(n_i-1)$ is its classical lower bound. A long-standing conjecture \cite[Conjecture~3.7]{GG06} asserts that $\DD(G)\le\DD^*(G)+\rr(G)-1$. In this paper, we disprove this conjecture. More strongly, we prove that $\sup_{\rr(G)=r}\bigl(\DD(G)-\DD^*(G)\bigr)=\infty$ 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. Our result also disproves the Narkiewicz--Śliwa conjecture of 1982 \cite{NS82} on the Narkiewicz constant, arising in algebraic number theory from the quantitative study of algebraic integers with unique factorization. The same amplification of the Davenport excess yields counterexamples to Girard's conjecture \cite[Conjecture~1.2]{Girard08} on the cross numbers of long zero-sum-free sequences. We also prove the uniform upper bound $\DD(G)\le\frac{16}{5}\rr(G)\exp(G)$ for every nontrivial finite abelian group $G$. Together with examples whose Davenport excess is at least $\rr(G)\exp(G)/48$, this shows that the product of rank and exponent gives the correct general scale for the excess, up to absolute constants.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guoqing Wang. 2026-09-29. Disproof of a Conjectured Upper Bound for the Davenport Constant. https://arxiv.org/abs/2609.29878

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A power series expansion of the Wilf function

In this work, the author employs the Faà di Bruno formula, identities for the partial Bell polynomials, two combinatorial identities, and the (logarithmically) complete monotonicity of generating functions for several integer sequences, together with the Wronski theorem, to investigate a collection of analytic and combinatorial structures. The study establishes Taylor series expansions for various functions involving the inverse (hyperbolic) tangent function and derives the Maclaurin expansion of the Wilf function, a composite of the inverse tangent, square root, and exponential functions. The coefficients in this expansion are expressed in terms of Stirling numbers of the second kind, and their generating functions, limits, positivity, monotonicity, and logarithmic convexity are analyzed. The paper further presents closed-form formulas for special values of the Gauss hypergeometric function and for certain partial Bell polynomials, along with several infinite series representations of the circular constant and related sequences. An asymptotic rational approximation to the circular constant is recovered, and connections among several integer sequences are established via determinants.

math.CO↗

Schreier Sets of Intervals, Super-Schreier Sets, and Catalan Numbers

A finite nonempty set $F\subset\mathbb{N}$ is Schreier if $\min F\ge |F|$. First, we prove a linear recurrence relation and compute initial counts for Schreier sets consisting of intervals. Two intervals of integers are separated if their union is not an interval. If $\mathcal J_{k,n}$ is the collection of Schreier sets that are the union of exactly $k$ separated intervals, then the sequence $(|\mathcal{J}_{k,n}|)_{n=1}^\infty$ satisfies the characteristic polynomial $p_k(x) = (x-1)^{2k+1}(x+1)^k$. Furthermore, we introduce the new concept of $k$-super-Schreier sets and let $\mathcal{S}_{k,n}$ denote the collection of $k$-super-Schreier sets whose maximum is $n$. We show that the sequence $(|\mathcal{S}_{k,n}|)_{n=1}^\infty$ satisfies a Fibonacci-type recurrence with a remainder term expressible as a polynomial of $n$.

math.CO↗