The Resource Computation with finitely presented groups, Charles C. Sims
Computation with finitely presented groups, Charles C. Sims
Resource Information
The item Computation with finitely presented groups, Charles C. Sims represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Computation with finitely presented groups, Charles C. Sims represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Summary

 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 book describes methods for working with elements, subgroups, and quotient groups of a finitely presented group. The author emphasizes the connection with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, from computational number theory, and from computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms 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
 Language
 eng
 Extent
 xiii, 604 pages
 Isbn
 9780521432139
 Label
 Computation with finitely presented groups
 Title
 Computation with finitely presented groups
 Statement of responsibility
 Charles C. Sims
 Language
 eng
 Summary

 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 book describes methods for working with elements, subgroups, and quotient groups of a finitely presented group. The author emphasizes the connection with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, from computational number theory, and from computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms 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
 Cataloging source
 DLC
 http://library.link/vocab/creatorName
 Sims, Charles C
 Dewey number
 512/.2
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA171
 LC item number
 .S6173 1994
 Literary form
 non fiction
 Nature of contents
 bibliography
 Series statement
 Encyclopedia of mathematics and its applications
 Series volume
 v. 48
 http://library.link/vocab/subjectName

 Group theory
 Finite groups
 Combinatorial group theory
 Label
 Computation with finitely presented groups, Charles C. Sims
 Bibliography note
 Includes bibliographical references (pages [581]595) and index
 Carrier category
 volume
 Carrier category code
 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Control code
 26672381
 Dimensions
 25 cm
 Extent
 xiii, 604 pages
 Isbn
 9780521432139
 Lccn
 92032383
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code
 n
 Other physical details
 illustrations
 System control number
 (WaOLN)1569173
 Label
 Computation with finitely presented groups, Charles C. Sims
 Bibliography note
 Includes bibliographical references (pages [581]595) and index
 Carrier category
 volume
 Carrier category code
 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Control code
 26672381
 Dimensions
 25 cm
 Extent
 xiii, 604 pages
 Isbn
 9780521432139
 Lccn
 92032383
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code
 n
 Other physical details
 illustrations
 System control number
 (WaOLN)1569173
Library Links
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Computationwithfinitelypresentedgroups/p4zCr4hez2w/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Computationwithfinitelypresentedgroups/p4zCr4hez2w/">Computation with finitely presented groups, Charles C. Sims</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Computation with finitely presented groups, Charles C. Sims
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Computationwithfinitelypresentedgroups/p4zCr4hez2w/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Computationwithfinitelypresentedgroups/p4zCr4hez2w/">Computation with finitely presented groups, Charles C. Sims</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>