🔢 mathematics

The Gao-Zhuang conjecture for the Heisenberg group

This paper proves that the Gao constant of the Heisenberg group $H_{p^3}$ satisfies the Zhuang–Gao conjecture by establishing the equality $E(H_{p^3}) = \mathsf{d}(H_{p^3}) + |H_{p^3}| = p^3 + 3p - 3$ for every odd prime $p$ .

Original authors: Yongke Qu, Guoqing Wang

Published 2026-08-25

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Yongke Qu, Guoqing Wang

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 the study of patterns that emerge when we arrange things in sequences. Imagine a collection of objects, each with a specific value or identity, and a rule for how they combine. If you line them up in a specific order and multiply them together, do they eventually cancel each other out to return to a starting point of nothingness? This question lies at the heart of zero-sum theory, a field that explores how long a list of items must be before it is guaranteed to contain a smaller group that balances perfectly to zero. For simple, predictable systems where the order of operations does not matter, mathematicians have long known the exact length required to guarantee this balance. However, the world becomes far more complex when the order of operations changes the outcome, a situation known as non-commutativity. In these more chaotic systems, finding a balanced group is not just about picking the right items, but also about arranging them in the precise sequence that allows them to neutralize one another.

The paper at hand tackles a specific, stubborn question within this complex territory, focusing on a mathematical structure known as the Heisenberg group. This group is a fundamental example of a system where order matters, behaving like a set of three-dimensional coordinates where shifting one value affects the others in a non-linear way. For decades, mathematicians have suspected a simple relationship between the length of a sequence needed to guarantee a balanced group and the total size of the system itself. This suspicion, known as the Gao-Zhuang conjecture, suggests that the required length is simply the size of the group plus the length of the longest possible list that fails to have a balanced group. While this rule has been proven for many types of groups, it remained an open mystery for the Heisenberg group, a structure that serves as a critical test case for understanding more complicated systems.

The researchers in this study set out to settle this uncertainty once and for all. They focused on the Heisenberg group defined over a field of numbers where the total count is an odd prime number cubed. The team began by acknowledging a recent breakthrough by another mathematician, who had already determined the maximum length of a list that could avoid having a balanced group in this specific setting. The remaining challenge was to prove that any list longer than that maximum, plus the size of the group, would inevitably contain a balanced group of the exact size of the group itself. To solve this, the authors developed a strategy that involved breaking the problem down into smaller, more manageable pieces. They examined how the elements of the group behave when projected onto a simpler, two-dimensional version of the structure, effectively stripping away the most complex layer of the problem to see the underlying patterns.

By carefully analyzing these projections, the researchers demonstrated that if a sequence is long enough, it must contain a specific type of balanced sub-group within this simpler version. They then showed that this sub-group could be rearranged and combined with other parts of the original sequence to form a perfect balance in the full, complex system. The proof relied on a clever counting argument, ensuring that there were always enough "fresh" elements available to complete the balance without running out of options. The authors rigorously checked every possible scenario, including cases where the elements were distributed unevenly or clustered in specific ways, to ensure no loopholes existed.

The result is a definitive confirmation of the long-standing conjecture for this entire family of groups. The authors proved that the rule holds true: the length required to guarantee a balanced group is exactly the size of the group plus the length of the longest possible list that fails to balance. For the Heisenberg group of a specific size determined by an odd prime, this number is calculated as the prime cubed, plus three times the prime, minus three. This finding does more than just solve a single equation; it validates a broader principle about how order and structure interact in complex systems. It confirms that even in systems where the sequence of actions drastically changes the result, there is a predictable threshold where chaos gives way to order. The work stands as a complete proof, leaving no room for doubt, and provides a solid foundation for future investigations into other non-commutative systems where similar rules might apply.

Technical Summary of "The Gao-Zhuang conjecture for the Heisenberg group"

Problem Statement
The paper addresses the Gao-Zhuang conjecture within the framework of zero-sum theory for finite nonabelian groups. For a finite nonabelian group $G$ , two constants are defined: the small Davenport constant $d(G)$ , which is the maximal length of a product-one-free sequence over $G$ , and the Gao constant $E(G)$ , which is the minimal integer $\ell$ such that every sequence of length $\ell$ contains a product-one subsequence of length exactly $|G|$ . The conjecture, proposed by Zhuang and Gao, asserts that for every finite nonabelian group $G$ , the equality $E(G) = d(G) + |G|$ holds.

