betaFeedback

WorksMathematics

The Erdős–Ginzburg–Ziv theorem for finite groups

Abstract

Let GG be a finite group, and let pp be the smallest prime divisor of ∣G∣|G|. The Gao constant E(G)\mathsf{E}(G) is the least integer ℓ\ell such that every sequence over GG of length ℓ\ell contains a subsequence of length ∣G∣|G| whose terms can be ordered to have product equal to the identity. In 1961, Erdős, Ginzburg and Ziv proved that every sequence of 2n−12n-1 integers has an nn-term subsequence whose sum is divisible by nn; equivalently, E(Cn)≤2n−1\mathsf{E}(C_n)\leq 2n-1, where CnC_n denotes the cyclic group of order nn. In this paper, we prove that E(G)≤∣G∣+∣G∣/p−1\mathsf{E}(G)\leq |G|+|G|/p-1 whenever GG contains no cyclic subgroup of index pp. Consequently, every finite non-cyclic group satisfies E(G)≤∣G∣+∣G∣/p+p−2\mathsf{E}(G)\leq |G|+|G|/p+p-2, with equality if and only if GG contains a cyclic subgroup of index pp. This establishes the conjectured upper bound for the Gao constant and provides a complete characterization of the equality case.

Introduction

Let GG be a finite group written multiplicatively. A sequence over GG is a finite multiset of elements of GG. Such a sequence is called product-one when its terms can be ordered so that their product is the identity. The Gao constant E(G)E(G) is the least integer ℓ\ell such that every sequence over GG of length ℓ\ell has a product-one subsequence of length ∣G∣|G|. The small Davenport constant d(G)d(G) is the maximal length of a sequence with no nonempty product-one subsequence.

The Erdős–Ginzburg–Ziv theorem [12], proved in 1961, asserts that every sequence of 2n−12n-1 integers has an nn-term subsequence whose sum is divisible by nn. The bound is sharp, as shown by the sequence consisting of n−1n-1 zeros and n−1n-1 ones. Consequently, E(Cn)=2n−1E(C_n)=2n-1, where CnC_n denotes the cyclic group of order nn. Together with the study of the Davenport constant, this theorem forms one of the foundations of zero-sum theory. Although much of the early work concerned abelian groups, product-one problems provide a natural extension to arbitrary finite groups.

In 1976, Olson [40] proved that E(G)≤2∣G∣−1E(G) \le2|G|-1 for every finite group. Subsequent work established sharper bounds for non-cyclic solvable groups. In 1984, Yuster and Peterson [55] obtained the bound 2∣G∣−22|G|-2, and Yuster [54] derived further improvements in 1988. Gao [16] proved the bound 11∣G∣/6−111|G|/6-1 in 1996, and Gao and Li [18] subsequently strengthened it to 7∣G∣/4−17|G|/4-1 in 2010. The latter authors also proposed the following conjecture [18 Conjecture 3].

Conjecture 1.1. Every finite non-cyclic group GG satisfies E(G)≤3∣G∣/2E(G) \le3|G|/2.

In 2015, Han [27] proved that E(G)≤∣G∣+∣G∣p+p−2E(G) \le|G| + \frac{|G|}{p} + p - 2 for every finite non-cyclic nilpotent group, where pp is the smallest prime divisor of ∣G∣|G|. This result establishes Conjecture 1.1 for nilpotent groups. He also proposed the following stronger conjecture [27 Conjecture 3.1].

Conjecture 1.2. Every finite non-cyclic group GG satisfies E(G)≤∣G∣+∣G∣p+p−2E(G) \le|G| + \frac{|G|}{p} + p - 2, where pp is the smallest prime divisor of ∣G∣|G|.

2020 Mathematics Subject Classification. Primary 11B75; Secondary 20D10, 20D60.

Key words and phrases. Erdős–Ginzburg–Ziv theorem, Gao constant, Davenport constant, product-one sequence, solvable group, finite simple group, product-set growth.

Further cases of Conjecture 1.1 have since been established. In 2021, Gao, Li and Qu [19] established it for non-cyclic groups of odd order. Recently, in 2026, Godara, Joshi, and Mazumdar [24] verified it for non-cyclic groups of the form A⋊−1C2A \rtimes_{-1} C_{2}, where AA is a finite abelian pp-group and the nonidentity element of C2C_{2} acts on AA by inversion. In 2026, Zhao and Wang [56] proved it for non-cyclic groups whose orders are not divisible by four and characterized the equality case.

