Fundamental Algorithms Permutation Groups by Butler (14 results)

Condition: Good. Volume 559. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:0387549552.

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.

Condition: New. In.

Paperback. Condition: New. 1991 ed. 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.

PF. Condition: New.

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 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.

Taschenbuch. Condition: Neu. Fundamental Algorithms for Permutation Groups | Gregory Butler | Taschenbuch | xii | Englisch | 1991 | Springer | EAN 9783540549550 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Condition: New. 1991st.

paperback. Condition: New. In shrink wrap. Looks like an interesting title!

paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Couverture souple. Condition: Bon. Edition originale. Springer, Lectures notes in computer science (559), 1991. In-8 broché, XII+238pp. Bon exemplaire.

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.

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.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This is the first-ever book on computational group theory. It covers the fundamental algorithms for permutation groups, with emphasis on the details of data structures and implementation which make the algorithms effective when applied to realistic problems.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 256 pp. Englisch.