SearcharxivSearch

arXiv · 0708.0714

A Strict Inequality for a Minimal Degree of a Direct Product

Abstract

The minimal faithful permutation degree of a finite group G is the least non-negative integer n such that G embeds in the symmetric group Sym(n). Work of Johnson and Wright established conditions for when the minimal degree of a direct product equals the sum of the minimal degrees for two finite groups. Wright asked whether this is true for all finite groups. A counter- example of degree 15 was provided by the referee and was added as an addendum in a paper of Wright. Here we provide a counter-example of degree 12.

Explore related subjects

Keep this discovery

BibTeXRIS

Neil Saunders. 2007-08-07. A Strict Inequality for a Minimal Degree of a Direct Product. https://arxiv.org/abs/0708.0714

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