The problem of determining d(G)d(G) for a finite abelian group GG was proposed by Davenport in 1966, motivated by connections between d(G)+1d(G) + 1 and algebraic number theory. This problem has received considerable attention (see [22, 29] for example). Nevertheless, exact values are known only for certain classes of finite abelian groups. In 1996, Gao [15] proved that E(G)=d(G)+∣G∣E(G) = d(G) + |G| for every finite abelian group. For non-abelian groups, the Davenport constant also has close connections with the Noether number (see [4, 5, 6, 28, 48] for further details). The extension of this identity to non-abelian groups has also attracted considerable interest. In 2005, Zhuang and Gao [57] established it for dihedral groups of order 2p2p where p≥4001p \ge4001 is a prime, and proposed the following conjecture [57 Conjecture 2].

Conjecture 1.3. Every finite group GG satisfies E(G)=∣G∣+d(G)E(G) = |G| + d(G).

Subsequent research has devoted considerable attention to finite non-abelian groups containing a cyclic subgroup of index two. In 2008, Gao and Lu [20] extended the preceding result to dihedral groups of order 2n2n for all n≥23n \ge23. Extending their method, Bass [7] proved the conjecture for all dihedral groups and dicyclic groups, as well as for non-abelian groups of order pqpq, where pp and qq are primes. In 2023, Avelar, Brochero Martínez and Ribas [3] verified it for non-abelian semidirect products C2⋊CnC_{2} \rtimes C_{n}, apart from a single exceptional case, which was subsequently resolved by Oh, Ribas, Zhao and Zhong [36]. Yang, Zhang and Feng [53] in 2024 and Ribas [46] in 2025 established the conjecture for certain non-split metacyclic groups containing a cyclic subgroup of index two. More recently, Qu, Gao and Li [42] proved it for every finite non-cyclic group containing a cyclic subgroup whose index is the smallest prime divisor of the group order.

For the small Davenport constant, Qu, Li and Teeuwsen [44] established the optimal upper bound d(G)≤∣G∣/p−1d(G) \le|G|/p - 1 for every non-cyclic group GG containing no cyclic subgroup of index pp, where pp is the smallest prime divisor of ∣G∣|G|. In this paper, we further investigate the Gao constant E(G)E(G) for these groups and establish the following main result.

Theorem 1.4. Let GG be a finite non-cyclic group, and let pp be the smallest prime divisor of ∣G∣|G|. If GG has no cyclic subgroup of index pp, then

E(G)≤∣G∣+∣G∣p−1.E(G) \le|G| + \frac{|G|}{p} - 1.

In particular, if GG is non-solvable, then E(G)≤3∣G∣/2−1E(G) \le3|G|/2 - 1.

Combining Theorem 1.4 with [42 Theorem 1.5] yields the following corollary.

Corollary 1.5. Let GG be a finite non-cyclic group, and let pp be the smallest prime divisor of $|G|. Then

E(G)≤∣G∣+∣G∣p+p−2,E(G) \le|G| + \frac{|G|}{p} + p - 2,

with equality if and only if GG has a cyclic subgroup of index pp. Moreover,

E(G)≤3∣G∣/2,E(G) \le3|G|/2,

with equality if and only if GG has a cyclic subgroup of index 2. Thus, Conjectures 1.1 and 1.2 both hold, with equality cases described above.

Proof strategy of Theorem 1.4

The proof mainly consists of the following two aspects.

  • Solvable groups. We first establish the bound for nilpotent groups. Theorem 4.2 then shows that a solvable counterexample of minimal order must fall into one of five configurations. The estimates ruling out these configurations are established in Sections 5–7 and summarized in Section 4.3.

  • Non-solvable groups. Proposition 3.2 reduces the problem to non-abelian simple groups. For these groups, Theorem 9.8 handles sequences of bounded height, while Lemma 10.1 provides a method for treating the remaining sequences. The subsequent arguments are organized according to the product constructions they employ, and a final proposition verifies that all relevant groups and element orders are covered.

