Search arXivSearch

arXiv · 2608.23319

The Gao-Zhuang conjecture for the Heisenberg group over $\mathbb{F}_p$

Abstract

Let $G$ be a finite nonabelian group. The small Davenport constant $\mathsf d(G)$ of $G$ is the largest integer $\ell$ such that there exists a product-one free sequence over $G$ of length $\ell$, while the Gao constant $E(G)$ of $G$ is the least integer $\ell$ such that every sequence over $G$ of length at least $\ell$ contains a product-one subsequence of length exactly $|G|$. A long-standing conjecture of Gao and Zhuang \cite{ZG2005} asserts that $E(G)=\mathsf d(G)+|G|$ for every finite nonabelian group $G$. Let $p$ be an odd prime and let $H_{p^3}=\operatorname{UT}_3(\mathbb F_p)$ be the finite Heisenberg group over $\mathbb F_p$. Godara and Sarkar proved the Gao-Zhuang equality for $H_{27}=\operatorname{UT}_3(\mathbb F_3)$ and asked whether the same equality holds for $H_{p^3}$ for every odd prime $p$. Recently, Volkmann proved that $\mathsf d(H_{p^3})=3p-3$. In this paper, we determine the Gao constant of $H_{p^3}$ and prove that $E(H_{p^3})=\mathsf d(H_{p^3})+|H_{p^3}|=p^3+3p-3$. Together with the known abelian and cyclic-index cases, this completes the verification of the Gao-Zhuang equality for all groups of order $p^3$, for every prime $p$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yongke Qu, Guoqing Wang. 2026-09-06. The Gao-Zhuang conjecture for the Heisenberg group over $\mathbb{F}_p$. https://arxiv.org/abs/2608.23319

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO