WorksMathematics
Extremal zero-sum sequences without elements of maximal order
Abstract
Let denote the Davenport constant of a finite abelian group , the maximal length of a minimal zero-sum sequence over . Gao and Geroldinger conjectured that every minimal zero-sum sequence of length ~\cite[Conjecture~6.1]{GG99} and every zero-sumfree sequence of length ~\cite[Conjecture~4.1]{GG06} contains an element of order . We disprove both conjectures by proving a density-one theorem: for every fixed finite abelian group of exponent , where , , and is an odd prime, the set of integers for which admits a minimal zero-sum sequence of length with no term of order has natural density one.
Introduction
Let be a finite abelian group, written additively. A sequence over a group is a finite collection of elements in which repetitions are allowed and order is disregarded. It is zero-sumfree if it has no nonempty zero-sum subsequence. The small Davenport constant is the maximal length of such a sequence. The Davenport constant is the least length forcing a nonempty zero-sum subsequence. Equivalently, it is the maximal length of a minimal zero-sum sequence, that is, a nonempty zero-sum sequence with no proper nonempty zero-sum subsequence.
The direct problem asks for the value of these constants; the inverse problem asks for the structure of the sequences attaining the extremal lengths. Inverse zero-sum problems are also closely connected with non-unique factorization theory, where zero-sum sequences over class groups provide a combinatorial framework for studying factorizations into irreducible elements; see [3, 4, 5]. Even when a complete description of the extremal sequences is unavailable, one can ask what their lengths force about the orders and multiplicities of their terms. The question whether an extremal sequence must contain an element of maximal order remains the basic one with the inverse problem of Davenport constant.
The standard construction gives a reason to expect such an element. Write
and choose a basis with . Then is zero-sumfree, and hence
Equality holds for -groups and for groups of rank at most two; see [8, 9] and [3 Section 3]. In these cases the construction is extremal and contains a term of order . The inverse question is whether every sequence of maximal length must share this property.
Gao and Geroldinger proposed the following conjectures.
Conjecture 1 (1999 [1 Conjecture 6.1]). Every minimal zero-sum sequence of length over a finite abelian group contains an element of order .
Conjecture 2 (2006 [3 Conjecture 4.1]). Every zero-sumfree sequence of length over a finite abelian group contains an element of order .
2020 Mathematics Subject Classification. Primary 11B30; Secondary 11B75, 20K01.
Key words and phrases. Davenport constant, minimal zero-sum sequences, zero-sumfree sequences, inverse zero-sum problem.
There is substantial evidence for the assertions in small rank and in groups of prime-power order. Both Conjectures 1 and 2 hold for -groups and groups of rank at most two [1, 2]. The zero-sumfree assertion is known for cyclic groups, -groups, and ; see [3 Section 4]. In fact, Girard proved that every zero-sumfree sequence of length over a finite abelian -group contains at least terms of maximal order [6]. For with , Schmid proved that every minimal zero-sum sequence of length has at least terms of order [10 Corollary 4.5]. This raises the question of whether even a single such term must remain when the elementary -component has increasing rank.
There is an additional difficulty in seeking counterexamples. Write . Minimal zero-sum sequences of length with no term of maximal order were already observed by Schmid; see [10 discussion following Corollary 4.6]. Such sequences do not settle the conjecture when . The essential issue is to obtain the required order restrictions at the actual extremal length, even when the Davenport constant is not known explicitly.
Our main result disproves Conjectures 1 and 2 by establishing a density-one theorem. For every fixed finite abelian group of exponent , where , , and is an odd prime, the group admits counterexamples to both conjectures for a set of integers of natural density one. Consequently, there are infinitely many pairwise nonisomorphic finite abelian groups of arbitrarily large rank for which both conjectures fail.
Theorem 1.1. Let be a finite abelian group of exponent , where , and is an odd prime, and set . The set of integers admitting a minimal zero-sum sequence over such that
has natural density one. More precisely, the number of integers for which no such sequence exists is as .
Since both and are proper divisors of , every sequence provided by Theorem 1.1 is a counterexample to Conjecture 1. Deleting any term from yields a zero-sumfree sequence of length satisfying the same order restrictions, and hence a counterexample to Conjecture 2. Thus both conjectures fail for the same density-one set of ranks.
Notation and binary relations
We follow the conventions of [3 Section 2]. Sequences are written multiplicatively:
Here is the length. We write when is a subsequence of . The set of minimal zero-sum sequences is denoted by . We use the standard identities and inequality
for ; see [3 Section 3].
We identify with the vector space . Consider a nonempty sequence over , where span . Let
A vector records precisely a subsequence whose first coordinate has sum zero. Write , and regard these values as integers or when defining
Then , and is zero-sum if and only if . In particular, is zero-sumfree if and only if . It belongs to if and only if and .
We shall also use this description in the opposite direction. Let be a binary vector space and let be such that the linear map is injective. For the quotient map , form the sequence
The incidence vector of a subsequence has first-coordinate sum zero exactly when it lies in . Hence the preceding criteria apply to . For minimality, the condition is for some satisfying for every . This construction is what allows us to change the coordinate functions without changing the zero-sum subsequences.
Proof of the main theorem
Fix as in Theorem 1.1, and put , , and
The sequence is nondecreasing: applying to gives . Also . Indeed, a binary basis together with copies of an element of order in gives a zero-sumfree sequence of length .
Our construction has two parts. First, we replace the -coordinates of a minimal zero-sum sequence and add a controlled number of terms. This preserves minimality but increases the binary rank. We then choose ranks where the Davenport constant increases by exactly that number, so the new sequence is still extremal.
A form will be called normalized at if . All coordinate forms of a minimal zero-sum sequence are normalized at its full-sequence vector . Coefficients in a weighted sum of such forms are allowed to be zero. Thus any representation may be padded to a prescribed larger number of terms without affecting its sum function.
Lemma 3.1. Let belong to a binary vector space of dimension . For every , any integer-weighted sum of forms normalized at can be represented modulo by at most normalized forms, where
Here a binomial coefficient is zero when its lower index exceeds its upper index. In particular, .
Proof. If , there is just one normalized form, so one term suffices. If , every weighted sum is a binary linear form . When , it is itself normalized. When , choose any normalized form and write ; both summands are normalized. This proves the required bound modulo two.
For and , we prove the recurrence
Choose a decomposition with , and let vanish on and satisfy . Extend each form on to vanish at . Every normalized form on is then uniquely or , where is normalized on . Grouping the terms of a weighted sum in this way gives
In this display the sum inside a binary form is taken in , whereas its value is interpreted as 0 or 1 in the weighted sum. The elementary identity therefore gives
By induction, represent modulo on the -dimensional space as , using at most normalized forms. Evaluation at gives . Adjusting one coefficient by the appropriate multiple of makes
exactly, without changing the represented function modulo . We may include a term with zero coefficient if the representation is empty.
Using (3.3) and the same binary identity,
The first summand is a weighted sum of normalized forms on , so it can be compressed modulo to terms. Each is normalized at , since . This proves the recurrence by induction on .
At , the recurrence gives . For , Pascal’s identity verifies the displayed formula:
The formula is a polynomial bound of degree at most in , which gives the final estimate. □
Proof of Theorem 1.1. Decompose , where and .
For an extremal minimal zero-sum sequence over , the binary projections span . Indeed, if their span had dimension , then would be a minimal zero-sum sequence over a subgroup isomorphic to , whereas the subgroup inequality gives , a contradiction. Thus its binary relation data satisfy , and . Apply Lemma 3.1 to the -coordinate functions of . Combining and padding the representations gives forms normalized at and weights reproducing that component. Replace each original -label by its -coordinate with zero -component, and append labels with corresponding forms . The extended coordinate map remains injective and its -valued sum function is . § 2 therefore gives a minimal zero-sum sequence over of length . Its first terms have orders dividing , and the additional terms have orders dividing .
If on an interval, set . Apart from the first ranks, each rank has in the same interval. Construction at gives
Thus at most ranks in each constant interval are exceptional. Liu’s estimate [7 Proposition 9.1], valid for any fixed whose odd part is a -group, gives . Hence, for integer , the number of exceptional ranks satisfies
Dividing by gives natural density one. This completes the proof of the theorem. □
References
Author information
Yongke Qu
Department of Mathematics, Luoyang Normal University, Luoyang 471934, P.R. China
E-mail: [email protected]
Guoqing Wang*
School of Mathematical Sciences, Tiangong University, Tianjin 300387, P.R. China
E-mail: [email protected]
References
- [1]W. Gao and A. Geroldinger, On long minimal zero sequences in finite abelian groups, Period. Math. Hungar. 38 (1999), 179–211.DOI
- [2]W. Gao and A. Geroldinger, On the order of elements in long minimal zero-sum sequences, Period. Math. Hungar. 44 (2002), 63–73.DOI
- [3]W. Gao and A. Geroldinger, Zero-sum problems in finite abelian groups: A survey, Expo. Math. 24 (2006), 337–369.DOI
- [4]W. Gao, A. Geroldinger, and W. A. Schmid, Inverse zero-sum problems, Acta Arith. 128 (2007), 245–279.DOI
- [5]A. Geroldinger and F. Halter-Koch, Non-Unique Factorizations: Algebraic, Combinatorial and Analytic Theory, Pure and Applied Mathematics, vol. 278, Chapman & Hall/CRC, 2006.
- [6]B. Girard, Inverse zero-sum problems in finite Abelian p-groups, Colloq. Math. 120 (2010), 7–21.DOI
- [7]C. Liu, Davenport constants with growing binary rank, preprint, arXiv:2610.38447v1, 2026.arxiv.org/abs/2610.38447
- [8]J. E. Olson, A combinatorial problem on finite Abelian groups, I, J. Number Theory 1 (1969), 8–10.DOI
- [9]J. E. Olson, A combinatorial problem on finite Abelian groups, II, J. Number Theory 1 (1969), 195–199.DOI
- [10]W. A. Schmid, The inverse problem associated to the Davenport constant for C₂ ⊕ C₂ ⊕ C₂, and applications to the arithmetical characterization of class groups, Electron. J. Combin. 18 (2011), Paper P33.