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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Vintage Books and Fine Art, Oxford, MD, U.S.A.
Paperback. Condizione: Very Good. Condizione sovraccoperta: 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. Codice articolo 10671
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783540549550_new
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
PF. Condizione: New. Codice articolo 6666-IUK-9783540549550
Quantità: 10 disponibili
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Paperback. Condizione: 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. Codice articolo LU-9783540549550
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783540549550
Quantità: 2 disponibili
Da: moluna, Greven, Germania
Condizione: 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. Codice articolo 4893391
Quantità: Più di 20 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783540549550
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783540549550
Quantità: 1 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: 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. Codice articolo 102135779
Quantità: 5 disponibili
Da: Rarewaves.com UK, London, Regno Unito
Paperback. Condizione: New. 1991st. Codice articolo LU-9783540549550
Quantità: Più di 20 disponibili