For a finite abelian group and a positive integer , the -th Davenport constant is the smallest length guaranteeing that every sequence over of at least that length contains disjoint nontrivial zero-sum subsequences. While is exactly known for all for cyclic groups, groups of rank at most (where with a single constant for every ), and elementary -groups of rank at most and the elementary -group of rank , and while the sequence is eventually an arithmetic progression with difference for every , the exact values and the extremal structure are open for essentially all groups of rank at least : the all- linear pattern already fails for elementary - and -groups of rank at least , and even bounding is considered substantially harder than for the classical Davenport constant. The problem, left open in Qinghai Zhong's 2025 resolution of the rank- inverse problem, is to determine exactly and to characterize the associated extremal class of maximal-length zero-sum sequences that cannot be partitioned into nontrivial zero-sum subsequences, for finite abelian groups of rank at least , beyond the settled special cases.
Background
By a sequence over a finite abelian group (written additively) we mean an unordered finite list of elements of with repetition allowed. A sequence is a zero-sum sequence if the sum of its terms is , and a zero-sum subsequence is a nonempty sub-multiset whose terms sum to . The Davenport constant is the smallest such that every sequence over of length at least has a nontrivial zero-sum subsequence; equivalently is the maximal length of a minimal zero-sum sequence, one that cannot be split into two nonempty zero-sum subsequences. Writing with the cyclic group of order and , the rank of is and the exponent is the maximal order of an element; is an elementary -group when . The lower bound always holds, with equality for -groups and rank at most , but equality in rank is a famous open problem in general.
The -th Davenport constant generalizes this: is the smallest such that every sequence over of length at least has disjoint nontrivial zero-sum subsequences, so . This invariant was introduced by Halter-Koch (1992) in the arithmetic of non-unique factorizations, and it coincides, for abelian , with the generalized Noether number from invariant theory studied by Cziszter and Domokos. Knowledge of is also the key input to the inductive method, the main general technique for computing of groups built from quotients and subgroups, as exploited by Delorme, Ordaz and Quiroz (2001) and Bhowmik and Schlage-Puchta (2007).
Three facts delineate what is known. First, for rank at most one has the exact formula (Geroldinger–Halter-Koch, Theorem 6.1.5), i.e. with the single constant for all . Second, Freeze and Schmid (2010) proved that for every finite abelian group the sequence is eventually an arithmetic progression with difference , so for all for suitable and threshold ; the proof is non-constructive and gives no effective general bound on . Third, the all- linear pattern fails in higher rank: elementary - and -groups of rank at least violate it (Delorme–Ordaz–Quiroz; Bhowmik–Schlage-Puchta). For elementary -groups the exact values are known for rank at most (Delorme–Ordaz–Quiroz) and rank and (Freeze–Schmid, e.g. , with , and all with , ), while for rank even is known only within bounds of order . Beyond the elementary -groups, the elementary -group of rank also has exact direct values, , , , (whence for ), recorded in Freeze–Schmid (Remark 5.3); its inverse classification is open.
Zero-sum theory also studies inverse problems: characterizing the structure of extremal sequences, here the class of zero-sum sequences of length exactly that cannot be partitioned into nontrivial zero-sum subsequences. The classical inverse problem for was settled for rank in a series of works, and Zhong (2025) settled the inverse problem for completely for rank , characterizing and by explicit basis normal forms. That paper, whose introduction states that computing or even sharply bounding outside rank is substantially more complicated, in particular for elementary -groups, leaves the higher-rank direct and inverse problems open.
Problem Statement
For finite abelian groups of rank at least , determine the exact values of the -th Davenport constants for all positive integers — equivalently, determine the eventual-linear data and threshold together with every pre-threshold value — and solve the associated inverse problem: characterize the extremal class of zero-sum sequences over of length exactly that cannot be partitioned into nontrivial zero-sum subsequences. The settled cases excluded from this question are: cyclic groups and groups of rank at most (where for all and is fully classified), the eventual-linearity theorem of Freeze–Schmid (which fixes only the asymptotic shape), and the exact direct values for elementary -groups of rank at most and for the elementary -group of rank (in these last cases is known exactly for every , but the corresponding inverse classification is not). The following sub-questions are each independently open: (i) The instance, which includes as a subcase the still-open rank- Davenport constant conjecture . (ii) The direct constants and the inverse classification for elementary -groups with . (iii) The inverse classification for the elementary -group of rank , whose direct values are already known.
References
- Qinghai Zhong, "On the inverse problem of the -th Davenport constants for groups of rank ", arXiv:2503.21231 (2025); journal version DOI 10.1007/s00493-025-00153-3. URL: https://arxiv.org/abs/2503.21231
- Michael Freeze and Wolfgang A. Schmid, "Remarks on a generalization of the Davenport constant", Discrete Mathematics 310 (2010), 3373–3389. DOI 10.1016/j.disc.2010.07.028; arXiv:0905.4248. URL: https://arxiv.org/abs/0905.4248
- Charles Delorme, Oscar Ordaz and Domingo Quiroz, "Some remarks on Davenport constant", Discrete Mathematics 237 (2001), 119–128. DOI 10.1016/S0012-365X(00)00365-4. URL: https://doi.org/10.1016/S0012-365X(00)00365-4
- Gautami Bhowmik and Jan-Christoph Schlage-Puchta, "Davenport's constant for groups of the form ", in Additive Combinatorics, CRM Proceedings and Lecture Notes vol. 43, American Mathematical Society, Providence, RI, 2007, pp. 307–326. DOI 10.1090/crmp/043/17. URL: https://doi.org/10.1090/crmp/043/17
- Franz Halter-Koch, "A generalization of Davenport's constant and its arithmetical applications", Colloquium Mathematicum 63 (1992), 203–210. DOI 10.4064/cm-63-2-203-210. URL: https://doi.org/10.4064/cm-63-2-203-210
- Alfred Geroldinger and Franz Halter-Koch, "Non-Unique Factorizations: Algebraic, Combinatorial and Analytic Theory", Pure and Applied Mathematics vol. 278, Chapman and Hall/CRC, 2006. DOI 10.1201/9781420003208. URL: https://doi.org/10.1201/9781420003208
- Kálmán Cziszter and Mátyás Domokos, "On the generalized Davenport constant and the Noether number", Central European Journal of Mathematics 11 (2013), 1605–1615. DOI 10.2478/s11533-013-0259-z. URL: https://doi.org/10.2478/s11533-013-0259-z
- Kálmán Cziszter, Mátyás Domokos and István Szöllősi, "The Noether numbers and the Davenport constants of the groups of order less than 32", Journal of Algebra 510 (2018), 513–541. DOI 10.1016/j.jalgebra.2018.02.040. URL: https://doi.org/10.1016/j.jalgebra.2018.02.040
- Benjamin Girard and Wolfgang A. Schmid, "Direct zero-sum problems for certain groups of rank three", Journal of Number Theory 197 (2019), 297–316. DOI 10.1016/j.jnt.2018.08.016. URL: https://doi.org/10.1016/j.jnt.2018.08.016