🔢 mathematics

The equality between the Erd\H{o}s-Ginzburg-Ziv constant and the short product-one constant for finite nonabelian groups

This paper confirms that the Erdős-Ginzburg-Ziv constant $s(G)$ equals $\eta(G) + \exp(G) - 1$ for every finite nonabelian group $G$ possessing a cyclic subgroup of index $p$ , where $p$ is the smallest prime divisor of the group's order, and subsequently determines all generalized Erdős-Ginzburg-Ziv constants for this family of groups.

Original authors: Yongke Qu, Guoqing Wang, Yuanlin Li

Published 2026-08-18

📖 7 min read🧠 Deep dive

CC BY 4.0

Original authors: Yongke Qu, Guoqing Wang, Yuanlin Li

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the vast landscape of mathematics, there is a branch dedicated to understanding how order emerges from chaos, even when the rules of the game are complex and unpredictable. Imagine a collection of objects, each with its own unique way of interacting with the others. If you line them up in a specific sequence, you might be able to pick out a smaller group from that line where the interactions cancel each other out, returning everything to a neutral starting point. In the world of numbers, this is like adding a list of integers until the total is zero. In the world of more complicated structures, it is about arranging items so that their combined effect is nothing at all. Mathematicians have long been fascinated by the question of how many items you need to gather before you are guaranteed to find such a balanced group. This is not just an abstract puzzle; it touches on the fundamental nature of symmetry and structure in systems ranging from cryptography to crystallography.

For decades, researchers have studied these patterns in groups where the order of operations does not matter, much like adding numbers where two plus three is the same as three plus two. In these simpler settings, a famous rule established that if you have a certain number of items, you can always find a balanced group of a specific size. However, when the order of operations does matter—where doing A then B is different from doing B then A—the problem becomes significantly harder. The rules change, and the guarantees that held true in the simple world often break down. For many years, mathematicians wondered if a specific, elegant relationship between the number of items needed to guarantee a balanced group and the total size of the system would hold true even in these complicated, non-commutative worlds. This question remained open for a wide variety of complex groups, leaving a gap in our understanding of how structure behaves when the rules are less forgiving.

A team of researchers has now closed this gap for a large and important family of these complex groups. By focusing on groups that contain a large, orderly cycle of elements within them, the authors proved that the elegant relationship suspected to exist is indeed real. They demonstrated that for any finite group of this type, the number of items required to force a balanced group of a specific length is exactly equal to the number of items needed to force a shorter balanced group, plus the length of that specific group, minus one. This confirms a long-standing prediction that the complex behavior of these groups follows a precise, predictable formula, unifying several previously known cases into a single, coherent theorem.

The researchers achieved this by examining groups that possess a cyclic subgroup of a specific size relative to the whole group. In plain terms, a cyclic subgroup is a part of the group that behaves like a simple circle of elements, where you can keep multiplying one element by itself to get through all the members of that part. The groups they studied have such a part that is large enough to be the main structure, with only a small number of extra elements attached to it. The authors showed that if this small number of extra elements is the smallest prime number that divides the total size of the group, the mathematical rules become predictable. They proved that the threshold for finding a balanced sequence of a specific length is exactly what the conjecture predicted, and they also determined the exact values for a broader family of related constants that measure how many items are needed to find balanced sequences of various multiples of that length.

To reach this conclusion, the team had to navigate the tricky nature of non-commutative groups, where the order of multiplication changes the outcome. They developed a series of logical steps to show that if a sequence of elements is long enough, it must contain a balanced subsequence, and they identified exactly where the breaking point lies. Their work involved analyzing how these groups are built from their simpler parts and how the properties of the whole group are constrained by the properties of its largest cyclic part. They found that in these specific cases, the complexity of the group does not create unexpected exceptions; instead, the system adheres to a strict lower bound that was previously only a hypothesis. This result is significant because it provides a complete answer for a class of groups that includes many important examples, such as dihedral groups, which describe the symmetries of regular polygons, and dicyclic groups, which appear in various areas of physics and chemistry.

The paper also addresses a related question about whether a specific formula relating different mathematical constants always holds true. The authors showed that for the groups they studied, the formula works perfectly, meaning that the minimum number of items needed to guarantee a balanced sequence is exactly the sum of the minimum number needed for a shorter sequence and the length of the target sequence, minus one. This is a stronger result than just confirming the equality; it shows that the system is as efficient as possible, with no wasted room for error. The researchers also explored whether this relationship holds for all finite groups and found that it does not. They provided a specific example of a group where the relationship breaks down, demonstrating that the elegance of the formula is a special feature of the groups they studied, not a universal law for all mathematical structures.

This work does more than just solve a specific equation; it clarifies the boundary between order and chaos in these mathematical systems. By proving that the relationship holds for this broad family of groups, the authors have given mathematicians a reliable tool for predicting the behavior of balanced sequences in these contexts. They have also opened the door to further questions about other types of groups, suggesting that while the formula is not universal, it is far more widespread than previously thought. The study confirms that even in the most intricate arrangements of elements, where the order of operations matters deeply, there are still fundamental limits that govern how quickly balance can be achieved. The findings stand as a rigorous proof, leaving no room for doubt about the validity of the relationship for the groups in question, and they set a new standard for understanding these complex structures.

The implications of this work extend beyond the immediate results. By establishing these constants, the researchers have provided a clearer picture of the underlying architecture of these groups. This clarity is essential for anyone working with these structures, whether in pure mathematics or in applied fields where symmetry plays a crucial role. The ability to predict the exact point at which a balanced sequence must appear allows for more efficient algorithms and a deeper understanding of the systems being modeled. The paper concludes by posing new questions about the limits of these relationships, inviting further exploration into the vast territory of finite groups. It leaves the reader with a sense that while the universe of mathematical structures is vast and varied, there are still islands of perfect predictability waiting to be mapped, and this study has charted a significant portion of one such island.

