| 000 -LEADER |
|---|
| fixed length control field |
00479nam a2200169Ia 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
161214s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0387549552 |
| Terms of availability |
pbk |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004 |
| Item number |
BUT |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Butler, G. |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Fundamental algorithms for permutation groups |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
New York: |
| Name of publisher, distributor, etc |
Springer-Verlag, |
| Date of publication, distribution, etc |
1991 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
238 p.; |
| Other physical details |
: |
| Dimensions |
24 cm. |
| 365 ## - TRADE PRICE |
|---|
| Price type code |
INR |
| Price amount |
1936.80 |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Lecture notes in computer science |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This is the first-ever book on computational group theory. It provides extensive and up-to-date coverage of the fundamental algorithms for permutation groups with reference to aspects of combinatorial group theory, soluble groups, and p-groups where appropriate. The book begins with a constructive introduction to group theory and algorithms for computing with small groups, followed by a gradual discussion of the basic ideas of Sims for computing with very large permutation groups, and concludes with algorithms that use group homomorphisms, as in the computation of Sylowsubgroups. No background in group theory is assumed. The emphasis is on the details of the data structures and implementation which makes the algorithms effective when applied to realistic problems. The algorithms are developed hand-in-hand with the theoretical and practical justification. All algorithms are clearly described, examples are given, exercises reinforce understanding, and detailed bibliographical remarks explain the history and context of the work. Much of the later material on homomorphisms, Sylow subgroups, and soluble permutation groups is new. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Algorithms |
|
|---|
| Topical term or geographic name as entry element |
Permutation groups |
|
|---|
| Topical term or geographic name as entry element |
Algebra - Data processing |
|
|---|
| Topical term or geographic name as entry element |
Symbolic and Algebraic Manipulation |
|
|---|
| Topical term or geographic name as entry element |
Physical Sciences & Mathematics |
|
|---|
| Topical term or geographic name as entry element |
Group theory |
|
|---|
| Topical term or geographic name as entry element |
Schreier–Sims algorithm |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Books |