Computation with Finitely Presented Grou

Forfatter

Kort om boken

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 aut…

Oppdag mer

Velg tagger...
Spar {0}
Spar {0} som ARK-VENN
{0} til nettpris
med Klikk&Hent
Format/språk (2 forskjellige)
   Klikk og hent - få varen innen 2 timer*
   Alltid bytterett - Norges beste. Bytt uten kvittering.
* Gjelder varer på lager i butikk

    Om Computation with Finitely Presented Grou

    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 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.

    Kundevurderinger

    Totalvurdering: 

    Gi din vurdering: 
    Totalvurdering: 

    Detaljer

    Format
    E-Bok
    Filformat
    PDF
    Utgivelsesår
    1994
    Forlag
    Cambridge University Press
    Språk
    Engelsk
    ISBN
    9781139886413

    Anbefalt