Section 2 collects the preliminary results, and Section 3 presents the reduction for non-solvable groups. Sections 4–7 establish the result for solvable groups, while Sections 8–10 develop the bounded-height argument and the common completion criteria. The treatment of sequences containing a term of high multiplicity is organized into four parts: subgroup and compatible extraction in Section 11, short product-one subsequences in Section 12, growth of conjugation orbits in Section 13, and cyclic seeds in Section 14. Numerical applications of each method are summarized in tables. Section 15 verifies that all relevant cases are covered and completes the proof for simple groups. Finally, Section 16 combines these results with the argument for solvable groups to complete the proof of Theorem 1.4.

Notation and preliminary results

Throughout the paper, all groups are finite. The trivial group is denoted by 11, and CmC_m denotes the cyclic group of order mm. A finite abelian group of rank at most two is written as Cn1×Cn2C_{n_1} \times C_{n_2}, where n1n_1 and n2n_2 are positive integers satisfying n1∣n2n_1 \mid n_2; the case n1=1n_1 = 1 includes cyclic groups. We use multiplicative notation unless an abelian group is explicitly written additively.

The free abelian monoid on GG is denoted by F(G)\mathcal{F}(G). The multiplication in F(G)\mathcal{F}(G) is denoted by the bold dot symbol ⋅\boldsymbol{\cdot} rather than by juxtaposition. Its elements are finite sequences, or multisets, of elements of GG. Let S=g1⋅…⋅gℓS = g_1 \boldsymbol{\cdot} \ldots\boldsymbol{\cdot} g_\ell be a sequence over GG. We write ∣S∣=ℓ|S| = \ell for the length and vg(S)=∣{i:gi=g}∣v_g(S) = |\{i : g_i = g\}| for the multiplicity of gg. The support and height of a nonempty sequence are

supp⁡(S)={g:vg(S)>0}andh(S)=max⁡gvg(S).\operatorname{supp}(S) = \{g : v_g(S) > 0\} \qquad\text{and}\qquad h(S) = \max_g v_g(S).

Brackets distinguish sequence powers from group powers: g[a]g^{[a]} denotes a sequence of aa copies of gg, whereas gag^a is a group power. A sequence T∈F(G)T \in\mathcal{F}(G) is called a subsequence of SS and is denoted by T∣ST \mid S when vg(T)≤vg(S)v_g(T) \leq v_g(S) for all g∈Gg \in G. Denote by S⋅T[−1]S \boldsymbol{\cdot} T^{[-1]} the subsequence of SS obtained by removing the terms of TT from SS. For X⊆GX \subseteq G, let SXS_X be the subsequence of terms lying in XX.

We define

π(S)={gτ(1)⋅…⋅gτ(ℓ):τ a permutation of [1,ℓ]}andΠk(S)=⋃T∣S,∣T∣=kπ(T).\pi(S) = \{g_{\tau(1)} \boldsymbol{\cdot} \ldots\boldsymbol{\cdot} g_{\tau(\ell)} : \tau\text{ a permutation of }[1,\ell]\} \qquad\text{and}\qquad \Pi_k(S) = \bigcup_{\substack{T\mid S,\,|T|=k}} \pi(T).

The empty sequence has product set {1}\{1\}, so Π0(S)={1}\Pi_0(S) = \{1\}. A sequence is product-one when 1∈π(S)1 \in\pi(S), and it is product-one free when none of its nonempty subsequences is product-one. The small Davenport constant d(G)\mathsf{d}(G) is the maximal length of a product-one free sequence. Thus every sequence of length at least d(G)+1\mathsf{d}(G) + 1 has a nonempty product-one subsequence.

