Conjugacy in Finite Classical Groups

• Verfasst von: De Franceschi, Giovanni [VerfasserIn]
• Verfasst von: Liebeck, Martin W. [VerfasserIn]
• Verfasst von: O'Brien, Eamonn A. [VerfasserIn]
• Titel: Conjugacy in Finite Classical Groups
• Verf.angabe: by Giovanni De Franceschi, Martin W. Liebeck, Eamonn A. O'Brien
• Ausgabe: 1st ed. 2025.
• Verlagsort: Cham
• Verlagsort: Cham
• Verlag: Springer Nature Switzerland
• Verlag: Imprint: Springer
• E-Jahr: 2025
• Jahr: 2025.
• Jahr: 2025.
• Umfang: 1 Online-Ressource(XI, 176 p.)
• Gesamttitel/Reihe: Springer Monographs in Mathematics
• ISBN: 978-3-031-86461-2
• DOI: doi:10.1007/978-3-031-86461-2
• Datenträger: Online-Ressource
• Sprache: eng
• Bibliogr. Hinweis: Erscheint auch als : Druck-Ausgabe
• Bibliogr. Hinweis: Erscheint auch als : Druck-Ausgabe
• Bibliogr. Hinweis: Erscheint auch als : Druck-Ausgabe
• K10plus-PPN: 1925486281
• K10plus-PPN:
  Universitätsbibliothek
• Lokale URL UB: Zum Volltext

Abstract

- 1. Introduction and Background -- 2. General and Special Linear Groups -- 3. Preliminaries on Classical Groups -- 4. Unipotent Classes in Good Characteristic -- 5. Unipotent Classes in Bad Characteristic -- 6. Semisimple Classes -- 7. General Conjugacy Classes.

Abstract

This book provides a comprehensive coverage of the theory of conjugacy in finite classical groups. Given such a classical group G, the three fundamental problems considered are the following: to list a representative for each conjugacy class of G; to describe the centralizer of each representative, by giving its group structure and a generating set; and to solve the conjugacy problem in G—namely, given two elements of G, establish whether they are conjugate, and if so, find a conjugating element. The book presents comprehensive theoretical solutions to all three problems, and uses these solutions to formulate practical algorithms. In parallel to the theoretical work, implementations of these algorithms have been developed in Magma. These form a critical component of various general algorithms in computational group theory—for example, computing character tables and solving conjugacy problems in arbitrary finite groups.