Artículos relacionados a Fundamental Algorithms for Permutation Groups: 559...
Fundamental Algorithms for Permutation Groups: 559 (Lecture Notes in Computer Science) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 57,11
EUR 7,67 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoResultados de la búsqueda para Fundamental Algorithms for Permutation Groups: 559...
Imagen de archivo
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)
Librería: Grey Matter Books, Hadley, MA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Soft cover. Condición: VG+. VG+ softcover. Nº de ref. del artículo: 054973
Cantidad disponible: 1 disponibles
Imagen de archivo
Fundamental Algorithms for Permutation Groups
Publicado por
Springer-Verlag, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
Antiguo o usado
Soft cover
Librería: Moe's Books, Berkeley, CA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Soft cover. Condición: 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. Nº de ref. del artículo: 1140711
Cantidad disponible: 1 disponibles
Imagen de archivo
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)
Librería: Vintage Books and Fine Art, Oxford, MD, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Very Good. Estado de la sobrecubierta: 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. Nº de ref. del artículo: 10671
Cantidad disponible: 1 disponibles
Imagen de archivo
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science, 559)
Librería: Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9783540549550
Cantidad disponible: 2 disponibles
Imagen de archivo
Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science, 559)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540549550_new
Gastos de envío:
EUR 13,84
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Fundamental Algorithms for Permutation Groups
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540549550
Gastos de envío:
EUR 17,90
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 10 disponibles
Imagen del vendedor
Fundamental Algorithms for Permutation Groups
Publicado por
Springer Berlin Heidelberg Nov 1991, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540549550
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles
Imagen del vendedor
Fundamental Algorithms for Permutation Groups
Publicado por
Springer Berlin Heidelberg, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 4893391
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Fundamental Algorithms for Permutation Groups
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 1991, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540549550
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles
Imagen del vendedor
Fundamental Algorithms for Permutation Groups
Publicado por
Springer Berlin Heidelberg, 1991
ISBN 10: 3540549552
ISBN 13: 9783540549550
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540549550
Gastos de envío:
EUR 61,97
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles