SearcharxivSearch

arXiv · 2003.12866

A note on factorizations of finite groups

Abstract

In Question 19.35 of the Kourovka Notebook, M. H. Hooshmand asks whether, given a finite group $G$ and a factorization $\mathrm{card}(G)= n_1\ldots n_k$, one can always find subsets $A_1,\ldots,A_k$ of $G$ with $\mathrm{card}(A_i)=n_i$ such that $G=A_1\ldots A_k;$ equivalently, such that the group multiplication map $A_1\times\ldots\times A_k\to G$ is a bijection. We show that for $G$ the alternating group on 4 elements, $k=3$, and $(n_1,n_2,n_3) = (2,3,2)$, the answer is negative. We then generalize some of the tools used in our proof, and note an open question.

Explore related subjects

Keep this discovery

BibTeXRIS

George M. Bergman. 2020-03-28. A note on factorizations of finite groups. https://doi.org/10.30504/jims.2020.108338

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