Articoli correlati a Fundamental Algorithms for Permutation Groups: 559
Sinossi
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.
Contenuti
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.
Compra nuovo
Visualizza questo articolo
EUR 57,15
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiRisultati della ricerca per Fundamental Algorithms for Permutation Groups: 559
Foto dell'editore
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)
Da: Grey Matter Books, Hadley, MA, U.S.A.
Valutazione del venditore 4 su 5 stelle
Soft cover. Condizione: VG+. VG+ softcover. Codice articolo 054973
Quantità: 1 disponibili
Immagini fornite dal venditore
Fundamental Algorithms for Permutation Groups
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
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
Immagini fornite dal venditore
Fundamental Algorithms for Permutation Groups
Editore:
Springer Berlin Heidelberg Nov 1991, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
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
Foto dell'editore
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science, 559)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540549550_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Fundamental Algorithms for Permutation Groups
Editore:
Springer Berlin Heidelberg, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
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 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 9783540549550
Quantità: 1 disponibili
Immagini fornite dal venditore
Fundamental Algorithms for Permutation Groups
ISBN 10: 3540549552
ISBN 13: 9783540549550
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783540549550
Quantità: 2 disponibili
Foto dell'editore
Fundamental Algorithms for Permutation Groups
Da: Moe's Books, Berkeley, CA, U.S.A.
Valutazione del venditore 4 su 5 stelle
Soft cover. Condizione: 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. Codice articolo 1140711
Quantità: 1 disponibili
Foto dell'editore
Fundamental Algorithms for Permutation Groups
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9783540549550
Quantità: 10 disponibili
Foto dell'editore
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)
Da: Vintage Books and Fine Art, Oxford, MD, U.S.A.
Valutazione del venditore 4 su 5 stelle
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
Foto dell'editore
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science, 559)
Da: BennettBooksLtd, North Las Vegas, NV, U.S.A.
Valutazione del venditore 5 su 5 stelle
paperback. Condizione: New. In shrink wrap. Looks like an interesting title! Codice articolo Q-3540549552
Quantità: 1 disponibili