Integral zero-sum incidence identities and Davenport constants in rank three
Claudiu G. Pop, George C. Rad, George C. Ţurcaş
math.CO
Nov 15, 2026 · v1
TL;DR
All definitions, lemmas, and main theorems, including the computer-assisted enumerations and certificate soundness, are formalized in Lean 4 with Mathlib.
Abstract
We study the Davenport constant of finite abelian groups through signed identities among zero-sum subsequences. An integral incidence identity of degree $t$ for a sequence assigns integer weights to its nonempty zero-sum subsequences so that the weights add up to one, while those of the subsequences containing any given nonempty set of at most $t$ terms add up to zero. Over a finite abelian $p$-group $H$, the zero-sum subsequences of a sequence of any length have an indicator polynomial of degree at most $D(H)-1$, and this gives a transfer principle: if, for each $t\ge0$, every sequence of $L(t)$ terms over $Q$ admits such an identity of degree $t$, then $D(Q\oplus H)\le L(D(H)-1)$ for every finite abelian $p$-group $H$. For $m\in\{2,3,4\}$ we construct integral identities at length $L(t)=m(t+3)-2$ over $C_m^3$, and prove that these thresholds are sharp over fields of characteristic zero or characteristic not dividing $m$. For a prime $p\nmid m$ and $0\le a\le b\le c$, we prove that \[ D(C_{mp^a}\oplus C_{mp^b}\oplus C_{mp^c}) =m(p^a+p^b+p^c)-2. \] In particular $D(C_{15}^3)=43$ and $D(C_{20}^3)=58$, which are the two smallest cases of the conjecture $D(C_n^3)=3n-2$ left open in the literature. The proofs of the base cases for $m \in \{3,4\}$ are computer-assisted. All of the results in this paper have been formalised in Lean 4.
Problem
The Davenport constant D(G) of a finite abelian group is conjectured to equal n1+n2+n3-2 in rank three. Cases such as D(C_15^3) and D(C_20^3) were the smallest open instances for C_n^3.
Approach
The authors define integral incidence identities: integer weightings of zero-sum subsequences that cancel on all small term sets. They prove a transfer principle that bounds D(Q⊕H) for p-group kernels H, using a low-degree indicator polynomial built from nilpotence of the augmentation ideal. For quotients C_m^3 with m in {2,3,4}, they build identities from computer-found base certificates and three constructions, and prove sharpness via a binomial determinant. Everything, including the enumerations and the soundness of certificate checks, is formalized in Lean 4 with Mathlib, with LLM assistance.
Results
For a prime p not dividing m, with m in {2,3,4}, D(C_{mp^a}⊕C_{mp^b}⊕C_{mp^c}) = m(p^a+p^b+p^c)-2. This gives D(C_15^3)=43 and D(C_20^3)=58, and the identity-length thresholds are shown to be sharp.