The probability that two elements of a group have the same centralizers
The authors study the probability, denoted \(\mathcal{PC}(G)\), that two randomly chosen elements of a finite group \(G\) have the same centralizer. They introduce the \textit{same-cent degree} of a group and establish general upper and lower bounds for \(\mathcal{PC}(G)\) in terms of \(|G : Z(G)|\) and the smallest prime divisor of \(|G|\) (Theorem 1.1). Furthermore, they analyze the relation between \(\mathcal{PC}(G)\) and the commutativity degree \(\pi_a(G)\), obtaining structural implications for various classes of groups, including AC-groups and \(p\)-groups. Several explicit computations of \(\mathcal{PC}(G)\) are given for dihedral and semi-dihedral groups, as well as for finite \(p\)-groups of small order.
- Addendum to ``Subgroup commutativity degrees of finite groups.
- Bounds for the index of the centre in capable groups
- Criteria for the solubility of finite groups by their centralizers.
- Derived length and centralizers of groups.
- Non-commuting graph of a group.
- On Finite Groups with Given Conjugate Types I
- On solubility of groups with finitely many centralizers.
- Subgroup commutativity degrees of finite groups.
- The probability of generating a nilpotent subgroup of a finite group
- Two Combinatorial Problems in Group Theory
- What is the Probability that Two Group Elements Commute?
This page was built for publication: The probability that two elements of a group have the same centralizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977736)