Write exp⁡(G)\exp(G) for the exponent of GG and meo⁡(G)\operatorname{meo}(G) for its maximum element order. For positive integers ee, kk, let ηe(G)\eta_e(G), respectively sk(G)\mathsf{s}_k(G), be the least integer LL forcing a nonempty product-one subsequence of length at most ee, respectively exactly kk, in every sequence of length at least $L, whenever this threshold exists. These constants exist precisely when e≥meo⁡(G)e \ge\operatorname{meo}(G), respectively exp⁡(G)∣k\exp(G) \mid k: necessity follows from constant sequences, and sufficiency from sufficiently many equal terms. Thus E(G)=s∣G∣(G)E(G) = s_{|G|}(G). In additive notation, we write σ(S)\sigma(S) for a sequence sum and Σk(S)\Sigma_k(S) for its kk-term subsums. A homomorphism of GG acts on sequences over GG term by term. We use exp⁡(G)\exp(G) for the exponent, G′G' for the commutator subgroup, Z(G)Z(G) for the centre, and Φ(G)\Phi(G) for the Frattini subgroup. For H◃GH \triangleleft G, the quotient map is denoted by φH:G→G/H\varphi_H : G \to G/H.

Classical sequence bounds and inverse results

We first record the values and bounds for d(G)d(G) and E(G)E(G) used below.

Lemma 2.1. The following assertions hold.

(i) If r≥1r \ge1 and pp is prime, then

d(Cpr)=r(p−1).d(C_p^r) = r(p - 1).

If G≅Cn1×Cn2G \cong C_{n_1} \times C_{n_2} is a finite abelian group of rank at most two, where n1∣n2n_1 \mid n_2, then

d(G)=n1+n2−2.d(G) = n_1 + n_2 - 2.

(ii) Suppose that GG is non-cyclic and that pp is the smallest prime divisor of ∣G∣|G|. If GG has a cyclic subgroup of index pp, then

d(G)=∣G∣/p+p−2.d(G) = |G|/p + p - 2.

(iii) Suppose that GG is non-cyclic and that pp is the smallest prime divisor of ∣G∣|G|. If GG has no cyclic subgroup of index pp, then

d(G)≤∣G∣/p−1.d(G) \le|G|/p - 1.

Proof. Part (i) follows from Olson’s results [37, 38]; see also Theorem 3.1 in [17]. Parts (ii) and (iii) are established by Qu, Li and Teeuwsen [44]. □\square

