SearcharxivSearch

arXiv · 2409.00363

A classification of finite groups with small Davenport constant

Abstract

Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered string of terms from $G$ with repetition allowed, and we say that it is a product-one sequence if its terms can be ordered so that their product is the identity element of $G$. Then, the Davenport constant $\mathsf D (G)$ is the maximal length of a minimal product-one sequence, that is a product-one sequence which cannot be factored into two non-trivial product-one subsequences. The Davenport constant is a combinatorial group invariant that has been studied fruitfully over several decades in additive combinatorics, invariant theory, and factorization theory, etc. Apart from a few cases of finite groups, the precise value of the Davenport constant is unknown. Even in the abelian case, little is known beyond groups of rank at most two. On the other hand, for a fixed positive integer $r$, structural results characterizing which groups $G$ satisfy $\mathsf D (G) = r$ are rare. We only know that there are finitely many such groups. In this paper, we study the classification of finite groups based on the Davenport constant.

Explore related subjects

Keep this discovery

BibTeXRIS

Jun Seok Oh. 2024-08-31. A classification of finite groups with small Davenport constant. https://arxiv.org/abs/2409.00363

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR