Sophie

Sophie

distrib > Mandriva > 2010.0 > i586 > media > contrib-release > by-pkgid > 5e1854624d3bc613bdd0dd13d1ef9ac7 > files > 3627

gap-system-4.4.12-5mdv2010.0.i586.rpm

\chapcontents {\tocstrut }{Copyright Notice}{19}
\chapcontents {1}{About the GAP Reference Manual}{20}
\seccontents {1.1}{Manual Conventions} {20}
\seccontents {1.2}{Credit} {21}
\chapcontents {2}{The Help System}{22}
\seccontents {2.1}{Invoking the Help} {22}
\seccontents {2.2}{Browsing through the Sections} {22}
\seccontents {2.3}{Changing the Help Viewer} {23}
\seccontents {2.4}{The Pager Command} {25}
\chapcontents {3}{Running GAP}{27}
\seccontents {3.1}{Command Line Options} {27}
\seccontents {3.2}{Advanced Features of GAP} {30}
\seccontents {3.3}{Running GAP under MacOS} {31}
\seccontents {3.4}{The .gaprc file} {33}
\seccontents {3.5}{Completion Files} {34}
\seccontents {3.6}{Testing for the System Architecture} {35}
\seccontents {3.7}{The Compiler} {35}
\seccontents {3.8}{Suitability for Compilation} {36}
\seccontents {3.9}{Compiling Library Code} {36}
\seccontents {3.10}{CRC Numbers} {37}
\seccontents {3.11}{Saving and Loading a Workspace} {37}
\seccontents {3.12}{Coloring the Prompt and Input} {38}
\chapcontents {4}{The Programming Language}{39}
\seccontents {4.1}{Language Overview} {39}
\seccontents {4.2}{Lexical Structure} {40}
\seccontents {4.3}{Symbols} {40}
\seccontents {4.4}{Whitespaces} {41}
\seccontents {4.5}{Keywords} {41}
\seccontents {4.6}{Identifiers} {42}
\seccontents {4.7}{Expressions} {42}
\seccontents {4.8}{Variables} {43}
\seccontents {4.9}{More About Global Variables} {44}
\seccontents {4.10}{Function Calls} {46}
\seccontents {4.11}{Comparisons} {47}
\seccontents {4.12}{Arithmetic Operators} {48}
\seccontents {4.13}{Statements} {49}
\seccontents {4.14}{Assignments} {50}
\seccontents {4.15}{Procedure Calls} {50}
\seccontents {4.16}{If} {51}
\seccontents {4.17}{While} {52}
\seccontents {4.18}{Repeat} {52}
\seccontents {4.19}{For} {53}
\seccontents {4.20}{Break} {55}
\seccontents {4.21}{Continue} {55}
\seccontents {4.22}{Function} {55}
\seccontents {4.23}{Return} {58}
\seccontents {4.24}{The Syntax in BNF} {59}
\chapcontents {5}{Functions}{61}
\seccontents {5.1}{Information about a function} {61}
\seccontents {5.2}{Calling a function with a list argument that is interpreted as several arguments} {62}
\seccontents {5.3}{Functions that do nothing} {63}
\seccontents {5.4}{Function Types} {63}
\chapcontents {6}{Main Loop and Break Loop}{64}
\seccontents {6.1}{Main Loop} {64}
\seccontents {6.2}{Special Rules for Input Lines} {65}
\seccontents {6.3}{View and Print} {66}
\seccontents {6.4}{Break Loops} {67}
\seccontents {6.5}{Variable Access in a Break Loop} {71}
\seccontents {6.6}{Error} {73}
\seccontents {6.7}{ErrorCount} {73}
\seccontents {6.8}{Leaving GAP} {73}
\seccontents {6.9}{Line Editing} {74}
\seccontents {6.10}{Editing Files} {75}
\seccontents {6.11}{Editor Support} {75}
\seccontents {6.12}{SizeScreen} {76}
\chapcontents {7}{Debugging and Profiling Facilities}{77}
\seccontents {7.1}{Recovery from NoMethodFound-Errors} {77}
\seccontents {7.2}{ApplicableMethod} {78}
\seccontents {7.3}{Tracing Methods} {79}
\seccontents {7.4}{Info Functions} {80}
\seccontents {7.5}{Assertions} {81}
\seccontents {7.6}{Timing} {81}
\seccontents {7.7}{Profiling} {82}
\seccontents {7.8}{Information about the version used} {84}
\seccontents {7.9}{Test Files} {84}
\seccontents {7.10}{Debugging Recursion} {85}
\seccontents {7.11}{Global Memory Information} {87}
\chapcontents {8}{Options Stack}{88}
\chapcontents {9}{Files and Filenames}{90}
\seccontents {9.1}{Portability} {90}
\seccontents {9.2}{GAP Root Directory} {90}
\seccontents {9.3}{Directories} {91}
\seccontents {9.4}{Filename} {92}
\seccontents {9.5}{Special Filenames} {93}
\seccontents {9.6}{File Access} {93}
\seccontents {9.7}{File Operations} {94}
\chapcontents {10}{Streams}{97}
\seccontents {10.1}{Categories for Streams and the StreamsFamily} {97}
\seccontents {10.2}{Operations applicable to All Streams} {98}
\seccontents {10.3}{Operations for Input Streams} {98}
\seccontents {10.4}{Operations for Output Streams} {101}
\seccontents {10.5}{File Streams} {103}
\seccontents {10.6}{User Streams} {103}
\seccontents {10.7}{String Streams} {104}
\seccontents {10.8}{Input-Output Streams} {104}
\seccontents {10.9}{Dummy Streams} {106}
\seccontents {10.10}{Handling of Streams in the Background} {106}
\chapcontents {11}{Processes}{107}
\seccontents {11.1}{Process} {107}
\seccontents {11.2}{Exec} {108}
\chapcontents {12}{Objects and Elements}{109}
\seccontents {12.1}{Objects} {109}
\seccontents {12.2}{Elements as equivalence classes} {109}
\seccontents {12.3}{Sets} {110}
\seccontents {12.4}{Domains} {110}
\seccontents {12.5}{Identical Objects} {110}
\seccontents {12.6}{Mutability and Copyability} {111}
\seccontents {12.7}{Duplication of Objects} {113}
\seccontents {12.8}{Other Operations Applicable to any Object} {114}
\chapcontents {13}{Types of Objects}{116}
\seccontents {13.1}{Families} {116}
\seccontents {13.2}{Filters} {117}
\seccontents {13.3}{Categories} {118}
\seccontents {13.4}{Representation} {120}
\seccontents {13.5}{Attributes} {121}
\seccontents {13.6}{Setter and Tester for Attributes} {122}
\seccontents {13.7}{Properties} {124}
\seccontents {13.8}{Other Filters} {125}
\seccontents {13.9}{Types} {125}
\chapcontents {14}{Integers}{126}
\seccontents {14.1}{Elementary Operations for Integers} {127}
\seccontents {14.2}{Quotients and Remainders} {129}
\seccontents {14.3}{Prime Integers and Factorization} {131}
\seccontents {14.4}{Residue Class Rings} {134}
\seccontents {14.5}{Random Sources} {136}
\chapcontents {15}{Number Theory}{138}
\seccontents {15.1}{Prime Residues} {138}
\seccontents {15.2}{Primitive Roots and Discrete Logarithms} {139}
\seccontents {15.3}{Roots Modulo Integers} {140}
\seccontents {15.4}{Multiplicative Arithmetic Functions} {142}
\seccontents {15.5}{Continued Fractions} {143}
\seccontents {15.6}{Miscellaneous} {144}
\chapcontents {16}{Rational Numbers}{145}
\seccontents {16.1}{Elementary Operations for Rationals} {145}
\chapcontents {17}{Combinatorics}{147}
\seccontents {17.1}{Combinatorial Numbers} {147}
\seccontents {17.2}{Combinations, Arrangements and Tuples} {149}
\seccontents {17.3}{Fibonacci and Lucas Sequences} {155}
\seccontents {17.4}{Permanent of a Matrix} {156}
\chapcontents {18}{Cyclotomic Numbers}{157}
\seccontents {18.1}{Operations for Cyclotomics} {157}
\seccontents {18.2}{Infinity} {160}
\seccontents {18.3}{Comparisons of Cyclotomics} {161}
\seccontents {18.4}{ATLAS Irrationalities} {161}
\seccontents {18.5}{Galois Conjugacy of Cyclotomics} {164}
\seccontents {18.6}{Internally Represented Cyclotomics} {166}
\chapcontents {19}{Unknowns}{168}
\chapcontents {20}{Booleans}{170}
\seccontents {20.1}{Fail} {170}
\seccontents {20.2}{Comparisons of Booleans} {170}
\seccontents {20.3}{Operations for Booleans} {171}
\chapcontents {21}{Lists}{173}
\seccontents {21.1}{List Categories} {173}
\seccontents {21.2}{Basic Operations for Lists} {175}
\seccontents {21.3}{List Elements} {175}
\seccontents {21.4}{List Assignment} {177}
\seccontents {21.5}{IsBound and Unbind for Lists} {179}
\seccontents {21.6}{Identical Lists} {180}
\seccontents {21.7}{Duplication of Lists} {181}
\seccontents {21.8}{Membership Test for Lists} {183}
\seccontents {21.9}{Enlarging Internally Represented Lists} {183}
\seccontents {21.10}{Comparisons of Lists} {184}
\seccontents {21.11}{Arithmetic for Lists} {185}
\seccontents {21.12}{Filters Controlling the Arithmetic Behaviour of Lists} {185}
\seccontents {21.13}{Additive Arithmetic for Lists} {187}
\seccontents {21.14}{Multiplicative Arithmetic for Lists} {188}
\seccontents {21.15}{Mutability Status and List Arithmetic} {190}
\seccontents {21.16}{Finding Positions in Lists} {191}
\seccontents {21.17}{Properties and Attributes for Lists} {194}
\seccontents {21.18}{Sorting Lists} {196}
\seccontents {21.19}{Sorted Lists and Sets} {197}
\seccontents {21.20}{Operations for Lists} {199}
\seccontents {21.21}{Advanced List Manipulations} {206}
\seccontents {21.22}{Ranges} {207}
\seccontents {21.23}{Enumerators} {209}
\chapcontents {22}{Boolean Lists}{211}
\seccontents {22.1}{Boolean Lists Representing Subsets} {211}
\seccontents {22.2}{Set Operations via Boolean Lists} {212}
\seccontents {22.3}{Function that Modify Boolean Lists} {213}
\seccontents {22.4}{More about Boolean Lists} {214}
\chapcontents {23}{Row Vectors}{215}
\seccontents {23.1}{Operators for Row Vectors} {215}
\seccontents {23.2}{Row Vectors over Finite Fields} {217}
\seccontents {23.3}{Coefficient List Arithmetic} {218}
\seccontents {23.4}{Shifting and Trimming Coefficient Lists} {219}
\seccontents {23.5}{Functions for Coding Theory} {220}
\seccontents {23.6}{Vectors as coefficients of polynomials} {220}
\chapcontents {24}{Matrices}{223}
\seccontents {24.1}{Categories of Matrices} {223}
\seccontents {24.2}{Operators for Matrices} {224}
\seccontents {24.3}{Properties and Attributes of Matrices} {226}
\seccontents {24.4}{Matrix Constructions} {228}
\seccontents {24.5}{Random Matrices} {230}
\seccontents {24.6}{Matrices Representing Linear Equations and the Gaussian Algorithm} {230}
\seccontents {24.7}{Eigenvectors and eigenvalues} {231}
\seccontents {24.8}{Elementary Divisors} {232}
\seccontents {24.9}{Echelonized Matrices} {232}
\seccontents {24.10}{Matrices as Basis of a Row Space} {234}
\seccontents {24.11}{Triangular Matrices} {235}
\seccontents {24.12}{Matrices as Linear Mappings} {235}
\seccontents {24.13}{Matrices over Finite Fields} {237}
\seccontents {24.14}{Special Multiplication Algorithms for Matrices over GF(2)} {239}
\seccontents {24.15}{Block Matrices} {240}
\chapcontents {25}{Integral matrices and lattices}{241}
\seccontents {25.1}{Linear equations over the integers and Integral Matrices} {241}
\seccontents {25.2}{Normal Forms over the Integers} {242}
\seccontents {25.3}{Determinant of an integer matrix} {245}
\seccontents {25.4}{Decompositions} {245}
\seccontents {25.5}{Lattice Reduction} {246}
\seccontents {25.6}{Orthogonal Embeddings} {248}
\chapcontents {26}{Strings and Characters}{250}
\seccontents {26.1}{Special Characters} {252}
\seccontents {26.2}{Internally Represented Strings} {253}
\seccontents {26.3}{Recognizing Characters} {254}
\seccontents {26.4}{Comparisons of Strings} {254}
\seccontents {26.5}{Operations to Produce or Manipulate Strings} {255}
\seccontents {26.6}{Character Conversion} {258}
\seccontents {26.7}{Operations to Evaluate Strings} {258}
\seccontents {26.8}{Calendar Arithmetic} {259}
\chapcontents {27}{Records}{262}
\seccontents {27.1}{Accessing Record Elements} {263}
\seccontents {27.2}{Record Assignment} {263}
\seccontents {27.3}{Identical Records} {264}
\seccontents {27.4}{Comparisons of Records} {265}
\seccontents {27.5}{IsBound and Unbind for Records} {266}
\seccontents {27.6}{Record Access Operations} {267}
\chapcontents {28}{Collections}{268}
\seccontents {28.1}{Collection Families} {268}
\seccontents {28.2}{Lists and Collections} {269}
\seccontents {28.3}{Attributes and Properties for Collections} {273}
\seccontents {28.4}{Operations for Collections} {275}
\seccontents {28.5}{Membership Test for Collections} {277}
\seccontents {28.6}{Random Elements} {277}
\seccontents {28.7}{Iterators} {278}
\chapcontents {29}{Orderings}{281}
\seccontents {29.1}{Building new orderings} {281}
\seccontents {29.2}{Properties and basic functionality} {282}
\seccontents {29.3}{Orderings on families of associative words} {283}
\chapcontents {30}{Domains and their Elements}{287}
\seccontents {30.1}{Operational Structure of Domains} {287}
\seccontents {30.2}{Equality and Comparison of Domains} {288}
\seccontents {30.3}{Constructing Domains} {288}
\seccontents {30.4}{Changing the Structure} {289}
\seccontents {30.5}{Changing the Representation} {290}
\seccontents {30.6}{Domain Categories} {290}
\seccontents {30.7}{Parents} {291}
\seccontents {30.8}{Constructing Subdomains} {292}
\seccontents {30.9}{Operations for Domains} {292}
\seccontents {30.10}{Attributes and Properties of Elements} {293}
\seccontents {30.11}{Comparison Operations for Elements} {296}
\seccontents {30.12}{Arithmetic Operations for Elements} {297}
\seccontents {30.13}{Relations Between Domains} {298}
\seccontents {30.14}{Useful Categories of Elements} {300}
\seccontents {30.15}{Useful Categories for all Elements of a Family} {302}
\chapcontents {31}{Mappings}{304}
\seccontents {31.1}{Creating Mappings} {305}
\seccontents {31.2}{Properties and Attributes of (General) Mappings} {306}
\seccontents {31.3}{Images under Mappings} {307}
\seccontents {31.4}{Preimages under Mappings} {308}
\seccontents {31.5}{Arithmetic Operations for General Mappings} {310}
\seccontents {31.6}{Mappings which are Compatible with Algebraic Structures} {310}
\seccontents {31.7}{Magma Homomorphisms} {310}
\seccontents {31.8}{Mappings that Respect Multiplication} {311}
\seccontents {31.9}{Mappings that Respect Addition} {312}
\seccontents {31.10}{Linear Mappings} {312}
\seccontents {31.11}{Ring Homomorphisms} {313}
\seccontents {31.12}{General Mappings} {313}
\seccontents {31.13}{Technical Matters Concerning General Mappings} {313}
\chapcontents {32}{Relations}{315}
\seccontents {32.1}{General Binary Relations} {315}
\seccontents {32.2}{Properties and Attributes of Binary Relations} {315}
\seccontents {32.3}{Binary Relations on Points} {317}
\seccontents {32.4}{Closure Operations and Other Constructors} {317}
\seccontents {32.5}{Equivalence Relations} {318}
\seccontents {32.6}{Attributes of and Operations on Equivalence Relations} {318}
\seccontents {32.7}{Equivalence Classes} {319}
\chapcontents {33}{Magmas}{320}
\seccontents {33.1}{Magma Categories} {320}
\seccontents {33.2}{Magma Generation} {321}
\seccontents {33.3}{Magmas Defined by Multiplication Tables} {322}
\seccontents {33.4}{Attributes and Properties for Magmas} {323}
\chapcontents {34}{Words}{326}
\seccontents {34.1}{Categories of Words and Nonassociative Words} {326}
\seccontents {34.2}{Comparison of Words} {328}
\seccontents {34.3}{Operations for Words} {328}
\seccontents {34.4}{Free Magmas} {329}
\seccontents {34.5}{External Representation for Nonassociative Words} {330}
\chapcontents {35}{Associative Words}{331}
\seccontents {35.1}{Categories of Associative Words} {331}
\seccontents {35.2}{Free Groups, Monoids and Semigroups} {332}
\seccontents {35.3}{Comparison of Associative Words} {334}
\seccontents {35.4}{Operations for Associative Words} {335}
\seccontents {35.5}{Operations for Associative Words by their Syllables} {336}
\seccontents {35.6}{Representations for Associative Words} {337}
\seccontents {35.7}{The External Representation for Associative Words} {339}
\seccontents {35.8}{Straight Line Programs} {339}
\seccontents {35.9}{Straight Line Program Elements} {343}
\chapcontents {36}{Rewriting Systems}{345}
\seccontents {36.1}{Operations on rewriting systems} {345}
\seccontents {36.2}{Operations on elements of the algebra} {346}
\seccontents {36.3}{Properties of rewriting systems} {347}
\seccontents {36.4}{Rewriting in Groups and Monoids} {347}
\seccontents {36.5}{Developing rewriting systems} {348}
\chapcontents {37}{Groups}{350}
\seccontents {37.1}{Group Elements} {350}
\seccontents {37.2}{Creating Groups} {350}
\seccontents {37.3}{Subgroups} {352}
\seccontents {37.4}{Closures of (Sub)groups} {354}
\seccontents {37.5}{Expressing Group Elements as Words in Generators} {354}
\seccontents {37.6}{Structure Descriptions} {355}
\seccontents {37.7}{Cosets} {357}
\seccontents {37.8}{Transversals} {358}
\seccontents {37.9}{Double Cosets} {359}
\seccontents {37.10}{Conjugacy Classes} {360}
\seccontents {37.11}{Normal Structure} {362}
\seccontents {37.12}{Specific and Parametrized Subgroups} {363}
\seccontents {37.13}{Sylow Subgroups and Hall Subgroups} {365}
\seccontents {37.14}{Subgroups characterized by prime powers} {366}
\seccontents {37.15}{Group Properties} {367}
\seccontents {37.16}{Numerical Group Attributes} {369}
\seccontents {37.17}{Subgroup Series} {370}
\seccontents {37.18}{Factor Groups} {373}
\seccontents {37.19}{Sets of Subgroups} {374}
\seccontents {37.20}{Subgroup Lattice} {375}
\seccontents {37.21}{Specific Methods for Subgroup Lattice Computations} {377}
\seccontents {37.22}{Special Generating Sets} {380}
\seccontents {37.23}{1-Cohomology} {380}
\seccontents {37.24}{Schur Covers and Multipliers} {383}
\seccontents {37.25}{Tests for the Availability of Methods} {384}
\chapcontents {38}{Group Homomorphisms}{385}
\seccontents {38.1}{Creating Group Homomorphisms} {385}
\seccontents {38.2}{Operations for Group Homomorphisms} {387}
\seccontents {38.3}{Efficiency of Homomorphisms} {388}
\seccontents {38.4}{Homomorphism for very large groups} {389}
\seccontents {38.5}{Nice Monomorphisms} {390}
\seccontents {38.6}{Group Automorphisms} {390}
\seccontents {38.7}{Groups of Automorphisms} {392}
\seccontents {38.8}{Calculating with Group Automorphisms} {393}
\seccontents {38.9}{Searching for Homomorphisms} {394}
\seccontents {38.10}{Representations for Group Homomorphisms} {396}
\chapcontents {39}{Group Actions}{397}
\seccontents {39.1}{About Group Actions} {397}
\seccontents {39.2}{Basic Actions} {398}
\seccontents {39.3}{Orbits} {400}
\seccontents {39.4}{Stabilizers} {402}
\seccontents {39.5}{Elements with Prescribed Images} {403}
\seccontents {39.6}{The Permutation Image of an Action} {403}
\seccontents {39.7}{Action of a group on itself} {405}
\seccontents {39.8}{Permutations Induced by Elements and Cycles} {406}
\seccontents {39.9}{Tests for Actions} {407}
\seccontents {39.10}{Block Systems} {408}
\seccontents {39.11}{External Sets} {409}
\chapcontents {40}{Permutations}{412}
\seccontents {40.1}{Comparison of Permutations} {413}
\seccontents {40.2}{Moved Points of Permutations} {413}
\seccontents {40.3}{Sign and Cycle Structure} {414}
\seccontents {40.4}{Creating Permutations} {415}
\chapcontents {41}{Permutation Groups}{416}
\seccontents {41.1}{The Natural Action} {416}
\seccontents {41.2}{Computing a Permutation Representation} {417}
\seccontents {41.3}{Symmetric and Alternating Groups} {417}
\seccontents {41.4}{Primitive Groups} {418}
\seccontents {41.5}{Stabilizer Chains} {419}
\seccontents {41.6}{Randomized Methods for Permutation Groups} {420}
\seccontents {41.7}{Construction of Stabilizer Chains} {422}
\seccontents {41.8}{Stabilizer Chain Records} {423}
\seccontents {41.9}{Operations for Stabilizer Chains} {424}
\seccontents {41.10}{Low Level Routines to Modify and Create Stabilizer Chains} {426}
\seccontents {41.11}{Backtrack} {427}
\seccontents {41.12}{Working with large degree permutation groups} {428}
\chapcontents {42}{Matrix Groups}{430}
\seccontents {42.1}{Attributes and Properties for Matrix Groups} {430}
\seccontents {42.2}{Actions of Matrix Groups} {431}
\seccontents {42.3}{GL and SL} {431}
\seccontents {42.4}{Invariant Forms} {432}
\seccontents {42.5}{Matrix Groups in Characteristic 0} {433}
\seccontents {42.6}{Acting OnRight and OnLeft} {435}
\chapcontents {43}{Polycyclic Groups}{436}
\seccontents {43.1}{Polycyclic Generating Systems} {436}
\seccontents {43.2}{Computing a Pcgs} {437}
\seccontents {43.3}{Defining a Pcgs Yourself} {437}
\seccontents {43.4}{Elementary Operations for a Pcgs} {438}
\seccontents {43.5}{Elementary Operations for a Pcgs and an Element} {439}
\seccontents {43.6}{Exponents of Special Products} {440}
\seccontents {43.7}{Subgroups of Polycyclic Groups - Induced Pcgs} {441}
\seccontents {43.8}{Subgroups of Polycyclic Groups - Canonical Pcgs} {442}
\seccontents {43.9}{Factor Groups of Polycyclic Groups - Modulo Pcgs} {443}
\seccontents {43.10}{Factor Groups of Polycyclic Groups in their Own Representation} {444}
\seccontents {43.11}{Pcgs and Normal Series} {445}
\seccontents {43.12}{Sum and Intersection of Pcgs} {447}
\seccontents {43.13}{Special Pcgs} {448}
\seccontents {43.14}{Action on Subfactors Defined by a Pcgs} {450}
\seccontents {43.15}{Orbit Stabilizer Methods for Polycyclic Groups} {451}
\seccontents {43.16}{Operations which have Special Methods for Groups with Pcgs} {451}
\seccontents {43.17}{Conjugacy Classes in Solvable Groups} {451}
\chapcontents {44}{Pc Groups}{453}
\seccontents {44.1}{The family pcgs} {454}
\seccontents {44.2}{Elements of pc groups} {454}
\seccontents {44.3}{Pc groups versus fp groups} {455}
\seccontents {44.4}{Constructing Pc Groups} {455}
\seccontents {44.5}{Computing Pc Groups} {457}
\seccontents {44.6}{Saving a Pc Group} {458}
\seccontents {44.7}{Operations for Pc Groups} {458}
\seccontents {44.8}{2-Cohomology and Extensions} {459}
\seccontents {44.9}{Coding a Pc Presentation} {462}
\seccontents {44.10}{Random Isomorphism Testing} {462}
\chapcontents {45}{Finitely Presented Groups}{463}
\seccontents {45.1}{Creating Finitely Presented Groups} {464}
\seccontents {45.2}{Comparison of Elements of Finitely Presented Groups} {465}
\seccontents {45.3}{Preimages in the Free Group} {465}
\seccontents {45.4}{Operations for Finitely Presented Groups} {466}
\seccontents {45.5}{Coset Tables and Coset Enumeration} {467}
\seccontents {45.6}{Standardization of coset tables} {470}
\seccontents {45.7}{Coset tables for subgroups in the whole group} {471}
\seccontents {45.8}{Augmented Coset Tables and Rewriting} {471}
\seccontents {45.9}{Low Index Subgroups} {472}
\seccontents {45.10}{Converting Groups to Finitely Presented Groups} {473}
\seccontents {45.11}{New Presentations and Presentations for Subgroups} {475}
\seccontents {45.12}{Preimages under Homomorphisms from an FpGroup} {476}
\seccontents {45.13}{Quotient Methods} {477}
\seccontents {45.14}{Abelian Invariants for Subgroups} {479}
\seccontents {45.15}{Testing Finiteness of Finitely Presented Groups} {480}
\chapcontents {46}{Presentations and Tietze Transformations}{482}
\seccontents {46.1}{Creating Presentations} {482}
\seccontents {46.2}{SimplifiedFpGroup} {484}
\seccontents {46.3}{Subgroup Presentations} {485}
\seccontents {46.4}{Relators in a Presentation} {488}
\seccontents {46.5}{Printing Presentations} {488}
\seccontents {46.6}{Changing Presentations} {490}
\seccontents {46.7}{Tietze Transformations} {490}
\seccontents {46.8}{Elementary Tietze Transformations} {493}
\seccontents {46.9}{Tietze Transformations that introduce new Generators} {495}
\seccontents {46.10}{Tracing generator images through Tietze transformations} {498}
\seccontents {46.11}{DecodeTree} {500}
\seccontents {46.12}{Tietze Options} {503}
\chapcontents {47}{Group Products}{505}
\seccontents {47.1}{Direct Products} {505}
\seccontents {47.2}{Semidirect Products} {506}
\seccontents {47.3}{Subdirect Products} {508}
\seccontents {47.4}{Wreath Products} {508}
\seccontents {47.5}{Free Products} {510}
\seccontents {47.6}{Embeddings and Projections for Group Products} {510}
\chapcontents {48}{Group Libraries}{511}
\seccontents {48.1}{Basic Groups} {511}
\seccontents {48.2}{Classical Groups} {513}
\seccontents {48.3}{Conjugacy Classes in Classical Groups} {517}
\seccontents {48.4}{Constructors for Basic Groups} {517}
\seccontents {48.5}{Selection Functions} {518}
\seccontents {48.6}{Transitive Permutation Groups} {519}
\seccontents {48.7}{Small Groups} {520}
\seccontents {48.8}{Finite Perfect Groups} {523}
\seccontents {48.9}{Primitive Permutation Groups} {527}
\seccontents {48.10}{Index numbers of primitive groups} {529}
\seccontents {48.11}{Irreducible Solvable Matrix Groups} {530}
\seccontents {48.12}{Irreducible Maximal Finite Integral Matrix Groups} {531}
\chapcontents {49}{Semigroups}{539}
\seccontents {49.1}{Making transformation semigroups} {541}
\seccontents {49.2}{Ideals of semigroups} {541}
\seccontents {49.3}{Congruences for semigroups} {542}
\seccontents {49.4}{Quotients} {542}
\seccontents {49.5}{Green's Relations} {542}
\seccontents {49.6}{Rees Matrix Semigroups} {544}
\chapcontents {50}{Monoids}{546}
\chapcontents {51}{Finitely Presented Semigroups and Monoids}{548}
\seccontents {51.1}{Creating Finitely Presented Semigroups} {550}
\seccontents {51.2}{Comparison of Elements of Finitely Presented Semigroups} {551}
\seccontents {51.3}{Preimages in the Free Semigroup} {551}
\seccontents {51.4}{Finitely presented monoids} {552}
\seccontents {51.5}{Rewriting Systems and the Knuth-Bendix Procedure} {553}
\seccontents {51.6}{Todd-Coxeter Procedure} {554}
\chapcontents {52}{Transformations}{555}
\chapcontents {53}{Additive Magmas (preliminary)}{558}
\seccontents {53.1}{(Near-)Additive Magma Categories} {558}
\seccontents {53.2}{(Near-)Additive Magma Generation} {559}
\seccontents {53.3}{Attributes and Properties for (Near-)Additive Magmas} {560}
\seccontents {53.4}{Operations for (Near-)Additive Magmas} {561}
\chapcontents {54}{Rings}{562}
\seccontents {54.1}{Generating Rings} {562}
\seccontents {54.2}{Ideals in Rings} {564}
\seccontents {54.3}{Rings With One} {566}
\seccontents {54.4}{Properties of Rings} {567}
\seccontents {54.5}{Units and Factorizations} {568}
\seccontents {54.6}{Euclidean Rings} {570}
\seccontents {54.7}{Gcd and Lcm} {571}
\chapcontents {55}{Modules (preliminary)}{574}
\seccontents {55.1}{Generating modules} {574}
\seccontents {55.2}{Submodules} {575}
\seccontents {55.3}{Free Modules} {576}
\chapcontents {56}{Fields and Division Rings}{578}
\seccontents {56.1}{Generating Fields} {578}
\seccontents {56.2}{Subfields of Fields} {580}
\seccontents {56.3}{Galois Action} {580}
\chapcontents {57}{Finite Fields}{584}
\seccontents {57.1}{Finite Field Elements} {584}
\seccontents {57.2}{Operations for Finite Field Elements} {586}
\seccontents {57.3}{Creating Finite Fields} {587}
\seccontents {57.4}{FrobeniusAutomorphism} {589}
\seccontents {57.5}{Conway Polynomials} {589}
\seccontents {57.6}{Printing, Viewing and Displaying Finite Field Elements} {590}
\chapcontents {58}{Abelian Number Fields}{592}
\seccontents {58.1}{Construction of Abelian Number Fields} {592}
\seccontents {58.2}{Operations for Abelian Number Fields} {593}
\seccontents {58.3}{Integral Bases of Abelian Number Fields} {595}
\seccontents {58.4}{Galois Groups of Abelian Number Fields} {597}
\seccontents {58.5}{Gaussians} {598}
\chapcontents {59}{Vector Spaces}{599}
\seccontents {59.1}{Constructing Vector Spaces} {599}
\seccontents {59.2}{Operations and Attributes for Vector Spaces} {600}
\seccontents {59.3}{Domains of Subspaces of Vector Spaces} {601}
\seccontents {59.4}{Bases of Vector Spaces} {601}
\seccontents {59.5}{Operations for Vector Space Bases} {603}
\seccontents {59.6}{Operations for Special Kinds of Bases} {605}
\seccontents {59.7}{Mutable Bases} {606}
\seccontents {59.8}{Row and Matrix Spaces} {607}
\seccontents {59.9}{Vector Space Homomorphisms} {610}
\seccontents {59.10}{Vector Spaces Handled By Nice Bases} {612}
\seccontents {59.11}{How to Implement New Kinds of Vector Spaces} {613}
\chapcontents {60}{Algebras}{615}
\seccontents {60.1}{Constructing Algebras by Generators} {615}
\seccontents {60.2}{Constructing Algebras as Free Algebras} {616}
\seccontents {60.3}{Constructing Algebras by Structure Constants} {617}
\seccontents {60.4}{Some Special Algebras} {619}
\seccontents {60.5}{Subalgebras} {620}
\seccontents {60.6}{Ideals} {621}
\seccontents {60.7}{Categories and Properties of Algebras} {622}
\seccontents {60.8}{Attributes and Operations for Algebras} {623}
\seccontents {60.9}{Homomorphisms of Algebras} {629}
\seccontents {60.10}{Representations of Algebras} {632}
\chapcontents {61}{Lie Algebras}{640}
\seccontents {61.1}{Lie objects} {640}
\seccontents {61.2}{Constructing Lie algebras} {641}
\seccontents {61.3}{Distinguished Subalgebras} {643}
\seccontents {61.4}{Series of Ideals} {644}
\seccontents {61.5}{Properties of a Lie Algebra} {645}
\seccontents {61.6}{Direct Sum Decompositions} {646}
\seccontents {61.7}{Semisimple Lie Algebras and Root Systems} {646}
\seccontents {61.8}{Restricted Lie algebras} {650}
\seccontents {61.9}{The Adjoint Representation} {652}
\seccontents {61.10}{Universal Enveloping Algebras} {653}
\seccontents {61.11}{Finitely Presented Lie Algebras} {653}
\seccontents {61.12}{Modules over Lie Algebras and Their Cohomology} {655}
\seccontents {61.13}{Modules over Semisimple Lie Algebras} {657}
\seccontents {61.14}{Tensor Products and Exterior and Symmetric Powers} {660}
\chapcontents {62}{Finitely Presented Algebras}{662}
\chapcontents {63}{Magma Rings}{663}
\seccontents {63.1}{Free Magma Rings} {664}
\seccontents {63.2}{Elements of Free Magma Rings} {665}
\seccontents {63.3}{Natural Embeddings related to Magma Rings} {665}
\seccontents {63.4}{Magma Rings modulo Relations} {666}
\seccontents {63.5}{Magma Rings modulo the Span of a Zero Element} {667}
\seccontents {63.6}{Technical Details about the Implementation of Magma Rings} {667}
\chapcontents {64}{Polynomials and Rational Functions}{669}
\seccontents {64.1}{Indeterminates} {669}
\seccontents {64.2}{Operations for Rational Functions} {671}
\seccontents {64.3}{Comparison of Rational Functions} {671}
\seccontents {64.4}{Properties and Attributes of Rational Functions} {672}
\seccontents {64.5}{Univariate Polynomials} {674}
\seccontents {64.6}{Polynomials as Univariate Polynomials in one Indeterminate} {675}
\seccontents {64.7}{Multivariate Polynomials} {677}
\seccontents {64.8}{Minimal Polynomials} {677}
\seccontents {64.9}{Cyclotomic Polynomials} {677}
\seccontents {64.10}{Polynomial Factorization} {678}
\seccontents {64.11}{Polynomials over the Rationals} {678}
\seccontents {64.12}{Laurent Polynomials} {680}
\seccontents {64.13}{Univariate Rational Functions} {680}
\seccontents {64.14}{Polynomial Rings} {681}
\seccontents {64.15}{Univariate Polynomial Rings} {683}
\seccontents {64.16}{Monomial Orderings} {683}
\seccontents {64.17}{Groebner Bases} {686}
\seccontents {64.18}{Rational Function Families} {687}
\seccontents {64.19}{The Representations of Rational Functions} {688}
\seccontents {64.20}{The Defining Attributes of Rational Functions} {689}
\seccontents {64.21}{Creation of Rational Functions} {690}
\seccontents {64.22}{Arithmetic for External Representations of Polynomials} {691}
\seccontents {64.23}{Cancellation Tests for Rational Functions} {691}
\chapcontents {65}{Algebraic extensions of fields}{692}
\seccontents {65.1}{Creation of Algebraic Extensions} {692}
\seccontents {65.2}{Elements in Algebraic Extensions} {692}
\chapcontents {66}{p-adic Numbers (preliminary)}{694}
\seccontents {66.1}{Pure p-adic Numbers} {694}
\seccontents {66.2}{Extensions of the p-adic Numbers} {695}
\chapcontents {67}{The MeatAxe}{697}
\seccontents {67.1}{MeatAxe Modules} {697}
\seccontents {67.2}{Module Constructions} {697}
\seccontents {67.3}{Selecting a Different MeatAxe} {698}
\seccontents {67.4}{Accessing a Module} {698}
\seccontents {67.5}{Irreducibility Tests} {698}
\seccontents {67.6}{Finding Submodules} {698}
\seccontents {67.7}{Induced Actions} {699}
\seccontents {67.8}{Module Homomorphisms} {700}
\seccontents {67.9}{Invariant Forms} {700}
\seccontents {67.10}{The Smash MeatAxe} {701}
\seccontents {67.11}{Smash MeatAxe Flags} {702}
\chapcontents {68}{Tables of Marks}{703}
\seccontents {68.1}{More about Tables of Marks} {703}
\seccontents {68.2}{Table of Marks Objects in GAP} {704}
\seccontents {68.3}{Constructing Tables of Marks} {704}
\seccontents {68.4}{Printing Tables of Marks} {706}
\seccontents {68.5}{Sorting Tables of Marks} {707}
\seccontents {68.6}{Technical Details about Tables of Marks} {708}
\seccontents {68.7}{Attributes of Tables of Marks} {709}
\seccontents {68.8}{Properties of Tables of Marks} {712}
\seccontents {68.9}{Other Operations for Tables of Marks} {713}
\seccontents {68.10}{Standard Generators of Groups} {716}
\seccontents {68.11}{Accessing Subgroups via Tables of Marks} {719}
\seccontents {68.12}{The Interface between Tables of Marks and Character Tables} {721}
\seccontents {68.13}{Generic Construction of Tables of Marks} {723}
\seccontents {68.14}{The Library of Tables of Marks} {724}
\chapcontents {69}{Character Tables}{725}
\seccontents {69.1}{Some Remarks about Character Theory in GAP} {725}
\seccontents {69.2}{History of Character Theory Stuff in GAP} {726}
\seccontents {69.3}{Creating Character Tables} {727}
\seccontents {69.4}{Character Table Categories} {730}
\seccontents {69.5}{Conventions for Character Tables} {731}
\seccontents {69.6}{The Interface between Character Tables and Groups} {731}
\seccontents {69.7}{Operators for Character Tables} {734}
\seccontents {69.8}{Attributes and Properties of Character Tables} {734}
\seccontents {69.9}{Operations Concerning Blocks} {742}
\seccontents {69.10}{Other Operations for Character Tables} {745}
\seccontents {69.11}{Printing Character Tables} {748}
\seccontents {69.12}{Computing the Irreducible Characters of a Group} {751}
\seccontents {69.13}{Representations given by modules} {754}
\seccontents {69.14}{The Dixon-Schneider Algorithm} {754}
\seccontents {69.15}{Advanced Methods for Dixon-Schneider Calculations} {755}
\seccontents {69.16}{Components of a Dixon Record} {756}
\seccontents {69.17}{An Example of Advanced Dixon-Schneider Calculations} {756}
\seccontents {69.18}{Constructing Character Tables from Others} {758}
\seccontents {69.19}{Sorted Character Tables} {761}
\seccontents {69.20}{Automorphisms and Equivalence of Character Tables} {763}
\seccontents {69.21}{Storing Normal Subgroup Information} {765}
\chapcontents {70}{Class Functions}{768}
\seccontents {70.1}{Why Class Functions?} {768}
\seccontents {70.2}{Basic Operations for Class Functions} {770}
\seccontents {70.3}{Comparison of Class Functions} {771}
\seccontents {70.4}{Arithmetic Operations for Class Functions} {772}
\seccontents {70.5}{Printing Class Functions} {774}
\seccontents {70.6}{Creating Class Functions from Values Lists} {775}
\seccontents {70.7}{Creating Class Functions using Groups} {776}
\seccontents {70.8}{Operations for Class Functions} {777}
\seccontents {70.9}{Restricted and Induced Class Functions} {782}
\seccontents {70.10}{Reducing Virtual Characters} {784}
\seccontents {70.11}{Symmetrizations of Class Functions} {790}
\seccontents {70.12}{Molien Series} {792}
\seccontents {70.13}{Possible Permutation Characters} {793}
\seccontents {70.14}{Computing Possible Permutation Characters} {796}
\seccontents {70.15}{Operations for Brauer Characters} {800}
\seccontents {70.16}{Domains Generated by Class Functions} {801}
\chapcontents {71}{Maps Concerning Character Tables}{802}
\seccontents {71.1}{Power Maps} {802}
\seccontents {71.2}{Class Fusions between Character Tables} {806}
\seccontents {71.3}{Parametrized Maps} {811}
\seccontents {71.4}{Subroutines for the Construction of Power Maps} {819}
\seccontents {71.5}{Subroutines for the Construction of Class Fusions} {821}
\chapcontents {72}{Monomiality Questions}{824}
\seccontents {72.1}{Character Degrees and Derived Length} {825}
\seccontents {72.2}{Primitivity of Characters} {825}
\seccontents {72.3}{Testing Monomiality} {827}
\seccontents {72.4}{Minimal Nonmonomial Groups} {830}
\chapcontents {73}{Installing GAP}{831}
\seccontents {73.1}{Installation Overview} {831}
\seccontents {73.2}{Get the Archives} {832}
\seccontents {73.3}{Unpacking} {832}
\seccontents {73.4}{Compilation} {833}
\seccontents {73.5}{Test of the installation} {834}
\seccontents {73.6}{Packages} {835}
\seccontents {73.7}{Finish Installation and Cleanup} {835}
\seccontents {73.8}{The Documentation} {836}
\seccontents {73.9}{If Things Go Wrong} {837}
\seccontents {73.10}{Known Problems of the Configure Process} {838}
\seccontents {73.11}{Problems on Particular Systems} {839}
\seccontents {73.12}{Optimization and Compiler Options} {839}
\seccontents {73.13}{Porting GAP} {840}
\seccontents {73.14}{GAP for Macintosh OS X} {841}
\seccontents {73.15}{GAP for MacOS} {842}
\seccontents {73.16}{Installation of GAP for MacOS} {842}
\seccontents {73.17}{Expert Windows installation} {844}
\seccontents {73.18}{Copyrights} {845}
\chapcontents {74}{GAP Packages}{846}
\seccontents {74.1}{Installing a GAP Package} {846}
\seccontents {74.2}{Loading a GAP Package} {846}
\seccontents {74.3}{Functions for GAP Packages} {847}
\chapcontents {75}{Replaced and Removed Command Names}{850}
\seccontents {75.1}{Group Actions - Name Changes} {850}
\seccontents {75.2}{Package Interface - Obsolete Functions and Name Changes} {850}
\seccontents {75.3}{Normal Forms of Integer Matrices - Name Changes} {851}
\seccontents {75.4}{Miscellaneous Name Changes or Removed Names} {851}
\chapcontents {}{Bibliography}{853}
\chapcontents {}{Index}{860}