feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Cambridge u.a. : Cambridge Univ. Press
    UID:
    b3kat_BV009249124
    Format: XIII, 604 S. , graph. Darst.
    Edition: 1. publ.
    ISBN: 0521432138
    Series Statement: Encyclopedia of mathematics and its applications 48
    Note: Literaturverz. S. [581] - 595
    Language: English
    Subjects: Mathematics
    RVK:
    Keywords: Gruppentheorie ; Algorithmus ; Kombinatorische Gruppentheorie ; Algorithmus ; Endlich darstellbare Gruppe ; Computeralgebra
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Book
    Book
    New York [u.a.] : Wiley
    UID:
    gbv_015352501
    Format: XV, 491 S. , graph. Darst.
    ISBN: 0471098469
    Note: Bibliography: p. 480-481 , Includes index
    Language: English
    Subjects: Mathematics
    RVK:
    RVK:
    Keywords: Universelle Algebra ; Algebraische Struktur ; Datenverarbeitung ; Algebra
    Author information: Sims, Charles C.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Cambridge : Cambridge University Press
    UID:
    gbv_883308290
    Format: 1 Online-Ressource (xiii, 604 pages) , digital, PDF file(s).
    ISBN: 9780511574702
    Series Statement: Encyclopedia of mathematics and its applications volume 48
    Content: 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 Grö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.
    Content: 1. Basic concepts -- 2. Rewriting systems -- 3. Automata and rational languages -- 4. Subgroups of free products of cyclic groups -- 5. Coset enumeration -- 6. The Reidemeister-Schreier procedure -- 7. Generalized automata -- 8. Abelian groups -- 9. Polycyclic groups -- 10. Module bases -- 11. Quotient groups -- Appendix: Implementation issues
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015)
    Additional Edition: ISBN 9780521135078
    Additional Edition: ISBN 9780521432139
    Additional Edition: ISBN 9780521432139
    Additional Edition: ISBN 9780521135078
    Additional Edition: Erscheint auch als Sims, Charles C. Computation with finitely presented groups Cambridge [u.a.] : Cambridge Univ. Press, 1994 ISBN 0521432138
    Additional Edition: Print version ISBN 9780521432139
    Language: English
    Subjects: Mathematics
    RVK:
    Keywords: Gruppentheorie ; Datenverarbeitung ; Endliche Gruppe ; Datenverarbeitung ; Kombinatorische Gruppentheorie ; Datenverarbeitung
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages