Choose an application
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.
Algorithms. --- Permutation groups. --- Algorism --- Algebra --- Arithmetic --- Substitution groups --- Group theory --- Foundations
Choose an application
The subject of this book is the action of permutation groups on sets associated with combinatorial structures. Each chapter deals with a particular structure: groups, geometries, designs, graphs and maps respectively. A unifying theme for the first four chapters is the construction of finite simple groups. In the fifth chapter, a theory of maps on orientable surfaces is developed within a combinatorial framework. This simplifies and extends the existing literature in the field. The book is designed both as a course text and as a reference book for advanced undergraduate and graduate students. A feature is the set of carefully constructed projects, intended to give the reader a deeper understanding of the subject.
Permutation groups. --- Combinatorial analysis. --- Combinatorics --- Algebra --- Mathematical analysis --- Substitution groups --- Group theory
Choose an application
Algebra --- Topological groups. Lie groups --- Computer science --- Algorithms --- Matrix groups --- Permutation groups --- Substitution groups --- Group theory --- Matrices --- Algorism --- Arithmetic --- Foundations --- Permutation groups. --- Matrix groups. --- Algorithms. --- Groupes de permutations --- Matrices, Groupes de --- Algorithmes --- Groupes de permutations. --- Matrices, Groupes de. --- Algorithmes.
Choose an application
Ordered algebraic structures --- 512 --- Algebra --- 512 Algebra --- Permutation groups. --- Permutation groups --- Groupes de permutations --- Group theory --- Representations of groups. --- Representations of groups --- Représentations de groupes --- Représentations de groupes --- Groupes finis --- Groupes (algebre) --- Representation
Choose an application
Model theory. --- Permutation groups. --- Automorphisms. --- Model theory --- Théorie des modèles --- Groupes de permutations --- Automorphismes --- Permutation groups --- Automorphisms --- Groupes, Théorie des --- Group theory --- Groupes, Théorie des. --- Groupes, Théorie des --- Logique mathématique --- Analyse combinatoire
Choose an application
The subject of this book is the action of permutation groups on sets associated with combinatorial structures. Each chapter deals with a particular structure: groups, geometries, designs, graphs and maps respectively. A unifying theme for the first four chapters is the construction of finite simple groups. In the fifth chapter, a theory of maps on orientable surfaces is developed within a combinatorial framework. This simplifies and extends the existing literature in the field. The book is designed both as a course text and as a reference book for advanced undergraduate and graduate students. A feature is the set of carefully constructed projects, intended to give the reader a deeper understanding of the subject.
Combinatorial analysis. --- Permutation groups. --- Ordered algebraic structures --- Discrete mathematics --- 512.54 --- Combinatorial analysis --- Permutation groups --- Substitution groups --- Group theory --- Combinatorics --- Algebra --- Mathematical analysis --- 512.54 Groups. Group theory --- Groups. Group theory --- Groupes de permutations --- Analyse combinatoire
Choose an application
51 <082.1> --- Mathematics--Series --- Permutation groups. --- Finite simple groups. --- Groupes de permutations --- Groupes simples finis --- Group theory --- Finite simple groups --- Permutation groups --- Substitution groups --- Simple groups, Finite --- Finite groups --- Linear algebraic groups
Choose an application
The book, based on a course of lectures by the authors at the Indian Institute of Technology, Guwahati, covers aspects of infinite permutation groups theory and some related model-theoretic constructions. There is basic background in both group theory and the necessary model theory, and the following topics are covered: transitivity and primitivity; symmetric groups and general linear groups; wreatch products; automorphism groups of various treelike objects; model-theoretic constructions for building structures with rich automorphism groups, the structure and classification of infinite primitive Jordan groups (surveyed); applications and open problems. With many examples and exercises, the book is intended primarily for a beginning graduate student in group theory.
Permutation groups --- Permutatiegroepen --- Permutation [Groupes de ] --- Group theory. --- Group Theory and Generalizations. --- Groups, Theory of --- Substitutions (Mathematics) --- Algebra
Choose an application
These notes present an investigation of a condition similar to Euclid's parallel axiom for subsets of finite sets. The background material to the theory of parallelisms is introduced and the author then describes the links this theory has with other topics from the whole range of combinatorial theory and permutation groups. These include network flows, perfect codes, Latin squares, block designs and multiply-transitive permutation groups, and long and detailed appendices are provided to serve as introductions to these various subjects. Many of the results are published for the first time.
Combinatorial designs and configurations. --- Permutation groups. --- Parallels (Geometry) --- Configurations and designs, Combinatorial --- Designs and configurations, Combinatorial --- Combinatorial analysis --- Geometry --- Geometry, Non-Euclidean --- Substitution groups --- Group theory --- Foundations
Choose an application
Ordered algebraic structures --- Ordered algebraic structures. --- Structures algébriques ordonnées. --- Betweenness relations (Mathematics) --- Automorphisms. --- Automorphismes. --- Permutation groups. --- Groupes de permutations. --- Automorphisms --- Permutation groups --- Substitution groups --- Group theory --- Algebraic structures, Ordered --- Structures, Ordered algebraic --- Algebra --- B-sets --- Between relations (Mathematics) --- Betweenness (Mathematics) --- Intermediacy (Mathematics) --- Relations of between (Mathematics) --- Relations of betweenness (Mathematics) --- Relations related to betweenness (Mathematics) --- Set theory --- Symmetry (Mathematics)