Limone Time
Computation with finitely presented groups

Computation with finitely presented groups

Libro (1994)

Research in computational group theory, an active subfield of computational algebra, has emphasized four areas: finite permutation groups, finite solvable groups, matrix representations of finite groups, and finitely presented groups. This book deals with the last of these areas. It is the first text to present the fundamental algorithmic ideas which have been developed to compute with finitely presented groups that are infinite, or at least not obviously finite. The work of Baumslag, Cannonito, and Miller on computing nonabelian polycyclic quotients is described as a generalization of Buchberger's Grobner 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.

Generi
Group theory, Finite groups, Combinatorial group theory, Data processing, Combinatorial analysis
Autore
Charles C. Sims
Pagine
622

Dove trovarlo

Amazon ↗

Alcuni collegamenti sono di affiliazione: se acquisti, il sito può ricevere una commissione, senza costi in più per te.

Non sai cosa scegliere?

Dimmi i tuoi gusti e ti propongo cosa leggere, in base a quello che ti piace.

Provalo gratis

Titoli simili

The Block Theory of Finite Group Algebras (2018)Galois theory (1942)Extraordinary groups (1976)Lehrbuch der Algebra (1895)Geometric Methods In Physics (2012)Generators and relations for discrete groups (1957)Cohomologie galoisienne (1964)Traité d'analyse (1891)