SearcharxivSearch

arXiv · 2109.10530

Characterizations of some groups in terms of centralizers

Abstract

A group $G$ is said to be $n$-centralizer if its number of element centralizers $\mid \Cent(G)\mid=n$, an F-group if every non-central element centralizer contains no other element centralizer and a CA-group if all non-central element centralizers are abelian. For any non-abelian $n$-centralizer group $G$, we prove that $\mid \frac{G}{Z(G)}\mid \leq (n-2)^2$, if $n \leq 12$ and $\mid \frac{G}{Z(G)}\mid \leq 2(n-4)^{{log}_2^{(n-4)}}$ otherwise, which improves an earlier result. We prove that if $G$ is an arbitrary non-abelian $n$-centralizer F-group, then gcd$(n-2, \mid \frac{G}{Z(G)}\mid) \neq 1$. For a finite F-group $G$, we show that $\mid \Cent(G)\mid \geq \frac{\mid G \mid}{2}$ iff $G \cong A_4 $, an extraspecial $2$-group or a Frobenius group with abelian kernel and complement of order $2$. Among other results, for a finite group $G$ with non-trivial center, it is proved that $\mid \Cent(G)\mid = \frac{\mid G \mid }{2}$ iff $G$ is an extraspecial $2$-group. We give a family of F-groups which are not CA-groups and extend an earlier result.

Explore related subjects

Keep this discovery

BibTeXRIS

Sekhar Jyoti Baishya. 2021-09-22. Characterizations of some groups in terms of centralizers. https://arxiv.org/abs/2109.10530

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