Computation with finitely presented groups:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [England] ; New York
Cambridge University Press
1994
|
| Schriftenreihe: | Encyclopedia of mathematics and its applications
volume 48 |
| Schlagworte: | |
| Online-Zugang: | FAW01 FAW02 Volltext |
| Beschreibung: | Description based on print version record |
| Beschreibung: | 1 online resource (xiii, 604 pages) illustrations |
| ISBN: | 0521432138 1107088364 9780521432139 9781107088368 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043034819 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151120s1994 |||| o||u| ||||||eng d | ||
| 020 | |a 0521432138 |9 0-521-43213-8 | ||
| 020 | |a 1107088364 |c electronic bk. |9 1-107-08836-4 | ||
| 020 | |a 9780521432139 |9 978-0-521-43213-9 | ||
| 020 | |a 9781107088368 |c electronic bk. |9 978-1-107-08836-8 | ||
| 035 | |a (OCoLC)861691993 | ||
| 035 | |a (DE-599)BVBBV043034819 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 512/.2 |2 22 | |
| 100 | 1 | |a Sims, Charles C. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computation with finitely presented groups |c Charles C. Sims |
| 264 | 1 | |a Cambridge [England] ; New York |b Cambridge University Press |c 1994 | |
| 300 | |a 1 online resource (xiii, 604 pages) |b illustrations | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Encyclopedia of mathematics and its applications |v volume 48 | |
| 500 | |a Description based on print version record | ||
| 505 | 8 | |a 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 | |
| 505 | 8 | |a 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 | |
| 505 | 8 | |a 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 | |
| 505 | 8 | |a 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 | |
| 650 | 4 | |a théorie groupe | |
| 650 | 4 | |a groupe cyclique | |
| 650 | 4 | |a réécriture | |
| 650 | 4 | |a langage rationnel | |
| 650 | 4 | |a automate | |
| 650 | 4 | |a groupe abélien | |
| 650 | 4 | |a calcul | |
| 650 | 4 | |a groupe fini | |
| 650 | 4 | |a Groupes, Théorie des / Informatique | |
| 650 | 4 | |a Groupes finis / Informatique | |
| 650 | 4 | |a Groupes, Théorie combinatoire des / Informatique | |
| 650 | 7 | |a Eindige groepen |2 gtt | |
| 650 | 7 | |a Combinatieleer |2 gtt | |
| 650 | 7 | |a Groupes, théorie des / Informatique |2 ram | |
| 650 | 7 | |a Groupes finis / Informatique |2 ram | |
| 650 | 7 | |a Groupes combinatoires, théorie des / Informatique |2 ram | |
| 650 | 7 | |a Endliche Gruppe |2 swd | |
| 650 | 7 | |a Kombinatorische Gruppentheorie |2 swd | |
| 650 | 7 | |a MATHEMATICS / Algebra / Intermediate |2 bisacsh | |
| 650 | 7 | |a Combinatorial group theory / Data processing |2 fast | |
| 650 | 7 | |a Finite groups / Data processing |2 fast | |
| 650 | 7 | |a Group theory / Data processing |2 fast | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Group theory |x Data processing | |
| 650 | 4 | |a Finite groups |x Data processing | |
| 650 | 4 | |a Combinatorial group theory |x Data processing | |
| 650 | 0 | 7 | |a Kombinatorische Gruppentheorie |0 (DE-588)4219556-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computeralgebra |0 (DE-588)4010449-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Endlich darstellbare Gruppe |0 (DE-588)4777204-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Gruppentheorie |0 (DE-588)4072157-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kombinatorische Gruppentheorie |0 (DE-588)4219556-1 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Gruppentheorie |0 (DE-588)4072157-7 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Endlich darstellbare Gruppe |0 (DE-588)4777204-9 |D s |
| 689 | 2 | 1 | |a Computeralgebra |0 (DE-588)4010449-7 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Sims, Charles C |t . Computation with finitely presented groups |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569332 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028459469 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569332 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569332 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175394002173952 |
|---|---|
| any_adam_object | |
| author | Sims, Charles C. |
| author_facet | Sims, Charles C. |
| author_role | aut |
| author_sort | Sims, Charles C. |
| author_variant | c c s cc ccs |
| building | Verbundindex |
| bvnumber | BV043034819 |
| collection | ZDB-4-EBA |
| contents | 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 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 |
| ctrlnum | (OCoLC)861691993 (DE-599)BVBBV043034819 |
| dewey-full | 512/.2 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512/.2 |
| dewey-search | 512/.2 |
| dewey-sort | 3512 12 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05694nmm a2200949zcb4500</leader><controlfield tag="001">BV043034819</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151120s1994 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521432138</subfield><subfield code="9">0-521-43213-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107088364</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-107-08836-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521432139</subfield><subfield code="9">978-0-521-43213-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107088368</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-107-08836-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)861691993</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043034819</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512/.2</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sims, Charles C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computation with finitely presented groups</subfield><subfield code="c">Charles C. Sims</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [England] ; New York</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 604 pages)</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">volume 48</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on print version record</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">théorie groupe</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">groupe cyclique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">réécriture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">langage rationnel</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">automate</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">groupe abélien</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">calcul</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">groupe fini</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Groupes, Théorie des / Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Groupes finis / Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Groupes, Théorie combinatoire des / Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Eindige groepen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatieleer</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Groupes, théorie des / Informatique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Groupes finis / Informatique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Groupes combinatoires, théorie des / Informatique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Endliche Gruppe</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Kombinatorische Gruppentheorie</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Algebra / Intermediate</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial group theory / Data processing</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Finite groups / Data processing</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Group theory / Data processing</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Group theory</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Finite groups</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial group theory</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Gruppentheorie</subfield><subfield code="0">(DE-588)4219556-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computeralgebra</subfield><subfield code="0">(DE-588)4010449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Endlich darstellbare Gruppe</subfield><subfield code="0">(DE-588)4777204-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gruppentheorie</subfield><subfield code="0">(DE-588)4072157-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Gruppentheorie</subfield><subfield code="0">(DE-588)4219556-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Gruppentheorie</subfield><subfield code="0">(DE-588)4072157-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Endlich darstellbare Gruppe</subfield><subfield code="0">(DE-588)4777204-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Computeralgebra</subfield><subfield code="0">(DE-588)4010449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Sims, Charles C</subfield><subfield code="t">. Computation with finitely presented groups</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569332</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028459469</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569332</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569332</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043034819 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:15:35Z |
| institution | BVB |
| isbn | 0521432138 1107088364 9780521432139 9781107088368 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028459469 |
| oclc_num | 861691993 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 online resource (xiii, 604 pages) illustrations |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Encyclopedia of mathematics and its applications |
| spelling | Sims, Charles C. Verfasser aut Computation with finitely presented groups Charles C. Sims Cambridge [England] ; New York Cambridge University Press 1994 1 online resource (xiii, 604 pages) illustrations txt rdacontent c rdamedia cr rdacarrier Encyclopedia of mathematics and its applications volume 48 Description based on print version record 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 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 théorie groupe groupe cyclique réécriture langage rationnel automate groupe abélien calcul groupe fini Groupes, Théorie des / Informatique Groupes finis / Informatique Groupes, Théorie combinatoire des / Informatique Eindige groepen gtt Combinatieleer gtt Groupes, théorie des / Informatique ram Groupes finis / Informatique ram Groupes combinatoires, théorie des / Informatique ram Endliche Gruppe swd Kombinatorische Gruppentheorie swd MATHEMATICS / Algebra / Intermediate bisacsh Combinatorial group theory / Data processing fast Finite groups / Data processing fast Group theory / Data processing fast Datenverarbeitung Group theory Data processing Finite groups Data processing Combinatorial group theory Data processing Kombinatorische Gruppentheorie (DE-588)4219556-1 gnd rswk-swf Computeralgebra (DE-588)4010449-7 gnd rswk-swf Endlich darstellbare Gruppe (DE-588)4777204-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Gruppentheorie (DE-588)4072157-7 gnd rswk-swf Kombinatorische Gruppentheorie (DE-588)4219556-1 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 Gruppentheorie (DE-588)4072157-7 s 2\p DE-604 Endlich darstellbare Gruppe (DE-588)4777204-9 s Computeralgebra (DE-588)4010449-7 s 3\p DE-604 Erscheint auch als Druck-Ausgabe Sims, Charles C . Computation with finitely presented groups http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569332 Aggregator Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Sims, Charles C. Computation with finitely presented groups 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 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 théorie groupe groupe cyclique réécriture langage rationnel automate groupe abélien calcul groupe fini Groupes, Théorie des / Informatique Groupes finis / Informatique Groupes, Théorie combinatoire des / Informatique Eindige groepen gtt Combinatieleer gtt Groupes, théorie des / Informatique ram Groupes finis / Informatique ram Groupes combinatoires, théorie des / Informatique ram Endliche Gruppe swd Kombinatorische Gruppentheorie swd MATHEMATICS / Algebra / Intermediate bisacsh Combinatorial group theory / Data processing fast Finite groups / Data processing fast Group theory / Data processing fast Datenverarbeitung Group theory Data processing Finite groups Data processing Combinatorial group theory Data processing Kombinatorische Gruppentheorie (DE-588)4219556-1 gnd Computeralgebra (DE-588)4010449-7 gnd Endlich darstellbare Gruppe (DE-588)4777204-9 gnd Algorithmus (DE-588)4001183-5 gnd Gruppentheorie (DE-588)4072157-7 gnd |
| subject_GND | (DE-588)4219556-1 (DE-588)4010449-7 (DE-588)4777204-9 (DE-588)4001183-5 (DE-588)4072157-7 |
| title | Computation with finitely presented groups |
| title_auth | Computation with finitely presented groups |
| title_exact_search | Computation with finitely presented groups |
| title_full | Computation with finitely presented groups Charles C. Sims |
| title_fullStr | Computation with finitely presented groups Charles C. Sims |
| title_full_unstemmed | Computation with finitely presented groups Charles C. Sims |
| title_short | Computation with finitely presented groups |
| title_sort | computation with finitely presented groups |
| topic | théorie groupe groupe cyclique réécriture langage rationnel automate groupe abélien calcul groupe fini Groupes, Théorie des / Informatique Groupes finis / Informatique Groupes, Théorie combinatoire des / Informatique Eindige groepen gtt Combinatieleer gtt Groupes, théorie des / Informatique ram Groupes finis / Informatique ram Groupes combinatoires, théorie des / Informatique ram Endliche Gruppe swd Kombinatorische Gruppentheorie swd MATHEMATICS / Algebra / Intermediate bisacsh Combinatorial group theory / Data processing fast Finite groups / Data processing fast Group theory / Data processing fast Datenverarbeitung Group theory Data processing Finite groups Data processing Combinatorial group theory Data processing Kombinatorische Gruppentheorie (DE-588)4219556-1 gnd Computeralgebra (DE-588)4010449-7 gnd Endlich darstellbare Gruppe (DE-588)4777204-9 gnd Algorithmus (DE-588)4001183-5 gnd Gruppentheorie (DE-588)4072157-7 gnd |
| topic_facet | théorie groupe groupe cyclique réécriture langage rationnel automate groupe abélien calcul groupe fini Groupes, Théorie des / Informatique Groupes finis / Informatique Groupes, Théorie combinatoire des / Informatique Eindige groepen Combinatieleer Groupes, théorie des / Informatique Groupes combinatoires, théorie des / Informatique Endliche Gruppe Kombinatorische Gruppentheorie MATHEMATICS / Algebra / Intermediate Combinatorial group theory / Data processing Finite groups / Data processing Group theory / Data processing Datenverarbeitung Group theory Data processing Finite groups Data processing Combinatorial group theory Data processing Computeralgebra Endlich darstellbare Gruppe Algorithmus Gruppentheorie |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=569332 |
| work_keys_str_mv | AT simscharlesc computationwithfinitelypresentedgroups |