Permutation group algorithms:
Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation grou...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2003
|
| Schriftenreihe: | Cambridge tracts in mathematics
152 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 UBR01 Volltext |
| Zusammenfassung: | Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses |
| Beschreibung: | 1 Online-Ressource (ix, 264 Seiten) |
| ISBN: | 9780511546549 |
| DOI: | 10.1017/CBO9780511546549 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043942041 | ||
| 003 | DE-604 | ||
| 005 | 20190513 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2003 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511546549 |c Online |9 978-0-511-54654-9 | ||
| 024 | 7 | |a 10.1017/CBO9780511546549 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511546549 | ||
| 035 | |a (OCoLC)967602297 | ||
| 035 | |a (DE-599)BVBBV043942041 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-355 | ||
| 082 | 0 | |a 512/.2 |2 21 | |
| 084 | |a SK 260 |0 (DE-625)143227: |2 rvk | ||
| 100 | 1 | |a Seress, Ákos |d 1958-2013 |e Verfasser |0 (DE-588)1103463705 |4 aut | |
| 245 | 1 | 0 | |a Permutation group algorithms |c Ákos Seress |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2003 | |
| 300 | |a 1 Online-Ressource (ix, 264 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge tracts in mathematics |v 152 | |
| 505 | 8 | |a Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups | |
| 520 | |a Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses | ||
| 650 | 4 | |a Permutation groups | |
| 650 | 4 | |a Algorithms | |
| 650 | 0 | 7 | |a Permutationsgruppe |0 (DE-588)4173833-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Gruppentheorie |0 (DE-588)4705829-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Permutationsgruppe |0 (DE-588)4173833-0 |D s |
| 689 | 0 | 1 | |a Algorithmische Gruppentheorie |0 (DE-588)4705829-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-0-521-66103-4 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511546549 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029351011 | ||
| 966 | e | |u https://doi.org/10.1017/CBO9780511546549 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511546549 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511546549 |l UBR01 |p ZDB-20-CBO |q UBR Einzelkauf (Lückenergänzung CUP Serien 2018) |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176884432371712 |
|---|---|
| any_adam_object | |
| author | Seress, Ákos 1958-2013 |
| author_GND | (DE-588)1103463705 |
| author_facet | Seress, Ákos 1958-2013 |
| author_role | aut |
| author_sort | Seress, Ákos 1958-2013 |
| author_variant | á s ás |
| building | Verbundindex |
| bvnumber | BV043942041 |
| classification_rvk | SK 260 |
| collection | ZDB-20-CBO |
| contents | Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups |
| ctrlnum | (ZDB-20-CBO)CR9780511546549 (OCoLC)967602297 (DE-599)BVBBV043942041 |
| 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 |
| doi_str_mv | 10.1017/CBO9780511546549 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03242nmm a2200493zcb4500</leader><controlfield tag="001">BV043942041</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190513 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2003 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511546549</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-54654-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511546549</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511546549</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967602297</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942041</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-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512/.2</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 260</subfield><subfield code="0">(DE-625)143227:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Seress, Ákos</subfield><subfield code="d">1958-2013</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1103463705</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Permutation group algorithms</subfield><subfield code="c">Ákos Seress</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (ix, 264 Seiten)</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">Cambridge tracts in mathematics</subfield><subfield code="v">152</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Permutation groups</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Permutationsgruppe</subfield><subfield code="0">(DE-588)4173833-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Gruppentheorie</subfield><subfield code="0">(DE-588)4705829-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Permutationsgruppe</subfield><subfield code="0">(DE-588)4173833-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmische Gruppentheorie</subfield><subfield code="0">(DE-588)4705829-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><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="z">978-0-521-66103-4</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511546549</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029351011</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511546549</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511546549</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511546549</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UBR Einzelkauf (Lückenergänzung CUP Serien 2018)</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043942041 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:16Z |
| institution | BVB |
| isbn | 9780511546549 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029351011 |
| oclc_num | 967602297 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-355 DE-BY-UBR |
| owner_facet | DE-12 DE-92 DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (ix, 264 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO UBR Einzelkauf (Lückenergänzung CUP Serien 2018) |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in mathematics |
| spelling | Seress, Ákos 1958-2013 Verfasser (DE-588)1103463705 aut Permutation group algorithms Ákos Seress Cambridge Cambridge University Press 2003 1 Online-Ressource (ix, 264 Seiten) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in mathematics 152 Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses Permutation groups Algorithms Permutationsgruppe (DE-588)4173833-0 gnd rswk-swf Algorithmische Gruppentheorie (DE-588)4705829-8 gnd rswk-swf Permutationsgruppe (DE-588)4173833-0 s Algorithmische Gruppentheorie (DE-588)4705829-8 s DE-604 Erscheint auch als Druck-Ausgabe 978-0-521-66103-4 https://doi.org/10.1017/CBO9780511546549 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Seress, Ákos 1958-2013 Permutation group algorithms Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups Permutation groups Algorithms Permutationsgruppe (DE-588)4173833-0 gnd Algorithmische Gruppentheorie (DE-588)4705829-8 gnd |
| subject_GND | (DE-588)4173833-0 (DE-588)4705829-8 |
| title | Permutation group algorithms |
| title_auth | Permutation group algorithms |
| title_exact_search | Permutation group algorithms |
| title_full | Permutation group algorithms Ákos Seress |
| title_fullStr | Permutation group algorithms Ákos Seress |
| title_full_unstemmed | Permutation group algorithms Ákos Seress |
| title_short | Permutation group algorithms |
| title_sort | permutation group algorithms |
| topic | Permutation groups Algorithms Permutationsgruppe (DE-588)4173833-0 gnd Algorithmische Gruppentheorie (DE-588)4705829-8 gnd |
| topic_facet | Permutation groups Algorithms Permutationsgruppe Algorithmische Gruppentheorie |
| url | https://doi.org/10.1017/CBO9780511546549 |
| work_keys_str_mv | AT seressakos permutationgroupalgorithms |