While this equality is established for finite abelian groups (Gao [4]) and verified for specific nonabelian classes (dihedral groups, dicyclic groups, groups of order $pq$, and certain semidirect products), the general case remains open. The specific focus of this work is the finite Heisenberg group $H_p^3 = UT_3(\mathbb{F}_p)$ , where $p$ is an odd prime. This group is the unique nonabelian group of order $p^3$ and exponent $p$ . Godara and Sarkar [10] previously verified the conjecture for the case $p=3$ (order 27) and posed the question for all odd primes $p$ . Recently, Volkmann [17] determined the value of $d(H_p^3) = 3p - 3$ . The remaining problem is to determine $E(H_p^3)$ and verify if the conjecture holds for the entire family of Heisenberg groups.

Methodology
The authors employ a combination of classical zero-sum results, structural properties of the Heisenberg group, and polynomial methods. The proof strategy relies on the following key components:

Structural Decomposition: The Heisenberg group $H_p^3$ is analyzed via its center $Z \cong C_p$ and the quotient $H_p^3/Z \cong C_p^2$ (elementary abelian of rank 2). The canonical epimorphism $\phi: H_p^3 \to C_p^2$ maps sequences to the elementary abelian quotient.
Ordering-Value Method: The authors utilize the "ordering-value" technique for mixed zero-sum subsequences in the quotient $C_p^2$ . Specifically, they analyze the set of possible products $\pi(T)$ of a sequence $T$ by examining the set of values $\Omega(\phi(T))$ derived from different orderings of the terms.
Polynomial Method (Combinatorial Nullstellensatz): A central technical tool is Lemma 3.12, which uses multilinear polynomials over $\mathbb{F}_p$ to establish lower bounds on the size of the intersection of sumsets with subgroups. This lemma guarantees that if a sequence in $C_p^2$ lacks zero-sum subsequences of length $p$ or $2p$ , its sumsets must cover a significant portion of any subgroup of order $p$ .
Inductive and Extremal Arguments: The proof proceeds by contradiction. Assuming a sequence $S$ of length $p^3 + 3p - 3$ has no product-one subsequence of length $p^3$ , the authors decompose $S$ into blocks of length $p$ with zero-sum projections. They analyze the distribution of these blocks within subgroups of order $p^2$ containing the center.
Maximal Decomposition: The argument involves constructing a maximal family of disjoint $p$ -term zero-sum subsequences in the quotient and analyzing the residual sequence. The authors use Lemma 3.4 (Gao's prescribed-length theorem) and Lemma 3.10 (Cauchy-Davenport applications) to force the existence of the required product-one subsequence.

Key Contributions and Results
The primary contribution of the paper is the proof of the Gao-Zhuang conjecture for the Heisenberg group $H_p^3$ for all odd primes $p$ .

Main Theorem (Theorem 1.1): Let $p$ be an odd prime and $G = H_p^3$ . Then:
$E(G) = d(G) + |G| = p^3 + 3p - 3$
Given Volkmann's result that $d(H_p^3) = 3p - 3$ , this confirms that $E(H_p^3) = (3p - 3) + p^3$ .
Auxiliary Results:
- The paper establishes that for any sequence $S$ of length $p^3 + 3p - 3$ , if it lacks a product-one subsequence of length $p^3$ , then the projection of $S$ onto the quotient $C_p^2$ must exhibit specific structural constraints regarding its support and multiplicities.
- Lemma 3.12 provides a new additive combinatorial bound for sequences in $C_p^2$ lacking zero-sum subsequences of length $p$ or $2p$ , which is instrumental in the main proof.
- The proof demonstrates that any sequence of the critical length must contain a "mixed" zero-sum subsequence in the quotient that, when lifted back to $H_p^3$ and combined with central elements, yields a product-one subsequence of length $|G|$ .

Significance
The paper resolves a specific open case of the Gao-Zhuang conjecture, extending the validity of the equality $E(G) = d(G) + |G|$ from the nonabelian group of order 27 to the entire infinite family of Heisenberg groups of order $p^3$ (for odd $p$ ).

The authors note that the Heisenberg group serves as a fundamental testing ground for questions regarding nonabelian $p$ -groups. Its structure, being nilpotent of class 2 with an elementary abelian central quotient, provides a natural bridge between nonabelian product-one theory and classical zero-sum theory. By successfully determining $E(H_p^3)$ , the paper confirms that the interplay between the selection of subsequences and the ordering of terms in this specific nonabelian setting adheres to the same linear relationship observed in the abelian case. The work builds directly upon recent advances by Godara and Sarkar [10] and Volkmann [17], completing the picture for this canonical example of a finite nonabelian $p$ -group.

More like this