Related papers: On finite groups with soluble centralisers

We study groups having the property that every non-cyclic subgroup contains its centralizer. The structure of nilpotent and supersolvable groups in this class is described. We also classify finite $p$-groups and finite simple groups with…

We determine all finite subgroups of simple algebraic groups that have irreducible centralizers - that is, centralizers whose connected component does not lie in a parabolic subgroup.

It is a long-standing open problem raised by Starostin to describe all finite groups with soluble centralizers of involutions. One can observe that if the centralizer fusion system of an involution is nilpotent, then the centralizer of that…

The set of all centralizers of elements in a finite group $G$ is denoted by $Cent(G)$ and $G$ is called $n-$centralizer if $|Cent(G)| = n$. In this paper, the structure of centralizers in a non-abelian finite group $G$ with this property…

In this paper, we consider covers of finite groups by centralizers of elements. We show that the set of centralizers that are maximal under the partial ordering form a cover of the group. We also show that the set of centralizers that are…

We show that for soluble groups of type FPn, centralisers of finite subgroups need not be of type FPn.

A group is called a CA-group if the centralizer of every non-central element is abelian. Furthermore, a group is called a minimal non-CA-group if it is not a CA-group itself, but all of its proper subgroups are. In this paper, we give a…

We study finite groups $G$ with elements $g$ such that $\lvert \mathbf{C}_G(g)\rvert = \lvert G:G' \rvert$. (Such elements generalize fixed-point-free automorphisms of finite groups.) We show that these groups have a unique conjugacy class…

The role of finite centralizers of involutions in pseudo-finite groups is analyzed. It is shown that a pseudo-finite group admitting a definable involutory automorphism fixing only finitely many elements is finite-by-abelian-by-finite. As a…

We show that a profinite group, in which the centralisers of non-trivial elements are metabelian, is either virtually pro-$p$ or virtually soluble of derived length at most 4. We furthermore show that a prosoluble group, in which the…

We show that any pseudofinite group with NIP theory and with a finite upper bound on the length of chains of centralisers is soluble-by-finite. In particular, any NIP rosy pseudofinite group is soluble-by-finite. This generalises, and…

Locally finite groups having the property that every non-cyclic subgroup contains its centralizer are completely classified.

Every finite non-abelian group of order $n$ has a non-central element whose centralizer has order exceeding $n^{1/3}$. The proof does not rely on the classification of finite simple groups, yet it uses the Feit-Thompson theorem.

Suppose that a locally finite group $G$ has a $2$-element $g$ with Chernikov centralizer. It is proved that if the involution in $\langle g\rangle$ has nilpotent centralizer, then $G$ has a soluble subgroup of finite index.

In this paper, we classify conjugacy classes of centralizers of irreducible subgroups in $PSL(n,\mathbb{C})$ using alternate modules a.k.a. finite abelian groups with an alternate bilinear form. When $n$ is squarefree, we prove that these…

In this paper we classify the finite groups satisfying the following property $P_4$: their orders of representatives are set-wise relatively prime for any 4 distinct non-central conjugacy classes.

The subgroup generated by all solvable normal subgroups in a pseudo-finite group with the descending chain condition on centralizers up to finite index is solvable. Additionally, there is no finitely generated pseudo-finite group whose…

We study the class of groups having the property that every non-nilpotent subgroup is equal to its normalizer. These groups are either soluble or perfect. We completely describe the structure of soluble groups and finite perfect groups with…

Given a finite group $G$, the solubilizer of an element $x$, denoted by $\Sol_G(x)$, is the set of all elements $y$ such that $\langle x, y\rangle$ is a soluble subgroup of $G$. In this paper, we provide a classification for all…

We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…