SearcharxivSearch

arXiv · 1410.7854

The Smallest Faithful Permutation Degree for a Direct Product Obeying an Inequality Condition

Abstract

The minimal faithful permutation degree $\mu(G)$ of a finite group $G$ is the least nonnegative integer $n$ such that $G$ embeds in the symmetric group $\Sym(n)$. Clearly $\mu(G \times H) \le \mu(G) + \mu(H)$ for all finite groups $G$ and $H$. Wright (1975) proves that equality occurs when $G$ and $H$ are nilpotent and exhibits an example of strict inequality where $G\times H$ embeds in $\Sym(15)$. Saunders (2010) produces an infinite family of examples of permutation groups $G$ and $H$ where $\mu(G \times H) < \mu(G) + \mu(H)$, including the example of Wright's as a special case. The smallest groups in Saunders' class embed in $\Sym(10)$. In this paper we prove that 10 is minimal in the sense that $\mu(G \times H) = \mu(G) + \mu(H)$ for all groups $G$ and $H$ such that $\mu(G\times H)\le 9$.

Explore related subjects

Keep this discovery

BibTeXRIS

Neil Saunders, David Easdown. 2014-10-29. The Smallest Faithful Permutation Degree for a Direct Product Obeying an Inequality Condition. https://doi.org/10.1080/00927872.2015.1085548

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