2000 character limit reached
On the Exponent of the Schur multiplier of a Pair of Finite $p$-Groups
Published 3 Apr 2014 in math.GR | (1404.0873v1)
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)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.