The small Davenport constant of odd-prime Heisenberg groups

Let H(p³) be the exponent-p Heisenberg group of order p³. For every odd prime p, we prove that its small Davenport constant is d(H(p³)) = 3p − 3. The lower bound is given by an explicit product-one-free sequence. For the upper bound, we translate the problem into one about zero-sum blocks in Fₚ². A group-algebra estimate controls subsums in a subgroup fibre, Property B describes the extremal zero-sum-free sequences in Cₚ², and an adjacent-swap argument supplies the required central coordinates.Preprint awaiting external peer review. The accompanying programs provide corroborative finite checks and are not part of the proof. No claim of external verification or recognition is made. The paper and documentation are licensed under CC BY 4.0; the verification programs are licensed under the MIT License.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-07-30
DOI
https://doi.org/10.5281/zenodo.21708261
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The small Davenport constant of odd-prime Heisenberg groups

Temur Maghradze
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
preprint

The small Davenport constant of odd-prime Heisenberg groups

Temur Maghradze
preprint en

Abstract

Let H(p³) be the exponent-p Heisenberg group of order p³. For every odd prime p, we prove that its small Davenport constant is d(H(p³)) = 3p − 3. The lower bound is given by an explicit product-one-free sequence. For the upper bound, we translate the problem into one about zero-sum blocks in Fₚ². A group-algebra estimate controls subsums in a subgroup fibre, Property B describes the extremal zero-sum-free sequences in Cₚ², and an adjacent-swap argument supplies the required central coordinates.Preprint awaiting external peer review. The accompanying programs provide corroborative finite checks and are not part of the proof. No claim of external verification or recognition is made. The paper and documentation are licensed under CC BY 4.0; the verification programs are licensed under the MIT License.

Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.