Items related to Fundamental Algorithms for Permutation Groups (Lecture...
Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for Fundamental Algorithms for Permutation Groups (Lecture...
Stock Image
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)
Seller: Grey Matter Books, Hadley, MA, U.S.A.
Seller rating 4 out of 5 stars
Soft cover. Condition: VG+. VG+ softcover. Seller Inventory # 054973
Quantity: 1 available
Stock Image
Fundamental Algorithms for Permutation Groups
Seller: Moe's Books, Berkeley, CA, U.S.A.
Seller rating 4 out of 5 stars
Soft cover. Condition: Very good. No jacket. Cover is in excellent condition with no visible flaws apart from minor handling wear. Spine is creased, but binding is secure. Inside is clean and unmarked. Seller Inventory # 1140711
Quantity: 1 available
Stock Image
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)
Seller: Vintage Books and Fine Art, Oxford, MD, U.S.A.
Seller rating 4 out of 5 stars
Paperback. Condition: Very Good. Dust Jacket Condition: Jacket not issued. Square Tight Binding.Clean interior, save for small p/o signature to top of front end paper. Very mild edge wear to wraps. A superior edition. Seller Inventory # 10671
Quantity: 1 available
Stock Image
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science, 559)
Seller: Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9783540549550
Quantity: 1 available
Stock Image
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science, 559)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540549550_new
Quantity: Over 20 available
Stock Image
Fundamental Algorithms for Permutation Groups
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540549550
Quantity: 10 available
Seller Image
Fundamental Algorithms for Permutation Groups
Published by
Springer Berlin Heidelberg Nov 1991, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This is the first-ever book on computational group theory.It provides extensive and up-to-date coverage of thefundamental algorithms for permutation groups with referenceto aspects of combinatorial group theory, soluble groupsand p-groups where appropriate.The book begins with a constructive introduction to grouptheory and algorithms for computing with small groupsfollowed by a gradual discussion of the basic ideas of Simsfor computing with very large permutation groups, andconcludes with algorithms that use group homomorphisms, asin the computation of Sylowsubgroups. No background ingroup theory is assumed.The emphasis is on the details of the data structures andimplementation which makes the algorithms effective whenapplied to realistic problems. The algorithms are developedhand-in-hand with the theoretical and practicaljustification.All algorithms are clearly describedexamples are given, exercises reinforce understanding, anddetailed bibliographical remarks explain the history andcontext of the work.Much of the later material on homomorphisms, Sylowsubgroups, and soluble permutation groups is new. 256 pp. Englisch. Seller Inventory # 9783540549550
Quantity: 2 available
Seller Image
Fundamental Algorithms for Permutation Groups
Published by
Springer Berlin Heidelberg, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This is the first-ever book on computational group theory.It provides extensive and up-to-date coverage of thefundamental algorithms for permutation groups with referenceto aspects of combinatorial group theory, soluble groups,and p-groups wher. Seller Inventory # 4893391
Quantity: Over 20 available
Seller Image
Fundamental Algorithms for Permutation Groups
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 1991, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware -This is the first-ever book on computational group theory.It provides extensive and up-to-date coverage of thefundamental algorithms for permutation groups with referenceto aspects of combinatorial group theory, soluble groupsand p-groups where appropriate.The book begins with a constructive introduction to grouptheory and algorithms for computing with small groupsfollowed by a gradual discussion of the basic ideas of Simsfor computing with very large permutation groups, andconcludes with algorithms that use group homomorphisms, asin the computation of Sylowsubgroups. No background ingroup theory is assumed.The emphasis is on the details of the data structures andimplementation which makes the algorithms effective whenapplied to realistic problems. The algorithms are developedhand-in-hand with the theoretical and practicaljustification.All algorithms are clearly describedexamples are given, exercises reinforce understanding, anddetailed bibliographical remarks explain the history andcontext of the work.Much of the later material on homomorphisms, Sylowsubgroups, and soluble permutation groups is new.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 256 pp. Englisch. Seller Inventory # 9783540549550
Quantity: 2 available
Seller Image
Fundamental Algorithms for Permutation Groups
Published by
Springer Berlin Heidelberg, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This is the first-ever book on computational group theory.It provides extensive and up-to-date coverage of thefundamental algorithms for permutation groups with referenceto aspects of combinatorial group theory, soluble groups,and p-groups where appropriate.The book begins with a constructive introduction to grouptheory and algorithms for computing with small groups,followed by a gradual discussion of the basic ideas of Simsfor computing with very large permutation groups, andconcludes with algorithms that use group homomorphisms, asin the computation of Sylowsubgroups. No background ingroup theory is assumed.The emphasis is on the details of the data structures andimplementation which makes the algorithms effective whenapplied to realistic problems. The algorithms are developedhand-in-hand with the theoretical and practicaljustification.All algorithms are clearly described,examples are given, exercises reinforce understanding, anddetailed bibliographical remarks explain the history andcontext of the work.Much of the later material on homomorphisms, Sylowsubgroups, and soluble permutation groups is new. Seller Inventory # 9783540549550
Quantity: 1 available