SearcharxivSearch

arXiv · 0909.4393

On triple factorisations of finite groups

Abstract

This paper introduces and develops a general framework for studying triple factorisations of the form $G=ABA$ of finite groups $G$, with $A$ and $B$ subgroups of $G$. We call such a factorisation nondegenerate if $G\neq AB$. Consideration of the action of $G$ by right multiplication on the right cosets of $B$ leads to a nontrivial upper bound for $|G|$ by applying results about subsets of restricted movement. For $A<C<G$ and $B<D<G$ the factorisation $G=CDC$ may be degenerate even if $G=ABA$ is nondegenerate. Similarly forming quotients may lead to degenerate triple factorisations. A rationale is given for reducing the study of nondegenerate triple factorisations to those in which $G$ acts faithfully and primitively on the cosets of $A$. This involves study of a wreath product construction for triple factorisations.

Explore related subjects

Keep this discovery

BibTeXRIS

S. Hassan Alavi, Cheryl E. Praeger. 2009-09-24. On triple factorisations of finite groups. https://arxiv.org/abs/0909.4393

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