Permutation Group Algorithms by Kos Seress
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, including 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.-
The Geometry of Fractal Sets
-
Riemannian Geometry
-
Miniquaternion Geometry
-
The Geometry of Total Curvature on Complete Open Surfaces
-
Metric Spaces
-
Birational Geometry and Manin's Conjecture
-
Coherence in Three-Dimensional Category Theory
-
Dilation and Model Theory for Pairs of Commuting Contraction Operators
-
The Direct Method in Soliton Theory
-
Matrix Positivity
-
Rigidity in Higher Rank Abelian Group Actions: Volume 1, Introduction and Cocycle Problem
-
Topics in Critical Point Theory
-
Category and Measure
-
The Mathieu Groups
-
Modern Approaches to the Invariant-Subspace Problem
-
Frobenius Manifolds and Moduli Spaces for Singularities
-
Group Cohomology and Algebraic Cycles
-
Nonlinear Perron–Frobenius Theory
-
Abelian Varieties, Theta Functions and the Fourier Transform
-
Matrices of Sign-Solvable Linear Systems
-
The Cube-A Window to Convex and Discrete Geometry
-
The Large Sieve and its Applications
-
Combinatorics of Minuscule Representations
-
Polynomials and Vanishing Cycles
-
Restricted Orbit Equivalence for Actions of Discrete Amenable Groups
-
Metric Diophantine Approximation on Manifolds
-
Applications of Diophantine Approximation to Integral Points and Transcendence
-
An Introduction to Homotopy Theory
-
Linear and Projective Representations of Symmetric Groups
-
Dependence with Complete Connections and its Applications
-
Fixed Point Theory and Applications
-
Justification Logic
-
Synthetic Geometry of Manifolds
-
Dynamical Systems and Semisimple Groups
-
Distribution Modulo One and Diophantine Approximation
-
The Levy Laplacian
-
Sets of Multiples
-
Period Domains over Finite and p-adic Fields
-
Large Deviations for Markov Chains
-
Levy Processes in Lie Groups
-
Character Sums with Exponential Functions and their Applications
-
Poincare Duality Algebras, Macaulay's Dual Systems, and Steenrod Operations
-
Quasi-Frobenius Rings
-
The Covering Property Axiom, CPA
-
Ridge Functions
-
Jordan Structures in Geometry and Analysis
-
Typical Dynamics of Volume Preserving Homeomorphisms
'The book will be an invaluable tool for anyone who is interested in permutation groups, computational group theory or the broader area of computations involving symmetries and deserves a space on the shelf of any researcher in these areas' Zentralblatt für Mathematik
'… this monograph by Akos Seress, one of the leaders in the field, is a welcome contribution. … the monograph is welcome not only for giving us an encyclopaedic account of the area, but also for its timeliness. A good author of a good book stamps his or her tastes and expertise firmly on the pages. That is what has happened here. In particular, because it should be of lasting value, it is a very appropriate addition to the Cambridge Tracts.' Peter M. Neumann, The Queen's College, Oxford
'… this monograph by Akos Seress, one of the leaders in the field, is a welcome contribution. … the monograph is welcome not only for giving us an encyclopaedic account of the area, but also for its timeliness. A good author of a good book stamps his or her tastes and expertise firmly on the pages. That is what has happened here. In particular, because it should be of lasting value, it is a very appropriate addition to the Cambridge Tracts.' Peter M. Neumann, The Queen's College, Oxford
| SKU | Unavailable |
| ISBN 13 | 9780521661034 |
| ISBN 10 | 052166103X |
| Title | Permutation Group Algorithms |
| Author | Kos Seress |
| Series | Cambridge Tracts In Mathematics |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 2003-03-17 |
| Number of pages | 274 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |