Search arXivSearch

arXiv · math/0412386

Normal subgroups of odd-order monomial $p^a q^b$ groups

Abstract

A finite group $G$ is called monomial if every irreducible character of $G$ is induced from a linear character of some subgroup of $G$. One of the main questions regarding monomial groups is whether or not a normal subgroup $N$ of a monomial group $G$ is itself monomial. In the case that $G$ is a group of even order, it has been proved (Dade, van der Waall) that $N$ need not be monomial. Here we show that, if $G$ is a monomial group of order $p^aq^b$, where $p$ and $q$ are distinct odd primes, then any normal subgroup $N$ of $G$ is also monomial.

Explore related subjects

Keep this discovery

BibTeXRIS

Maria Loukaki. 2004-12-19. Normal subgroups of odd-order monomial $p^a q^b$ groups. https://arxiv.org/abs/math/0412386

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