SearcharxivSearch

arXiv · 2009.05355

Restrictions on sets of conjugacy class sizes in arithmetic progressions

Abstract

We continue the investigation, that began in [3] and [4], into finite groups whose set of nontrivial conjugacy class sizes form an arithmetic progression. Let $G$ be a finite group and denote the set of conjugacy class sizes of $G$ by ${\rm cs}(G)$. Finite groups satisfying ${\rm cs}(G) = \{1,2,4,6\}$ and $\{1,2,4,6,8\}$ are classified in [4] and [3], respectively, we demonstrate these examples are rather special by proving the following. There exists a finite group $G$ such that ${\rm cs}(G) = \{1, 2^{\alpha}, 2^{\alpha+1}, 2^{\alpha}3 \}$ if and only if $\alpha =1$. Furthermore, there exists a finite group $G$ such that ${\rm cs}(G) = \{1, 2^{\alpha}, 2^{\alpha +1}, 2^{\alpha}3, 2^{\alpha +2}\}$ and $\alpha$ is odd if and only if $\alpha=1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Alan R. Camina, Rachel D. Camina. 2020-09-11. Restrictions on sets of conjugacy class sizes in arithmetic progressions. https://arxiv.org/abs/2009.05355

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