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...
সংরক্ষণ করুন:
| প্রধান লেখক: | |
|---|---|
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| মালা: | Lecture notes in computer science
559 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| টীকা: |
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 |
| LEADER | 03702nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 943735 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155163515 | ||
| 020 | |a 9783540466079 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 512.2 | ||
| 100 | 1 | |a Butler, Gregory, |d 1953- | |
| 245 | 1 | 0 | |a Fundamental algorithms for permutation groups |c G. Butler. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 559 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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 introduction to group theory and algorithms for computing with small groups, followed by a gradual discussion of the basic ideas of Sims for computing with very large permutation groups, and concludes with algorithms that use group homomorphisms, as in the computation of Sylowsubgroups. No background in group theory is assumed. The emphasis is on the details of the data structures and implementation which makes the algorithms effective when applied to realistic problems. The algorithms are developed hand-in-hand with the theoretical and practical justification.All algorithms are clearly described, examples are given, exercises reinforce understanding, and detailed bibliographical remarks explain the history and context of the work. Much of the later material on homomorphisms, Sylow subgroups, and soluble permutation groups is new. | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Groupes de permutations | ||
| 650 | |a Groupes, Théorie des | ||
| 776 | 0 | |0 02235445X |t Fundamental algorithms for permutation groups |f G. Butler |d 1991 |c Berlin |n Springer-Verlag |p 1 vol. (XII-238 p.) |s Lecture notes in computer science |z 3-540-54955-2 | |
| 776 | 0 | |t Fundamental Algorithms for Permutation Groups |b Texte imprimé |z 9783662162156 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-54955-2 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-TW7VBFG8-V |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747925577 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-54955-2 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750937688 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-54955-2 |z Accès INSA CVL | |
| 997 | |0 943735 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||