0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (1)
  • R2,500 - R5,000 (1)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Computation with Finitely Presented Groups (Paperback): Charles C. Sims Computation with Finitely Presented Groups (Paperback)
Charles C. Sims
R2,083 Discovery Miles 20 830 Ships in 12 - 17 working days

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

Computation with Finitely Presented Groups (Hardcover): Charles C. Sims Computation with Finitely Presented Groups (Hardcover)
Charles C. Sims
R4,701 Discovery Miles 47 010 Ships in 12 - 17 working days

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

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
The Critical Review, Or, Annals of…
Tobias George Smollett Paperback R767 Discovery Miles 7 670
The Love Song Of Andre P. Brink - A…
Leon De Kock Paperback  (1)
R460 Discovery Miles 4 600
Study Guide with Solutions Manual for…
John E McMurry Paperback R1,555 R1,427 Discovery Miles 14 270
Where Does My Dog Hurt - Find the Source…
Renee Tucker Paperback R742 R667 Discovery Miles 6 670
Catalytic and Process Study of the…
Ruijun Hou Hardcover R3,516 Discovery Miles 35 160
7 Systems Plan - Proven Steps to Amazing…
Pat Luse Hardcover R702 Discovery Miles 7 020
Aging, Media, and Culture
C.Lee Harrington, Denise Bielby, … Hardcover R3,129 Discovery Miles 31 290
Building Bridges Not Walls - An…
Peter Bold Paperback R438 Discovery Miles 4 380
Development of a Society on Wheels…
Junxiu Wang Hardcover R3,060 Discovery Miles 30 600
The Making of a Tory Evangelical
David Furse-Roberts Hardcover R1,717 R1,400 Discovery Miles 14 000

 

Partners