Synopsis
Permutation group algorithms are indispensable in the proofs of many deep results, including the construction and study of sporadic finite simple groups. This work describes the theory behind permutation group algorithms, up to the most recent developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. The book fills a significant gap in the symbolic computation literature for readers interested in using computers in group theory.
"synopsis" may belong to another edition of this title.
Book Description
Permutation group algorithms played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, up to the most recent developments. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.
Review
"This book provides a virtually complete state-of-the-art account of algorithms for computing with finite permutation groups. Almost all of the algorithms described are accompanied by complete and detailed correctness proofs and complexity analyses. It is very clearly written throughout, and is likely to become the standard and definitive reference work in the field." Mathematical Reviews
"About this title" may belong to another edition of this title.
Search results for Permutation Group Algorithms (Cambridge Tracts in Mathematic...
Seller Image
Permutation group algorithms Ákos Seress. Cambridge tracts in mathematics 152.
Published by
Cambridge, Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Used
Hardcover
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Seller rating 5 out of 5 stars
Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 20 SER 9780521661034 Sprache: Englisch Gewicht in Gramm: 550. Seller Inventory # 2506882
Buy Used
US$ 84.46
US$ 18.75 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Permutation group algorithms Ákos Seress. Cambridge tracts in mathematics 152.
Published by
Cambridge, Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Used
Hardcover
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Seller rating 5 out of 5 stars
Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 20 SER 9780521661034 Sprache: Englisch Gewicht in Gramm: 550. Seller Inventory # 2498843
Buy Used
US$ 84.46
US$ 18.75 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Permutation group algorithms.
Seller: Emile Kerssemakers ILAB, Heerlen, Netherlands
Seller rating 5 out of 5 stars
23 cm. original cloth. 264 pp. bibliography. index. "Cambridge Tracts in Mathematics". -(libr label, library stamps, otherwise (very) good). 525g. Seller Inventory # 72851
Buy Used
US$ 84.47
US$ 51.55 shipping
Ships from Netherlands to U.S.A.
Ships from Netherlands to U.S.A.
Quantity: 1 available
Seller Image
Permutation Group Algorithms
Published by
Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
New
Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 963973-n
Stock Image
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Published by
Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
New
Hardcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2416190011309
Stock Image
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Published by
Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
New
Hardcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521661034
Stock Image
Permutation Group Algorithms (Hardcover)
Published by
Cambridge University Press, Cambridge, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
New
Hardcover
First Edition
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, up to the most recent developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses. Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, and includes hints for implementation and advanced exercises. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521661034
Stock Image
Permutation Group Algorithms
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 1st edition. 300 pages. 9.25x6.25x1.00 inches. In Stock. This item is printed on demand. Seller Inventory # __052166103X
Buy New
US$ 174.93
US$ 16.72 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Permutation Group Algorithms
Published by
Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
New
Hardcover
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 963973-n
Buy New
US$ 180.45
US$ 20.07 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Permutation Group Algorithms
Published by
Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
New
Hardcover
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 559. Seller Inventory # C9780521661034
Buy New
US$ 180.47
US$ 21.86 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available