Documentation

AbsoluteOrder
- AbsoluteOrder(O) : RngFunOrd -> RngFunOrd
- AbsoluteOrder(O) : RngOrd -> RngOrd
AbsolutePolynomial
- AbsolutePolynomial(A) : FldAC ->
AbsolutePrecision
- AbsolutePrecision(x) : FldXPadElt -> RngIntElt
- AbsolutePrecision(x) : RngPadElt -> RngIntElt
- AbsolutePrecision(f) : RngSerElt -> RngIntElt
- AbsolutePrecision(e) : RngSerExtElt -> RngIntElt
AbsoluteQuotientRing
- AbsoluteQuotientRing(A) : FldAC -> RngUPolRes
- AbsoluteAffineAlgebra(A) : FldAC -> RngUPolRes
AbsoluteRamificationDegree
- AbsoluteInertiaDegree(L) : FldXPad -> RngIntElt
- AbsoluteInertiaIndex(L) : FldXPad -> RngIntElt
- AbsoluteRamificationDegree(L) : FldXPad -> RngIntElt
- AbsoluteRamificationIndex(L) : FldXPad -> RngIntElt
- AbsoluteDegree(F) : FldXPad -> RngIntElt
- AbsoluteRamificationDegree(I) : RngOrdIdl -> RngIntElt
- AbsoluteRamificationDegree(L) : RngPad -> RngIntElt
AbsoluteRamificationIndex
- AbsoluteInertiaDegree(L) : FldXPad -> RngIntElt
- AbsoluteInertiaIndex(L) : FldXPad -> RngIntElt
- AbsoluteRamificationDegree(L) : FldXPad -> RngIntElt
- AbsoluteRamificationIndex(L) : FldXPad -> RngIntElt
- AbsoluteDegree(F) : FldXPad -> RngIntElt
- AbsoluteRamificationDegree(I) : RngOrdIdl -> RngIntElt
- AbsoluteRamificationDegree(L) : RngPad -> RngIntElt
AbsoluteRank
- AbsoluteRank(R) : RootDtm -> RngIntElt
- Rank(R) : RootStr -> RngIntElt
AbsoluteRationalScroll
- AbsoluteRationalScroll(k,S) : Fld,[RngIntElt] -> TorVar
- AbsoluteRationalScroll(k,N) : Rng,SeqEnum -> PrjScrl
AbsoluteRepresentation
- AbsoluteRepresentation(G) : GrpMat -> GrpMat, Map
AbsoluteRepresentationMatrix
- AbsoluteRepresentationMatrix(a) : FldAlgElt -> AlgMatElt
- AbsoluteRepresentationMatrix(a) : FldNumElt -> NumMatElt
AbsoluteRootNumber
- AbsoluteRootNumber(K) : FldPad -> FldCycElt
AbsoluteTotallyRamifiedExtension
- AbsoluteTotallyRamifiedExtension(R) : RngPad -> RngPad, Map
AbsoluteTrace
- TraceAbs(a) : FldAlgElt -> FldRatElt
- AbsoluteTrace(a) : FldAlgElt -> FldRatElt
- AbsoluteTrace(a) : FldFinElt -> FldFinElt
- AbsoluteTrace(a) : FldNumElt -> FldRatElt
AbsoluteValue
- AbsoluteValue(x) : Infty -> Infty
- Abs(x) : Infty -> Infty
- Abs(z) : SpcHydElt -> FldReElt
- AbsoluteValue(q) : FldRatElt -> FldRatElt
- AbsoluteValue(r) : FldReElt-> FldReElt
- AbsoluteValue(n) : RngIntElt -> RngIntElt
- AbsoluteValue(f) : RngMPolElt -> RngMPolElt
- AbsoluteValue(p) : RngUPolElt -> RngUPolElt
AbsoluteValues
- AbsoluteValues(a) : FldAlgElt -> [FldReElt]
Absolutize
- Absolutize(A) : FldAC ->
Abstract
- AlgFP_Abstract (Example H89E8)
abstract
- Abstract Group Predicates (GROUPS)
- Abstract Group Predicates (MATRIX GROUPS OVER GENERAL RINGS)
- Abstract Properties of a Group (PERMUTATION GROUPS)
- Identification as an Abstract Group (PERMUTATION GROUPS)
- The Abstract Structure of a Group (GROUPS)
abstract-group
- Abstract Group Predicates (GROUPS)
- Abstract Group Predicates (MATRIX GROUPS OVER GENERAL RINGS)
abstract-group-properties
- Abstract Properties of a Group (PERMUTATION GROUPS)
abstract-structure
- AbelianBasis(G) : GrpFin -> [ GrpFinElt ], [ RngIntElt ]
- The Abstract Structure of a Group (GROUPS)
abvars
- Modular Abelian Varieties (MODULAR SYMBOLS)
- Modular Degree and Torsion (MODULAR SYMBOLS)
- Projection Mappings (MODULAR SYMBOLS)
- Tamagawa Numbers and Orders of Component Groups (MODULAR SYMBOLS)
Acceptor
- WordAcceptor(G) : GrpAtc -> Rec
- WordAcceptorSize(G) : GrpAtc -> RngIntElt, RngIntElt
Access
- GrpBrd_Access (Example H80E2)
- ModAlg_Access (Example H97E11)
access
- A General Facility (GRAPHS)
- Access (ALGEBRAIC FUNCTION FIELDS)
- Access (INVARIANT THEORY)
- Access (INVARIANT THEORY)
- Access (INVARIANT THEORY)
- Access (MODULES OVER MULTIVARIATE RINGS)
- Access (NUMBER FIELDS)
- Access and Modification Functions (RECORDS)
- Access Functions (ALGEBRAIC-GEOMETRIC CODES)
- Access Functions (AUTOMORPHISM GROUPS)
- Access Functions (BASIC ALGEBRAS)
- Access Functions (BASIC ALGEBRAS)
- Access Functions (BASIC ALGEBRAS)
- Access Functions (BASIC ALGEBRAS)
- Access Functions (CHAIN COMPLEXES)
- Access Functions (CHAIN COMPLEXES)
- Access functions (GRAPHS)
- Access Functions (HYPERGEOMETRIC MOTIVES)
- Access Functions (LATTICES OVER NUMBER FIELDS)
- Access Functions (LISTS)
- Access Functions (LOW DENSITY PARITY CHECK CODES)
- Access Functions (QUANTUM CODES)
- Access Functions (RIEMANN SURFACES)
- Access Functions (SEQUENCES)
- Access Functions (SERIES RINGS OVER p-ADIC RINGS)
- Access Functions for Elements (POLYCYCLIC GROUPS)
- Access Functions for Groups (POLYCYCLIC GROUPS)
- Access Functions for Words (FREE GROUPS)
- Access Operations (ELLIPTIC CURVES)
- Access Operations (LATTICES)
- Accessing and Modifying Sets (SETS)
- Accessing Associated Structures (MATRIX GROUPS OVER GENERAL RINGS)
- Accessing Attributes (FUNCTIONS, PROCEDURES AND PACKAGES)
- Accessing Class Functions (CHARACTERS OF FINITE GROUPS)
- Accessing Components of a Codeword (ADDITIVE CODES)
- Accessing Components of a Codeword (LINEAR CODES OVER FINITE FIELDS)
- Accessing Components of a Codeword (LINEAR CODES OVER FINITE RINGS)
- Accessing Functions (COPRODUCTS)
- Accessing Generators (ABELIAN GROUPS)
- Accessing Group Information (AUTOMATIC AND HYPERBOLIC GROUPS)
- Accessing Group Information (GROUPS DEFINED BY REWRITE SYSTEMS)
- Accessing Group Information (GROUPS)
- Accessing Group Information (PERMUTATION GROUPS)
- Accessing Information (BRAID GROUPS)
- Accessing Information (COHOMOLOGY AND EXTENSIONS)
- Accessing Information (FINITELY PRESENTED GROUPS)
- Accessing Information (FINITELY PRESENTED GROUPS)
- Accessing Module Information (FREE MODULES)
- Accessing Module Information (MODULES OVER AN ALGEBRA AND GROUP REPRESENTATIONS)
- Accessing Monoid Information (MONOIDS GIVEN BY REWRITE SYSTEMS)
- Accessing Roots and Coroots (COXETER GROUPS)
- Accessing Roots and Coroots (GROUPS OF LIE TYPE)
- Accessing Roots and Coroots (REFLECTION GROUPS)
- Accessing Roots and Coroots (ROOT DATA)
- Accessing Roots and Coroots (ROOT SYSTEMS)
- Accessing Sets and their Associated Structures (SETS)
- Accessing Sparse Matrices (SPARSE MATRICES)
- Accessing the ATLAS Groups (DATABASES OF GROUPS)
- Accessing the Base and Strong Generating Set (MATRIX GROUPS OVER GENERAL RINGS)
- Accessing the Base and Strong Generating Set (PERMUTATION GROUPS)
- Accessing the Composition Tree (MATRIX GROUPS OVER FINITE FIELDS)
- Accessing the Data (DATABASES OF GROUPS)
- Accessing the Data (HILBERT SERIES OF POLARISED VARIETIES)
- Accessing the Database (DATABASES OF GROUPS)
- Accessing the Database (DATABASES OF GROUPS)
- Accessing the Database (DATABASES OF GROUPS)
- Accessing the Database (DATABASES OF GROUPS)
- Accessing the Database (LATTICES)
- Accessing the Databases (DATABASES OF GROUPS)
- Accessing the Databases (DATABASES OF GROUPS)
- Accessing the Defining Generators and Relations (ABELIAN GROUPS)
- Accessing the Defining Generators and Relations (FINITELY PRESENTED GROUPS)
- Accessing the Defining Generators and Relations (FINITELY PRESENTED SEMIGROUPS)
- Accessing the Defining Generators and Relations (GROUPS OF STRAIGHT-LINE PROGRAMS)
- Accessing the Defining Generators (BLACK-BOX GROUPS)
- Accessing Vector Space Invariants (VECTOR SPACES)
- Alternative Defining Polynomials (RATIONAL CURVES AND CONICS)
- Basic Access Functions (PARTITIONS, WORDS AND YOUNG TABLEAUX)
- Basic Creation and Access (MODULES OVER MULTIVARIATE RINGS)
- Basic Invariants (RIEMANN SURFACES)
- Basis for Period Matrix (RIEMANN SURFACES)
- Creation and Access Functions (HYPERELLIPTIC CURVES)
- Creation and Access Functions (QUATERNION ALGEBRAS)
- Elementary Invariants (INCIDENCE GEOMETRY)
- Elementary Properties (MATRICES)
- Fundamental Group (RIEMANN SURFACES)
- Invariants (LINEAR CODES OVER FINITE RINGS)
- Invariants of a Code (LINEAR CODES OVER FINITE FIELDS)
- Invariants of an Additive Code (ADDITIVE CODES)
- Predicates for Codewords (ADDITIVE CODES)
- Predicates for Codewords (LINEAR CODES OVER FINITE FIELDS)
- Structures Associated with a Plane (FINITE PLANES)
- The Action Algebra (MODULES OVER AN ALGEBRA AND GROUP REPRESENTATIONS)
- The Underlying Vector Space (MODULES OVER AN ALGEBRA AND GROUP REPRESENTATIONS)
- Tuple Access Functions (TUPLES AND CARTESIAN PRODUCTS)

V2.28, 13 July 2023