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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Giovanni De Franceschi currently works as a software developer in Verona. He completed a PhD in mathematics at the University of Auckland in 2018; some of this work formed part of his PhD thesis.
Martin W. Liebeck has been a professor at Imperial College London since 1991, and was Head of Pure Mathematics there between 1997 and 2024. He has published about 170 articles and books on finite and algebraic groups, representation theory, probabilistic group theory, and applications of these topics to areas such as model theory in logic, Markov theory in probability, combinatorics, and the design of algorithms in computational algebra. Liebeck is a Fellow of the American Mathematical Society, and was the recipient of the London Mathematical Society's Polya Prize in 2020. Eamonn A. O'Brien is a professor at the University of Auckland since 2006. His research interests are in group theory and computational algebra, with a particular focus on the development and implementation of effective algorithms and their application to solving related challenging problems. He has published about 100 research papers and is a coauthor of the "Handbook of Computational Group Theory." Many of his research outputs are incorporated into the leading computational algebra systems GAP and Magma. Elected a Fellow of the Royal Society of New Zealand in 2009 and awarded its 2020 Hector Medal, he is a recipient of a 2024 Humboldt Foundation Research Award.Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur RA6EUTAFZN
Quantité disponible : Plus de 20 disponibles
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Hardcover. Etat : new. Hardcover. 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 Gnamely, 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 theoryfor example, computing character tables and solving conjugacy problems in arbitrary finite 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; and to solve the conjugacy problem in Gnamely, given two elements of G, establish whether they are conjugate, and if so, find a conjugating element. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9783031864605
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 188 pp. Englisch. N° de réf. du vendeur 9783031864605
Quantité disponible : 2 disponible(s)
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Hardcover. Etat : new. Hardcover. 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 Gnamely, 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 theoryfor example, computing character tables and solving conjugacy problems in arbitrary finite 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; and to solve the conjugacy problem in Gnamely, given two elements of G, establish whether they are conjugate, and if so, find a conjugating element. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9783031864605
Quantité disponible : 1 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26404007442
Quantité disponible : 4 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Buch. Etat : Neu. Conjugacy in Finite Classical Groups | Giovanni De Franceschi (u. a.) | Buch | Springer Monographs in Mathematics | xi | Englisch | 2025 | Springer | EAN 9783031864605 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. N° de réf. du vendeur 132637208
Quantité disponible : 5 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 Gnamely, 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 theoryfor example, computing character tables and solving conjugacy problems in arbitrary finite groups.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 188 pp. Englisch. N° de réf. du vendeur 9783031864605
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand. N° de réf. du vendeur 409146829
Quantité disponible : 4 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 187 pages. 9.25x6.10x9.49 inches. In Stock. N° de réf. du vendeur x-3031864603
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783031864605
Quantité disponible : 1 disponible(s)