Pulse en una miniatura para ir a Google Books.
Cargando... Computation with Finitely Presented Groupspor Charles C. Sims
Ninguno Cargando...
Inscríbete en LibraryThing para averiguar si este libro te gustará. Actualmente no hay Conversaciones sobre este libro. Ninguna reseña sin reseñas | añadir una reseña
Pertenece a las series
Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gro?bner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theoretical computer scientists will find this book useful. No se han encontrado descripciones de biblioteca. |
Debates activosNinguno
Google Books — Cargando... GénerosSistema Decimal Melvil (DDC)512.2Natural sciences and mathematics Mathematics Algebra Groups and groups theoryClasificación de la Biblioteca del CongresoValoraciónPromedio: No hay valoraciones.¿Eres tú?Conviértete en un Autor de LibraryThing. |