Computation Finitely Presented Groups by Sims Charles (28 results)

Condition: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

hardcover. Condition: Very Good. Dust Jacket Condition: very good. A nice copy. Clean text, solid binding. Very good copy in a very good dust jacket. We are a small business and are slowly adding photos and more information for this listing for our new . Please for photos.

Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: New.

Condition: New.

Condition: New.

Condition: New. pp. 624.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Condition: New. This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 624 pages, black & white illustrations. BIC Classification: PBG; UYA. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 32. Weight in Grams: 860. . 2010. paperback. . . . . Books ship from the US and Ireland.…

Condition: New. This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 624 pages, black & white illustrations. BIC Classification: PBG; UYA. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 32. Weight in Grams: 860. . 2010. paperback. . . . .…

Condition: New.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: As New. Unread book in perfect condition.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Condition: New. This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. Series Editor(s): Rota, G.-C.; Doran, B.; Ismail, M.; Lam, T. Y.; Wutwak, E.; Flajolet, Philippe; Lutwak, E. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 624 pages, black & white illustrations. BIC Classification: PBG; UYA. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 33. Weight in Grams: 975. . 1994. hardcover. . . . . Books ship from the US and Ireland. …

Condition: New. This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. Series Editor(s): Rota, G.-C.; Doran, B.; Ismail, M.; Lam, T. Y.; Wutwak, E.; Flajolet, Philippe; Lutwak, E. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 624 pages, black & white illustrations. BIC Classification: PBG; UYA. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 33. Weight in Grams: 975. . 1994. hardcover. . . . . …

PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Paperback. Condition: new. Paperback. 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. It is a comprehensive text presenting the fundamental algorithmic ideas which have been developed to compute with finitely presented groups, discussing techniques for computing with finitely presented groups which are infinite, or at least not obviously finite, and describing methods for working with elements, subgroups and quotient groups of a finitely presented group. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Condition: New. Print on Demand pp. 624 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. It is a comprehensive text presenting the fundamental algorithmic ideas which have been developed to compute with finitely presented groups, discussing techniques for computing with finitely presented groups which are infinite, or at least not obviously fin.…

Condition: New. PRINT ON DEMAND pp. 624.

Taschenbuch. Condition: Neu. Computation with Finitely Presented Groups | Charles C. Sims (u. a.) | Taschenbuch | Kartoniert / Broschiert | Englisch | 2010 | Cambridge University Press | EAN 9780521135078 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. …

Hardcover. Condition: new. Hardcover. Research in computational group theory, an active subfield of computational algebra, has emphasized three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. It is the first text to present the fundamental algorithmic ideas which have been developed to compute with finitely presented groups, discussing techniques for computing with finitely presented groups which are infinite, or at least not obviously finite, and describing methods for working with elements, subgroups, and quotient groups of a finitely presented group. The author emphasizes 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 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. Presents the fundamental algorithmic ideas which have been developed to compute with finitely presented groups, discussing techniques for computing with finitely presented groups which are infinite, or at least not obviously finite, and describing methods for working with elements, subgroups, and quotient groups of a finitely presented group. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. It is a comprehensive text presenting the fundamental algorithmic ideas which have been developed to compute with finitely presented groups, discussing techniques for computing with finitely presented groups which are infinite, or at least not obviously fin.…

Buch. Condition: Neu. Computation with Finitely Presented Groups | Charles C. Sims | Buch | Gebunden | Englisch | 2008 | Cambridge University Press | EAN 9780521432139 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.…

Condition: New. Print on Demand pp. 624 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.