SearcharxivSearch

arXiv · 2607.20569

Some answers regarding factorizations of finite groups

Abstract

In this note we answer some questions of G. M. Bergman concerning factorizations of finite groups. Such questions originated when M. H. Hooshmand asked whether, given a finite group $G$ and a factorization $|G| = n_1 \cdots n_k$, one can always find subsets $A_1, \dots , A_k$ of $G$ with $|A_i| = n_i$ such that $G = A_1 \cdots A_k$. This was Question 19.35 of the Kourovka Notebook. G. M. Bergman provided a counterexample for $k=3$, and Kabenyuk provided counterexamples for all $k \geq 3$. We present these counterexamples with direct proofs that mirror Bergman's original $k=3$ argument, and we answer another recent question of Bergman.

Explore related subjects

Keep this discovery

BibTeXRIS

Ryan McCulloch. 2026-07-21. Some answers regarding factorizations of finite groups. https://arxiv.org/abs/2607.20569

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