Finding Minimal Permutation Representations of Finite Groups

Ben Elias; Lior Silberman; Ramin Takloo-Bighash

Home/Archive/arXiv

arXiv · 0705.4122

Finding Minimal Permutation Representations of Finite Groups

Ben Elias·Lior Silberman·Ramin Takloo-Bighash

View original source ↗Read source document ↗Export metadata ↓

Abstract

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In these situations (except when central involutions intervene) all minimal permutation representations have the same set of orbit sizes. Using the same ideas we also show that if the size d(G) of a minimal faithful G-set is at least c|G| for some c>0 then d(G) = |G|/m + O(1) for an integer m, with the implied constant depending on c.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Ben Elias, Lior Silberman, Ramin Takloo-Bighash. 2013-07-24. Finding Minimal Permutation Representations of Finite Groups. https://arxiv.org/abs/0705.4122

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