Search arXiv⌕ Search

arXiv · 2608.13747

The small Davenport constant of the Heisenberg group of order 343

Abstract

For a finite group $G$, let $\mathsf{d}(G)$ denote the maximum length of a sequence having no nonempty subsequence whose terms can be ordered to have product one. For an odd prime $p$, let $H_{p^3}=\operatorname{UT}*3(\mathbb{F}*p)$. Godara and Sarkar proved $\mathsf{d}(H*{27})=6$ and conjectured $\mathsf{d}(H*{p^3})=3p-3$; in a recent preprint, White proved the next case $\mathsf{d}(H_{125})=12$ and left $18\leq\mathsf{d}(H_{343})\leq24$. We prove $\mathsf{d}(H_{343})=18$. We adopt White's product-one criterion and spread framework and develop a $p=7$-specific direction stratification. An explicit product-one-free sequence gives the lower bound. For the upper bound, we stratify a hypothetical product-one-free sequence of length $19$ by the number of central terms and by the occupied projective directions of its quotient multiset. Supports on at most two directions are excluded by a theoretical argument whose finite auxiliary statements are exhaustively checked; the three-direction case and the case of five central terms are settled by exact finite computations. The remaining thirty strata are encoded by a counterexample-guided SAT procedure. A separately implemented checker verifies all $9{,}920{,}815$ seed cuts and all $27{,}207$ learned cuts, and each final unsatisfiable instance is accompanied by a checked LRAT certificate. A separate implementation-level audit verifies the master encoding, the proof archives, and the lower-bound witness.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas Volkmann. 2026-08-13. The small Davenport constant of the Heisenberg group of order 343. https://arxiv.org/abs/2608.13747

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

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