An improved method for generating the centralizer of an involution
From MaRDI portal
The author compares two methods of computation of the centralizer of an involution in a finite group: the first is due to R. Parker and \textit{S. Norton} [Santa Cruz Conf. 1979, Proc. Symp. Pure Math. 37, 271-277 (1980; Zbl 0448.20018)] and the second to the author. In particular, the author illustrates his method by proving the following result: The group \(\langle x,y\mid x^2=y^7=(xy)^{11}=[x,y]^2=[x,y^2]^3=[x,y^3]^3=1\rangle\) is isomorphic to \(2^2\cdot U_6(2)\).
Recommendations
- A note on computing involution centralizers.
- Finite groups with involution whose centralizer has a quotient group isomorphic with \({\mathcal L}_ 2(2^ n)\)
- On the construction of the finite simple groups with a given centralizer of a 2-central involution
- On the uniqueness of the finite simple groups with a given centralizer of a 2-central involution
- A note on involution centralizers in black box groups
Cited in
(38)- Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
- A new method for recognising Suzuki groups
- Strong involutions in finite special linear groups of odd characteristic
- Sporadic simple groups which are completions of the Goldschmidt G₃-amalgam
- Odd order products of conjugate involutions in linear groups over \(\mathrm{GF}(2^a)\)
- Generators for maximal subgroups of Conway group \(\mathrm{Co}_1\)
- The Hall-Paige conjecture, and synchronization for affine and diagonal groups
- Involution centralisers in finite unitary groups of odd characteristic
- A note on involution centralizers in black box groups
- Constructive recognition of classical groups in even characteristic.
- Constructive recognition of \(\text{SL}_3(q)\).
- Commuting involution graphs for sporadic simple groups.
- Explicit representations of maximal subgroups of the Monster.
- Lengths of involutions in finite Coxeter groups
- Recognition of finite exceptional groups of Lie type.
- Regular semisimple elements and involutions in finite general linear groups of odd characteristic.
- Black box exceptional groups of Lie type.
- Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
- Finding involutions with small support.
- Every in the Monster contains -elements
- A note on computing involution centralizers.
- Recognising the small Ree groups in their natural representations.
- Conjugacy classes in sporadic simple groups
- Black box groups isomorphic to \(\mathrm{PGL}(2,2^e)\).
- On products of involutions in finite groups of Lie type in even characteristic.
- Effective black-box constructive recognition of classical groups.
- Black box exceptional groups of Lie type. II.
- A practical model for computation with matrix groups.
- Completing the Brauer Trees for the Sporadic Simple Lyons Group
- Maximal subgroups of sporadic groups
- Classification of subgroups isomorphic to \(\mathrm{PSL}_2(27)\) in the Monster.
- The maximal subgroups of \(E_7(2)\).
- Involutions in Conway's Largest Simple Group
- Finding 47:23 in the Baby Monster
- Recognising simplicity of black-box groups by constructing involutions and their centralisers.
- The maximal subgroups of the monster
- Constructive recognition of classical groups in odd characteristic.
- On subgroups of the Monster containing A₅'s.
This page was built for publication: An improved method for generating the centralizer of an involution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1568655)
