|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910811824603321 |
|
|
Autore |
Seress Ákos <1958-> |
|
|
Titolo |
Permutation group algorithms / / Ákos Seress [[electronic resource]] |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cambridge : , : Cambridge University Press, , 2003 |
|
|
|
|
|
|
|
ISBN |
|
1-107-12840-4 |
1-280-41763-3 |
9786610417636 |
1-139-14616-5 |
0-511-16962-0 |
0-511-06647-3 |
0-511-06016-5 |
0-511-30845-0 |
0-511-54654-8 |
0-511-06860-3 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (ix, 264 pages) : digital, PDF file(s) |
|
|
|
|
|
|
Collana |
|
Cambridge tracts in mathematics ; ; 152 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Permutation groups |
Algorithms |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references (p. 254-261) and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
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 |
|
|
|
|