Fundamental algorithms for permutation groups
This is the first-ever book on computational group theory. It provides extensive and up-to-date coverage of the fundamental algorithms for permutation groups with reference to aspects of combinatorial group theory, soluble groups, and p-groups where appropriate. The book begins with a constructive i...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
559 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Fundamental algorithms for permutation groups, G. Butler, 1991, Berlin, Springer-Verlag, 1 vol. (XII-238 p.), Lecture notes in computer science, 3-540-54955-2 • Fundamental Algorithms for Permutation Groups, Texte imprimé, 9783662162156 |
Taula de continguts:
- Group theory background
- List of elements
- Searching small groups
- Cayley graph and defining relations
- Lattice of subgroups
- Orbits and schreier vectors
- Regularity
- Primitivity
- Inductive foundation
- Backtrack search
- Base change
- Schreier-Sims method
- Complexity of the Schreier-Sims method
- Homomorphisms
- Sylow subgroups
- P-groups and soluble groups
- Soluble permutation groups
- Some other algorithms.