Matches in Harvard for { <http://id.lib.harvard.edu/aleph/002404777/catalog> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- catalog abstract ""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."--PUBLISHER'S WEBSITE.".
- catalog contributor b3463506.
- catalog created "1992.".
- catalog date "1992".
- catalog date "1992.".
- catalog dateCopyrighted "1992.".
- catalog description ""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."--PUBLISHER'S WEBSITE.".
- catalog description "Includes bibliographical references and indexes.".
- catalog extent "xii, 238 p.".
- catalog identifier "0387549552".
- catalog isPartOf "Lecture notes in computer science ; 559".
- catalog issued "1992".
- catalog issued "1992.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer-Verlag,".
- catalog subject "512/.2 20".
- catalog subject "Algorithms.".
- catalog subject "Permutation groups.".
- catalog subject "QA175 .B88 1992".
- catalog title "Fundamental algorithms for permutation groups / G. Butler.".
- catalog type "text".