Search arXivSearch

arXiv · 2103.08353

Factorizations of groups of small order

Abstract

Let $G$ be a finite group and let $A_1,\ldots,A_k$ be a collection of subsets of $G$ such that $G=A_1\ldots A_k$ is the product of all the $A_i$'s with $|G|=|A_1|\ldots|A_k|$. We write $G=A_1\cdot\ldots\cdot A_k$ and call this a $k$-fold factorization of $G$ of the form $(|A_1|,\ldots,|A_k|)$ or more briefly an $(|A_1|,\ldots,|A_k|)$-factorization of $G$. Let $k\geq2$ be a fixed integer. If $G$ has an $(a_1,\ldots,a_k)$-factorization, whenever $|G|=a_1\ldots a_k$ with $a_i>1$, $i=1,\ldots,k$, we say that $G$ is $k$-factorizable. We say that $G$ is multifold-factorizable if $G$ is $k$-factorizable for any possible integer $k\geq2$. In this paper we prove that there are exactly $6$ non-multifold-factorizable groups among the groups of order at most $60$. Here is their complete list: $A_4$, $(C_2\times C_2)\rtimes C_9$, $A_4\times C_3$, $(C_2\times C_2\times C_2)\rtimes C_7$, $A_5$, $A_4\times C_5$. Some related open questions are presented.

Explore related subjects

Keep this discovery

BibTeXRIS

Mikhail Kabenyuk. 2021-03-15. Factorizations of groups of small order. https://arxiv.org/abs/2103.08353

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