Search arXivSearch

arXiv · 1311.2608

Some restrictions on normalizers or centralizers in finite p-groups

Abstract

We study three restrictions on normalizers or centralizers in finite p-groups, namely: (i) |N_G(H) : H| <= p^k for every H non-normal in G, (ii) |N_G( ) : | <= p^k for every non-normal in G, and (iii) |C_G(g) : | <= p^k for every non-normal in G. We prove that (i) and (ii) are equivalent, and that the order of a non-Dedekind finite p-group satisfying any of these three conditions is bounded for p>2. More precisely, we get the best possible bound for the order of G in all three cases, which is |G| <= p^{2k+2}. The order of the group cannot be bounded for p=2, but we are able to identify two infinite families of 2-groups out of which |G| <= 2^{f(k)} for some function f(k) depending only on k.

Explore related subjects

Keep this discovery

BibTeXRIS

Gustavo A. Fernandez-Alcober, Leire Legarreta, Antonio Tortora, Maria Tota. 2013-11-11. Some restrictions on normalizers or centralizers in finite p-groups. https://arxiv.org/abs/1311.2608

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