Technical Summary

Problem Statement
The paper investigates the relationship between two fundamental constants in zero-sum theory extended to finite nonabelian groups: the Erdős-Ginzburg-Ziv (EGZ) constant, denoted $s(G)$ , and the short product-one constant, denoted $\eta(G)$ . For a finite group $G$ with exponent $\exp(G)$ , $s(G)$ is the smallest integer forcing a product-one subsequence of length exactly $\exp(G)$ , while $\eta(G)$ is the smallest integer forcing a nonempty product-one subsequence of length at most $\exp(G)$ .

A standard extremal construction establishes the lower bound $s(G) \geq \eta(G) + \exp(G) - 1$ . In the abelian setting, W. Gao conjectured that this bound is always sharp, i.e., $s(G) = \eta(G) + \exp(G) - 1$ . While confirmed for various abelian families (e.g., rank $\leq 2$ , specific exponents), the conjecture remains open for general abelian groups. In the nonabelian setting, the problem is more complex due to the dependence of the product on term ordering. Previous results verified Gao's equality for specific nonabelian families (dihedral, dicyclic, and certain metacyclic groups), often characterized by having a cyclic subgroup of index 2. This paper seeks to determine if a uniform structural theorem exists for a broader class of nonabelian groups, specifically those possessing a cyclic subgroup of index $p$ , where $p$ is the smallest prime divisor of $|G|$ .

Methodology
The authors employ a combination of structural group theory and combinatorial sequence analysis.

Structural Analysis: Utilizing the fact that a subgroup of index $p$ (the smallest prime divisor of $|G|$ ) is normal, the paper analyzes the structure of $G$ via a cyclic subgroup $H$ of index $p$ . The group is presented as a semidirect product or extension involving $H$ and a cyclic group of order $p$ .
Quotient Group Reduction: The proof strategy involves lifting results from the quotient group $G/K$ (where $K$ is a specific characteristic subgroup of $H$ ) back to $G$ . The quotient $G/K$ is shown to be isomorphic to $C_p \oplus C_p$ .
Combinatorial Lemmas: The authors utilize known results for abelian groups of rank at most two (specifically $C_k \oplus C_k$ ) regarding the existence of product-one subsequences of prescribed lengths. Key lemmas (3.6, 3.7) are used to decompose sequences in the quotient group and lift these decompositions to the original group.
Case Distinction: The proof of the main theorem distinguishes between two cases based on the exponent of $G$ $G$ :
- Case 1: $\exp(G) = |H|$ (where $|H| = |G|/p$ ).
- Case 2: $\exp(G) = |G|$ .
  In Case 1, a contradiction argument is used: assuming a sequence of length $2|G|/p + p - 2$ lacks a product-one subsequence of length $\exp(G)$ leads to the construction of a sequence in an abelian subgroup that violates known abelian bounds.
Generalized Constants: The paper extends the analysis to generalized EGZ constants $s_{m\exp(G)}(G)$ and the stabilization threshold $\ell(G)$ , linking them to the small Davenport constant $d(G)$ .

Key Contributions and Results
The primary contribution is the confirmation of Gao's conjecture for a broad, unified family of finite nonabelian groups.

Theorem 1.1: Let $G$ be a finite nonabelian group with a cyclic subgroup $H$ of index $p$ , where $p$ is the smallest prime divisor of $|G|$ . Then:
$s(G) = \eta(G) + \exp(G) - 1 = d(G) + \exp(G)$
Furthermore, the paper provides explicit formulas for $s(G)$ :
- If $\exp(G) = |G|/p$ , then $s(G) = 2|G|/p + p - 2$ .
- If $\exp(G) = |G|$ , then $s(G) = |G| + |G|/p + p - 2$ .
Generalized Constants: For the groups described in Theorem 1.1, the paper determines the entire family of generalized EGZ constants. For every integer $m \geq 1$ :
$s_{m\exp(G)}(G) = d(G) + m\exp(G) = \eta(G) + m\exp(G) - 1$
This implies that the stabilization threshold $\ell(G) = 1$ for this class of groups.
Counterexamples and Scope: The paper clarifies that the equality $s(G) = d(G) + \exp(G)$ does not hold for all finite groups. It provides an example ( $D_{2n} \times C_2$ ) where $s(G) = \eta(G) + \exp(G) - 1$ holds, but $s(G) > d(G) + \exp(G)$ , demonstrating that the stronger equality $s(G) = d(G) + \exp(G)$ is specific to the structural conditions of Theorem 1.1.

Significance
The paper claims to unify and extend several previously known cases (including dihedral, dicyclic, and various metacyclic groups) under a single structural theorem that is independent of a specific presentation and not restricted to index 2. By confirming the equality $s(G) = \eta(G) + \exp(G) - 1$ for groups with a cyclic subgroup of index $p$ (the smallest prime divisor), the work provides a significant step toward understanding the nonabelian extension of Gao's conjecture.

Additionally, the paper formulates Problem 4.2, asking to characterize all finite groups satisfying $s(G) = d(G) + \exp(G)$ (equivalently, $\ell(G)=1$ ). It notes that while this holds for cyclic abelian groups and the nonabelian family studied here, the situation for general nonabelian groups is "considerably richer" and the proposed formula relating $\ell(G)$ to the minimal Davenport constant $D(G)$ does not extend verbatim to nonabelian groups (as shown in Example 4.6). The paper concludes by posing Problem 4.7 regarding the finiteness and bounds of the stabilization threshold $\ell(G)$ for general finite groups.

Technical Summary

More like this