SearcharxivSearch

arXiv · 2102.08605

Factorizations of finite groups

Abstract

A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots A_k$. The main results are as follows. 1. For every integer $k\geq3$ there exists a finite group $G$ such that $G$ is not $k$-factorizable. 2. Let $G$ be a finite group of order $4m$. If a Sylow $2$-subgroup of $G$ is elementary abelian, all involutions of $G$ are conjugate, and the centralizer of every involution has a normal Sylow $2$-subgroup, then $G$ has no factorization of the form $G=ABC$ with $|A|=|C|=2$ and $|B|=m$. 3. Only $8$ groups of order at most $100$ fail to be $k$-factorizable for some $k$.

Explore related subjects

Keep this discovery

BibTeXRIS

Mikhail Kabenyuk. 2021-02-17. Factorizations of finite groups. https://arxiv.org/abs/2102.08605

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