References

  1. [1]F. Altunbulak Aksu, D. Green, On the Christensen–Wang bounds for the ghost number of a p-group algebra, J. Group Theory 19 (2016), 609–615.
  2. [2]R. András, K. Cziszter, M. Domokos, I. Szöllősi, The directed Cayley diameter and the Davenport constant, in: M. Brešar, A. Geroldinger, B. Olberding, D. Smertnig (eds.), Recent Progress in Ring and Factorization Theory, Springer Proceedings in Mathematics & Statistics 477, Springer, Cham, 2025, pp. 1–17.arxiv.org/abs/2401.04607
  3. [3]D. Avelar, F. Brochero Martínez, S. Ribas, On the direct and inverse zero-sum problems over Cₙ ⋊ₛ C₂, J. Combin. Theory Ser. A 197 (2023), Article no. 105751.DOI
  4. [4]K. Cziszter, M. Domokos, The Noether number for the groups with a cyclic subgroup of index two, J. Algebra 399 (2014), 546–560.arxiv.org/abs/1205.3011
  5. [5]K. Cziszter, M. Domokos, A. Geroldinger, The interplay of invariant theory with multiplicative ideal theory and with arithmetic combinatorics, in Multiplicative Ideal Theory and Factorization Theory (Springer 2016), pp. 43–95.arxiv.org/abs/1505.06059
  6. [6]K. Cziszter, M. Domokos, I. Szöllősi, The Noether number and the Davenport constants of the groups of order less than 32, J. Algebra 510 (2018), 513–541.
  7. [7]J. Bass, Improving the Erdős–Ginzburg–Ziv theorem for some non-abelian groups, J. Number Theory 126 (2007), 217–236.DOI
  8. [8]A. Bialostocki, P. Dierker, On the Erdős–Ginzburg–Ziv theorem and the Ramsey numbers for stars and matchings, Discrete Math. 110 (1992), 1–8.DOI
  9. [9]F. Brochero Martínez, A. Lemos, B. Moriya, S. Ribas, The main zero-sum constants over D₂ₙ × C₂, SIAM J. Discrete Math. 37 (2023), 1496–1508.
  10. [10]M. DeVos, L. Goddyn, B. Mohar, A generalization of Kneser’s addition theorem, Adv. Math. 220 (2009), 1531–1548.DOI
  11. [11]J. Dixon, B. Mortimer, Permutation Groups, Graduate Texts in Mathematics 163, Springer, New York, 1996.
  12. [12]P. Erdős, A. Ginzburg, A. Ziv, Theorem in the additive number theory, Bull. Res. Council Israel, Sect. F 10 (1961), 41–43.
  13. [13]W. Feit, J. Thompson, Solvability of groups of odd order, Pacific J. Math. 13 (1963), 775–1029.
  14. [14]F. Frick, J. Lehmann Duke, M. McNamara, H. Park-Kaufmann, S. Raanes, S. Simon, D. Thornburgh, Z. Wellner, Topological methods in zero-sum Ramsey theory, Forum Math. Sigma 13 (2025), Article no. e192.
  15. [15]W. Gao, A combinatorial problem on finite abelian groups, J. Number Theory 58 (1996), 100–103.DOI
  16. [16]W. Gao, An improvement of Erdős–Ginzburg–Ziv theorem, Acta Math. Sinica 39 (1996), 514–523.
  17. [17]W. Gao, A. Geroldinger, Zero-sum problems in finite abelian groups: A survey, Expo. Math. 24 (2006), 337–369.DOI
  18. [18]W. Gao, Y. Li, The Erdős–Ginzburg–Ziv theorem for finite solvable groups, J. Pure Appl. Algebra 214 (2010), 898–909.DOI
  19. [19]W. Gao, Y. Li, Y. Qu, On the invariant E(G) for groups of odd order, Acta Arith. 201 (2021), 255–267.
  20. [20]W. Gao, Z. Lu, The Erdős–Ginzburg–Ziv theorem for dihedral groups, J. Pure Appl. Algebra 212 (2008), 311–319.DOI
  21. [22]B. Girard, W. Schmid, Direct zero-sum problems for certain groups of rank three, J. Number Theory 197 (2019), 297–316.DOI
  22. [23]M. Giudici, Maximal subgroups of almost simple groups with socle PSL(2, q), preprint, arXiv:math/0703685 (2007). https://arxiv.org/abs/math/0703685.
  23. [24]N. Godara, R. Joshi, E. Mazumdar, Combinatorial invariants for certain classes of non-abelian groups, J. Number Theory 283 (2026), 44–63.DOI
  24. [25]N. Godara, S. Sarkar, A note on a conjecture of Gao and Zhuang for groups of order 27, J. Algebra Appl. 24 (2025), no. 11, Article no. 2550268, 21 pp.arxiv.org/abs/2311.02387
  25. [26]S. Guest, J. Morris, C. Praeger, P. Spiga, On the maximum orders of elements of finite almost simple groups and primitive permutation groups, Trans. Amer. Math. Soc. 367 (2015), no. 11, 7665–7694.arxiv.org/abs/1301.5166
  26. [27]D. Han, The Erdős–Ginzburg–Ziv theorem for finite nilpotent groups, Arch. Math. 104 (2015), 325–332.DOI
  27. [28]D. Han, H. Zhang, Erdős–Ginzburg–Ziv theorem and Noether number for Cₘ ×φ Cₘₙ, J. Number Theory 198 (2019), 159–175.DOI
  28. [29]C. Liu, On the lower bounds of Davenport constant, J. Combin. Theory Ser A 171 (2020), Article no. 105162, 15 pp.DOI
  29. [30]I. Isaacs, Finite Group Theory, Graduate Studies in Mathematics 92, American Mathematical Society, Providence, RI, 2008.DOI
  30. [31]W. Kantor, Á. Seress, Large element orders and the characteristic of Lie-type simple groups, J. Algebra 322 (2009), 802–832.DOI
  31. [32]C. Karthick Babu, R. Bera, M. Ghosh, B. Sury, Davenport constant and its variants for some non-abelian groups, J. Number Theory 290 (2027), 400–425.arxiv.org/abs/2406.09210
  32. [33]S. Koshitani, On the nilpotency indices of the radicals of group algebras of p-groups which have cyclic subgroups of index p, Tsukuba J. Math. 1 (1977), 137–148.DOI
  33. [34]A. Maróti, M. Tamburini Bellani, A solution to a problem of Wiegold, Comm. Algebra 41 (2013), no. 1, 34–49.DOI
  34. [35]M. Nathanson, Additive Number Theory: Inverse Problems and the Geometry of Sumsets, Graduate Texts in Mathematics 165, Springer, New York, 1996.DOI
  35. [36]J. Oh, S. Ribas, K. Zhao, Q. Zhong, On zero-sum problems over metacyclic groups Cₙ ×ₛ C₂, J. Combin. Theory Ser. A 223 (2026), Article no. 106214.DOI
  36. [37]J. Olson, A combinatorial problem on finite abelian groups, I, J. Number Theory 1 (1969), 8–10.DOI
  37. [38]J. Olson, A combinatorial problem on finite abelian groups, II, J. Number Theory 1 (1969), 195–199.DOI
  38. [39]J. Olson, Sums of sets of group elements, Acta Arith. 28 (1975), 147–156.DOI
  39. [40]J. Olson, On a combinatorial problem of Erdős, Ginzburg, and Ziv, J. Number Theory 8 (1976), 52–57.DOI
  40. [41]Y. Qu, W. Gao, On additive bases of finite groups, Acta Arith. 215 (2024), 97–113.DOI
  41. [42]Y. Qu, W. Gao, Y. Li, On the Gao constant of a finite metacyclic group, submitted (2026).
  42. [43]Y. Qu, Y. Li, D. Teeuwsen, On a conjecture of the small Davenport constant for finite groups, J. Combin. Theory Ser. A 189 (2022), Article no. 105617.DOI
  43. [44]Y. Qu, Y. Li, D. Teeuwsen, On the small Davenport constant for finite groups, Israel J. Math. 267 (2025), 397–419.DOI
  44. [45]Y. Qu, G. Wang, The Gao–Zhuang conjecture for the Heisenberg group over Fₚ, preprint, arXiv:2608.23319 (2026). https://arxiv.org/abs/2608.23319.
  45. [46]S. Ribas, Some zero-sum problems over ⟨x, y|x² = yⁿ⁄², yⁿ = 1, yx = xyˢ⟩, Bull. Braz. Math. Soc. 56 (2025), Article no. 12.
  46. [47]C. Reiher, On Kemnitz’ conjecture concerning lattice-points in the plane, Ramanujan J. 13 (2007), 333–337.DOI
  47. [48]B. Schmid, Finite groups and invariant theory, in Topics in Invariant Theory, Lecture Notes in Mathematics, volume 1478 (Springer, 1991), pp. 35–66.DOI
  48. [49]R. Solomon, The classification of finite simple groups: a progress report, Notices Amer. Math. Soc. 65 (2018), 646–651.DOI
  49. [50]C. Tsang, A generalization of Itô’s theorem to skew braces, J. Algebra 642 (2024), 367–399.
  50. [51]R. Wilson, The Finite Simple Groups, Graduate Texts in Mathematics 251, Springer, London, 2009.DOI
  51. [52]R. Wilson et al., ATLAS of Finite Group Representations, electronic resource. https://brauer.maths.qmul.ac.uk/Atlas/v3/. Alternating-group pages: https://brauer.maths.qmul.ac.uk/Atlas/alt/A6/ and https://brauer.maths.qmul.ac.uk/Atlas/alt/A7/. Mathieu page: https://brauer.maths.qmul.ac.uk/Atlas/spor/M11/.
  52. [53]J. Yang, X. Zhang, L. Feng, On the direct and inverse zero-sum problems over non-split metacyclic group, Discrete Math. 347 (2024), Article no. 114213.DOI
  53. [54]T. Yuster, Bounds for counter-examples to addition theorems in solvable groups, Arch. Math. 51 (1988), 223–231.DOI
  54. [55]T. Yuster, B. Peterson, A generalization of an addition theorem for solvable groups, Canad. J. Math. 36 (1984), 529–536.DOI
  55. [56]Y. Zhao, G. Wang, On the Gao constant of groups of even order, J. Number Theory 292 (2027), 1–11.DOI
  56. [57]J. Zhuang, W. Gao, Erdős–Ginzburg–Ziv theorem for dihedral groups of large prime index, European J. Combin. 26 (2005), 1053–1059.DOI

Paper details

vlnc:W_cfu36xm2
Version
v1 · latest
Published
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

AI tools

View statement
Looking for related papers…
Contents