SearcharxivSearch

arXiv · 1404.0873

On the Exponent of the Schur multiplier of a Pair of Finite $p$-Groups

Abstract

In this paper, we find an upper bound for the exponent of the Schur multiplier of a pair $(G,N)$ of finite $p$-groups, when $N$ admits a complement in $G$. As a consequence, we show that the exponent of the Schur multiplier of a pair $(G,N)$ divides $\exp(N)$ if $(G,N)$ is a pair of finite $p$-groups of class at most $p-1$. We also prove that if $N$ is powerfully embedded in $G$, then the exponent of the Schur multiplier of a pair $(G,N)$ divides $\exp(N)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Fahimeh Mohammadzadeh, Azam Hokmabadi, Behrooz Mashayekhy. 2014-04-03. On the Exponent of the Schur multiplier of a Pair of Finite $p$-Groups. https://arxiv.org/abs/1404.0873

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