SearcharxivSearch

arXiv · 2105.03080

Systems of imprimitivity for wreath products

Abstract

Let $G$ be an irreducible imprimitive subgroup of $\operatorname{GL}_n(\mathbb{F})$, where $\mathbb{F}$ is a field. Any system of imprimitivity for $G$ can be refined to a nonrefinable system of imprimitivity, and we consider the question of when such a refinement is unique. Examples show that $G$ can have many nonrefinable systems of imprimitivity, and even the number of components is not uniquely determined. We consider the case where $G$ is the wreath product of an irreducible primitive $H \leq \operatorname{GL}_d(\mathbb{F})$ and transitive $K \leq S_k$, where $n = dk$. We show that $G$ has a unique nonrefinable system of imprimitivity, except in the following special case: $d = 1$, $n = k$ is even, $|H| = 2$, and $K$ is a transitive subgroup of $C_2 \wr S_{n/2}$. As a simple application, we prove results about inclusions between wreath product subgroups.

Explore related subjects

Keep this discovery

BibTeXRIS

Mikko Korhonen, Cai Heng Li. 2021-05-07. Systems of imprimitivity for wreath products. https://doi.org/10.1016/j.jalgebra.2021.07.028

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