[____] [____] [_____] [____] [__] [Index] [Root]
Index C
C
Control-C key (OVERVIEW)
C-key
C
c-key
c range
call
Call by Value Evaluation (MAGMA SEMANTICS)
Expression (OVERVIEW)
Functions (OVERVIEW)
Functions, Procedures, and Mappings (OVERVIEW)
call-by-value
Call by Value Evaluation (MAGMA SEMANTICS)
Cambridge
AlgMat_Cambridge (Example H38E2)
CambridgeMatrix
CambridgeMatrix(t, K, n, Q) : RngIntElt, FldFint, RngIntElt, [ ] -> AlgMatElt
canonical
Canonical Forms (MATRIX ALGEBRAS)
Canonical Forms for Elements (THE MODULES Hom_(R)(M, N) AND End(M))
canonical-form
Canonical Forms (MATRIX ALGEBRAS)
Canonical Forms for Elements (THE MODULES Hom_(R)(M, N) AND End(M))
CanonicalForms
AlgMat_CanonicalForms (Example H38E8)
CanonicalGraph
CanonicalGraph( G: parameters ) : Grph -> Grph
car
car< R_1, ..., R_k > : Struct, ..., Struct -> SetCart
cardinality
Groups (OVERVIEW)
Rings, Fields, and Algebras (OVERVIEW)
Sets (OVERVIEW)
CarmichaelLambda
CarmichaelLambda(n) : RngIntElt -> RngIntElt
Cartesian
The Cartesian Product Constructors (SETS)
cartesian
TUPLES AND CARTESIAN PRODUCTS
Cartesian-product
The Cartesian Product Constructors (SETS)
CartesianProduct
CartesianProduct(G, H) : Diraph, Diraph -> Diraph
Tup_CartesianProduct (Example H6E1)
case
Constructor (OVERVIEW)
The case expression (OVERVIEW)
The case statement (OVERVIEW)
Lang_case (Example H1E13)
cat
S cat T : List, List -> List
s cat t : MonStgElt, MonStgElt -> MonStgElt
S cat T : SeqEnum, SeqEnum -> SeqEnum
cat:=
S cat:= T : List, List ->
s cat:= t : MonStgElt, MonStgElt -> MonStgElt
Catalan
Catalan(R) : FldRe -> FldReElt
Category
Category(S) : Obj -> Cat
Category(R) : Rng -> Cat
Category(r) : RngElt -> Cat
category
Category (OVERVIEW)
Category and Parent (NUMBER FIELDS AND THEIR ORDERS)
Magmas (or Structures) (OVERVIEW)
Module Categories (GENERAL MODULES)
Parent and Category (CYCLOTOMIC FIELDS)
Parent and Category (MULTIVARIATE POLYNOMIAL RINGS)
Parent and Category (NUMBER FIELDS AND THEIR ORDERS)
Parent and Category (POWER SERIES AND LAURENT SERIES)
Parent and Category (QUADRATIC FIELDS)
Parent and Category (UNIVARIATE POLYNOMIAL RINGS)
Parent and Category (VALUATION RINGS)
Taxonomy of Modules (GENERAL MODULES)
The Categories of Finite Groups (GROUPS)
The Category of Matrix Groups (MATRIX GROUPS)
The Category of Permutation Groups (PERMUTATION GROUPS)
Transfer Functions Between Group Categories (GROUPS)
Vector Space Categories (VECTOR SPACES)
category-parent
Category and Parent (NUMBER FIELDS AND THEIR ORDERS)
category-transfer
Transfer Functions Between Group Categories (GROUPS)
CayleyGraph
CayleyGraph(A) : Grp -> GrphUnd
Ceiling
Ceiling(q) : FldRatElt -> RngIntElt
Ceiling(r) : FldReElt -> RngIntElt
Ceiling(n) : RngIntElt -> RngIntElt
Center
Center(G) : GrpAb -> GrpAb
Centre(G) : GrpFin -> GrpFin
Centre(G) : GrpMat -> GrpMat
Centre(G) : GrpPC -> GrpPC
Centre(G) : GrpPerm -> GrpPerm
Centre(R) : Rng -> Rng
central
Central Collineations (FINITE PLANES)
central-collineations
Central Collineations (FINITE PLANES)
CentralCollineationGroup
CentralCollineationGroup(p, l) : PlanePt, PlaneLn -> GrpPerm
Centraliser
Centraliser(e, f) : SubGrpLatElt, SubGrpLatElt -> SubGrpLatElt
Centralizer(G, g) : GrpAb, GrpAbElt -> GrpAb
Centralizer(G, g) : GrpFin, GrpFinElt -> GrpFin
Centralizer(G, g) : GrpPC, GrpPCElt -> GrpPC
Centralizer(G, g) : GrpPerm, GrpPermElt -> GrpPerm
Centralizer
Centraliser(e, f) : SubGrpLatElt, SubGrpLatElt -> SubGrpLatElt
Centralizer(G, g) : GrpAb, GrpAbElt -> GrpAb
Centralizer(G, g) : GrpFin, GrpFinElt -> GrpFin
Centralizer(G, g) : GrpMat, GrpMatElt -> GrpMat
Centralizer(G, g) : GrpPC, GrpPCElt -> GrpPC
Centralizer(G, g) : GrpPerm, GrpPermElt -> GrpPerm
Centre
Centre(x) : AlgChtrElt -> Grp
Centre(G) : GrpFin -> GrpFin
Centre(G) : GrpMat -> GrpMat
Centre(G) : GrpPC -> GrpPC
Centre(G) : GrpPerm -> GrpPerm
Centre(R) : Rng -> Rng
Certificate
RngInt_Certificate (Example H21E6)
certificate
Prime Certificate (RING OF INTEGERS)
change
Changing Coefficient Ring (MULTIVARIATE POLYNOMIAL RINGS)
Changing Order (MULTIVARIATE POLYNOMIAL RINGS)
Changing Rings (MATRIX ALGEBRAS)
Changing Rings (MATRIX GROUPS)
Changing Rings (UNIVARIATE POLYNOMIAL RINGS)
change-order
Changing Order (MULTIVARIATE POLYNOMIAL RINGS)
change-ring
Changing Coefficient Ring (MULTIVARIATE POLYNOMIAL RINGS)
Changing Rings (MATRIX ALGEBRAS)
Changing Rings (MATRIX GROUPS)
Changing Rings (UNIVARIATE POLYNOMIAL RINGS)
ChangeBase
ChangeBase(~G, Q) : GrpPerm, [Elt] ->
ChangeDirectory
ChangeDirectory(s) : MonStgElt ->
ChangeOrder
ChangeOrder(I, Q) : RngMPol, RngMPol -> RngMPol, Map
RngMPol_ChangeOrder (Example H25E18)
ChangeRing
ChangeRing(A, S) : AlgMat, Rng -> AlgMat, Map
ChangeRing(G, S) : GrpMat, Rng -> GrpMat, Map
ChangeRing(M, S) : ModRng, Rng -> ModRng, Map
ChangeRing(I, S) : RngMPol, Rng -> RngMPol
ChangeRing(P, S) : RngUPol, Rng -> RngUPol, Map
RngPol_ChangeRing (Example H24E3)
ChangeUniverse
ChangeUniverse(S, V) : SeqEnum, Str ->
ChangeUniverse(~S, V) : SetEnum, Str ->
Character
Character< R | a_1, ..., a_k> : AlgChtr, FldCycElt, ..., FldCycElt -> AlgChtrElt
character
Character Theory (GROUPS)
CHARACTERS OF FINITE GROUPS
Representation Theory (ABELIAN GROUPS)
Representation Theory (GROUPS)
Representation Theory (MATRIX GROUPS)
Representation Theory (PERMUTATION GROUPS)
Representation Theory (SOLUBLE GROUPS)
Rings, Fields, and Algebras (OVERVIEW)
Strings (OVERVIEW)
character-representation
Representation Theory (ABELIAN GROUPS)
Representation Theory (GROUPS)
Representation Theory (MATRIX GROUPS)
Representation Theory (PERMUTATION GROUPS)
Representation Theory (SOLUBLE GROUPS)
Characteristic
Characteristic(R) : Rng -> RngIntElt
characteristic
Characteristic Subgroups and Normal Structure (GROUPS)
Characteristic Subgroups and Normal Structure (MATRIX GROUPS)
Characteristic Subgroups and Normal Structure (PERMUTATION GROUPS)
Minimal and Characteristic Polynomial (FINITE FIELDS)
Normal Structure and Characteristic Subgroups (ABELIAN GROUPS)
Normal Structure and Characteristic Subgroups (SOLUBLE GROUPS)
characteristic-subgroup-normal-structure
Characteristic Subgroups and Normal Structure (GROUPS)
Characteristic Subgroups and Normal Structure (MATRIX GROUPS)
Characteristic Subgroups and Normal Structure (PERMUTATION GROUPS)
Normal Structure and Characteristic Subgroups (ABELIAN GROUPS)
Normal Structure and Characteristic Subgroups (SOLUBLE GROUPS)
CharacteristicPolynomial
CharacteristicPolynomial(a) : FldFinElt -> RngUPolElt
CharacteristicPolynomial(G) : GrphUnd -> RngUPolElt
CharacteristicPolynomial(a: parameters) : AlgMatElt -> RngUPolElt
CharacteristicPolynomial(g: parameters) : GrpMatElt -> RngPolElt
CharacteristicVector
CharacteristicVector(M, S) : ModRng, { RngIntElt } -> ModRngElt
CharacteristicVector(V, S) : ModTupFld, { RngElt } -> ModTupFldElt
CharacterRing
CharacterRing(G) : Grp -> AlgChtr
CharacterTable
CharacterTable(G) : Grp -> SeqEnum
CharacterTable(G) : GrpAb -> TabChtr
CharacterTable(G) : GrpFin -> TabChtr
CharacterTable(G) : GrpMat -> TabChtr
CharacterTable(G) : GrpPC -> TabChtr
CharacterTable(G) : GrpPerm -> TabChtr
checking
Checking of Maps (MAPPINGS)
ChiefSeries
ChiefSeries(G) : GrpAb -> [GrpAb]
ChiefSeries(G) : GrpPC -> [GrpPC]
ChromaticIndex
ChromaticIndex(G) : GrphUnd -> RngIntElt
ChromaticNumber
ChromaticNumber(G) : GrphUnd -> RngIntElt
Graph_ChromaticNumber (Example H41E3)
cInvariants
cInvariants(E) : GeomEC -> [ RngElt ]
circuit
Connectedness, Paths and Circuits (GRAPHS)
CircuitSpace
[Future release] CircuitSpace(G) : GrphUnd -> ModTup
Class
Class(H, g) : GrpAb, GrpAbElt -> { GrpAbElt }
Class(G, H) : GrpFin, GrpFin -> { GrpFin }
Class(H, x) : GrpFin, GrpFinElt -> { GrpFinElt }
Class(H, x) : GrpMat, GrpMatElt -> { GrpMatElt }
Class(H, g) : GrpPC, GrpPCElt -> { GrpPCElt }
Class(H, x) : GrpPerm, GrpPermElt -> { GrpPermElt }
class
Class Information from a Conjugacy Class Poset (GROUPS)
Ideal Class Group (QUADRATIC FIELDS)
Ideal Class Groups (NUMBER FIELDS AND THEIR ORDERS)
Identifier Classes (MAGMA SEMANTICS)
RESIDUE CLASS RINGS
Structure Creation (CHARACTERS OF FINITE GROUPS)
Unit Group (QUADRATIC FIELDS)
class-group
Ideal Class Group (QUADRATIC FIELDS)
Unit Group (QUADRATIC FIELDS)
class-information
Class Information from a Conjugacy Class Poset (GROUPS)
Classes
ConjugacyClasses(G) : GrpAb -> [ <RngIntElt, RngIntElt, GrpAbElt> ]
ConjugacyClasses(G) : GrpPC -> [ <RngIntElt, RngIntElt, GrpPCElt> ]
ConjugacyClasses(G: parameters) : GrpFin -> [ <RngIntElt, RngIntElt, GrpFinElt> ]
ConjugacyClasses(G: parameters) : GrpMat -> [ < RngIntElt, RngIntElt, GrpMatElt > ]
ConjugacyClasses(G: parameters) : GrpPerm -> [ <RngIntElt, RngIntElt, GrpPermElt> ]
GrpPerm_Classes (Example H16E20)
Grp_Classes (Example H11E13)
classes
Conjugacy Classes of Subgroups (GROUPS)
ClassGroup
ClassGroup(K) : FldQuad -> GrpAb
ClassGroup(O: parameters) : RngOrd -> GrpAb, Map
ClassGroupStructure
ClassGroupStructure(K) : FldQuad -> [ RngIntElt ]
ClassGroupStructure(O: parameters) : RngOrd -> [RngIntElt]
ClassMap
ClassMap(G) : GrpAb -> Map
ClassMap(G) : GrpPC -> Map
ClassMap(G: parameters) : GrpFin -> Map
ClassMap(G: parameters) : GrpMat -> Map
ClassMap(G: parameters) : GrpPerm -> Map
ClassMatrix
ClassMatrix(G, i) : GrpAb, RngIntElt -> AlgMatElt
ClassNumber
ClassNumber(K) : FldQuad -> RngIntElt
ClassNumber(O: parameters) : RngOrd -> RngIntElt
ClassPowerCharacter
ClassPowerCharacter(x, j) : AlgChtrElt, RngIntElt -> AlgChtrElt
ClassRepresentative
ClassRepresentative(G, x) : GrpAb, GrpAbElt -> GrpAbElt
ClassRepresentative(G, x) : GrpFin, GrpFinElt -> GrpFinElt
ClassRepresentative(G, x) : GrpMat, GrpMatElt -> GrpMatElt
ClassRepresentative(G, x) : GrpPC, GrpPCElt -> GrpPCElt
ClassRepresentative(G, x) : GrpPerm, GrpPermElt -> GrpPermElt
clear
Deleting an identifier (OVERVIEW)
ClearPrevious
ClearPrevious() : ->
Clique
Clique(G, n) : GrphUnd, RngIntElt -> { Vert }
clique
Independent Sets, Cliques, Colourings (GRAPHS)
CliqueNumber
CliqueNumber(G) : GrphUnd -> RngIntElt
Closure
[Future release] Closure(r, f) : GrpFPRel, Hom(GrpFP) -> { GrpFPRel }
ClosureGraph
ClosureGraph(P, G) : GrpPerm, GrphUnd -> GrphUnd
cmpeq
x cmpeq y : Elt, Elt -> BoolElt
Co1
GrpFP_Co1 (Example H14E24)
Code
Combinatorial and Geometrical Structures (OVERVIEW)
code
Combinatorial and Geometrical Structures (OVERVIEW)
Construction of Graphs from Groups, Codes and Designs (GRAPHS)
ERROR-CORRECTING CODES
Graphs Constructed from Codes and Designs (GRAPHS)
code-design
Graphs Constructed from Codes and Designs (GRAPHS)
CodeFromMatrix
Code_CodeFromMatrix (Example H44E2)
CodeGraph
[Future release] CodeGraph(C, d) : Code, RngIntElt -> GrphUnd
codes
Incidence Structures, Graphs and Codes (FINITE PLANES)
Incidence Structures, Graphs and Codes (INCIDENCE STRUCTURES AND DESIGNS)
CodeToString
CodeToString(n) : RngIntElt -> MonStgElt
Codomain
Codomain(f) : Map -> Struct
Codomain(a) : ModMatElt -> ModTupFld
Codomain(S) : ModMatRng -> ModTupRng
Coefficient
Coefficient(p, i, k) : RngMPolElt, RngIntElt, RngIntElt -> RngElt
Coefficient(f, i) : RngPowSerElt, RngIntElt -> RngElt
Coefficient(p, i) : RngUPolElt, RngIntElt -> RngElt
coefficient
Changing the Coefficient Field (VECTOR SPACES)
Changing the Coefficient Ring (GENERAL MODULES)
Coefficients and Degree (POWER SERIES AND LAURENT SERIES)
Coefficients and Terms (UNIVARIATE POLYNOMIAL RINGS)
Coefficients, Monomials and Terms (MULTIVARIATE POLYNOMIAL RINGS)
coefficient-degree
Coefficients and Degree (POWER SERIES AND LAURENT SERIES)
coefficient-monomial-term
Coefficients, Monomials and Terms (MULTIVARIATE POLYNOMIAL RINGS)
coefficient-term
Coefficients and Terms (UNIVARIATE POLYNOMIAL RINGS)
CoefficientField
CoefficientField(V) : ModTupFld -> Fld
CoefficientRing
BaseRing(R) : AlgMat -> Rng
BaseRing(F) : FldFun -> Rng
BaseRing(P) : RngMPol -> Rng
BaseRing(R) : RngSer -> Rng
BaseRing(P) : RngUPol -> Rng
CoefficientRing(A) : Alg -> Rng
CoefficientRing(E) : GeomEC -> Rng
CoefficientRing(G) : GrpMat -> Rng
CoefficientRing(M) : ModTupRng -> Rng
CoefficientRing(Q) : RngQPol -> Rng
Coefficients
Coefficients(a) : FldLocElt -> [ RngResElt ]
Coefficients(p) : RngMPolElt -> [ RngElt ]
Coefficients(f) : RngPowSerElt -> [ RngElt ]
Coefficients(p) : RngUPolElt -> [ RngElt ]
aInvariants(E) : GeomEC -> [ RngElt ]
RngMPol_Coefficients (Example H25E4)
Coercion
Coercion(D, C) : Struct, Struct -> Map
FldRat_Coercion (Example H20E1)
RngIntRes_Coercion (Example H22E1)
coercion
Coercion (GROUPS)
Coercion (INTRODUCTION [RINGS AND FIELDS])
Coercion (LOCAL FIELDS)
Coercion (PERMUTATION GROUPS)
Coercion (POWER SERIES AND LAURENT SERIES)
Coercion (QUADRATIC FIELDS)
Coercion (RATIONAL FIELD)
Coercion (REAL AND COMPLEX FIELDS)
Coercion (RESIDUE CLASS RINGS)
Coercion (RING OF INTEGERS)
Coercion between Matrix Structures (MATRIX GROUPS)
Coercion Maps (MAPPINGS)
Coercions Between Groups and Subgroups (ABELIAN GROUPS)
Coercions Between Groups and Subgroups (SOLUBLE GROUPS)
Magmas (or Structures) (OVERVIEW)
CohomologicalDimension
CohomologicalDimension(G, M, i) : GrpFin, ModRng, RngIntElt -> RngIntElt
CohomologicalDimension(G, M, i) : GrpPerm, ModRng, RngIntElt -> RngIntElt
cohomology
Cohomology (GROUPS)
Cohomology (PERMUTATION GROUPS)
Cokernel
[Future release] Cokernel(f) : Map -> Struct
Cokernel(a) : ModMatElt -> ModTupFld
Cokernel(a) : ModMatRngElt -> ModTupRng
Collect
Collect(P, Q) : Process(pQuot), [ <RngIntElt, RngIntElt> ] -> [ RngIntElt ] ->
CollectRelations
CollectRelations(~P) : Process(pQuot) ->
Collineation
Plane_Collineation (Example H43E5)
collineation
Action of Collineations (FINITE PLANES)
The Collineation Group of a Plane (FINITE PLANES)
collineation-action
Action of Collineations (FINITE PLANES)
collineation-group-design
The Collineation Group of a Plane (FINITE PLANES)
CollineationGroup
CollineationGroup(P) : Plane -> GrpPerm
collineations
Central Collineations (FINITE PLANES)
ColonIdeal
ColonIdeal(I, J) : RngMPol, RngMPol -> RngMPol
colouring
Independent Sets, Cliques, Colourings (GRAPHS)
column
Row and Column Operations (MATRIX ALGEBRAS)
Row and Column Operations (THE MODULES Hom_(R)(M, N) AND End(M))
Row and Column Operations (VECTOR SPACES)
combinatorial
Combinatorial and Geometrical Structures (OVERVIEW)
combinatorial-geometrical-incidence
Combinatorial and Geometrical Structures (OVERVIEW)
combinatorics
Combinatorial Functions (RING OF INTEGERS)
command
Performing shell commands from Magma (OVERVIEW)
comment
Comments (OVERVIEW)
Comments and Continuation (MAGMA LANGUAGE)
comment-continuation
Comments and Continuation (MAGMA LANGUAGE)
common
Common Divisors (MULTIVARIATE POLYNOMIAL RINGS)
Common Divisors and Common Multiples (UNIVARIATE POLYNOMIAL RINGS)
commutative
Groups (OVERVIEW)
commutator
Groups (OVERVIEW)
CommutatorSubgroup
CommutatorSubgroup(G, H, K) : GrpAb, GrpAb, GrpAb -> GrpAb
CommutatorSubgroup(G, H, K) : GrpFin, GrpFin, GrpFin -> GrpFin
CommutatorSubgroup(G, H, K) : GrpMat, GrpMat, GrpMat -> GrpMat
CommutatorSubgroup(G, H, K) : GrpPC, GrpPC, GrpPC -> GrpPC
CommutatorSubgroup(G, H, K) : GrpPerm, GrpPerm, GrpPerm -> GrpPerm
comp
comp< R | a_1, ..., a_r > : Rng, RngElt, ..., RngElt -> Rng
compact
CompactPresentation (SOLUBLE GROUPS)
compact-presentation
CompactPresentation (SOLUBLE GROUPS)
CompactPresentation
CompactPresentation(G) : GrpPC -> [RngIntElt]
GrpPC_CompactPresentation (Example H15E12)
CompanionMatrix
CompanionMatrix(p) : RngPolElt -> AlgMatElt
CompanionMatrix(p) : RngUPolElt -> AlgMatElt
comparison
Comparison (MATRIX ALGEBRAS)
Comparison (OVERVIEW)
Comparison (RATIONAL FIELD)
Comparison of and Membership (REAL AND COMPLEX FIELDS)
Comparison of Ring Elements (INTRODUCTION [RINGS AND FIELDS])
Comparison of Ring Elements (RING OF INTEGERS)
CompFactors
GrpPerm_CompFactors (Example H16E19)
Complement
Complement(G) : Grph -> Grph
Complement(D) : Inc -> Inc
Complement(V, U) : ModTupFld, ModTupFld -> ModTupFld
complement
Constructing Complements, Line Graphs; Contraction, Switching (GRAPHS)
The Construction of Related Structures (INCIDENCE STRUCTURES AND DESIGNS)
complement-dual-contraction-residual
The Construction of Related Structures (INCIDENCE STRUCTURES AND DESIGNS)
complement-line-graph-contraction-switching
Constructing Complements, Line Graphs; Contraction, Switching (GRAPHS)
ComplementaryErrorFunction
ComplementaryErrorFunction(r) : FldReElt -> FldReElt
ComplementBasis
ComplementBasis(G) : GrpPC -> [GrpPC]
Complements
Complements(G, H) : GrpPC, GrpPC -> [GrpPC]
Complements(M, S) : ModGrp, ModGrp -> [ ModGrp ]
complements
Complements of Submodules (GENERAL MODULES)
complete
Construction of the Complete Matrix Algebra (MATRIX ALGEBRAS)
complete-magma
Construction of the Complete Matrix Algebra (MATRIX ALGEBRAS)
CompleteDigraph
CompleteDigraph(p) : RngIntElt -> GrphDir
CompleteGraph
CompleteGraph(p) : RngIntElt -> GrphUnd
CompleteKArc
CompleteKArc(P, k) : Plane, RngIntElt -> SetEnum
CompleteUnion
CompleteUnion(G, H) : GrphDir, GrphDir -> GrphDir
CompleteWeightEnumerator
CompleteWeightEnumerator(C): Code -> RngMPolElt
Completion
Completion(R, P) : Rng, Rng -> Fld
completion
Completion (INTRODUCTION [RINGS AND FIELDS])
complex
REAL AND COMPLEX FIELDS
Real and Complex Valued Functions (NUMBER FIELDS AND THEIR ORDERS)
Rings, Fields, and Algebras (OVERVIEW)
ComplexConjugate
ComplexConjugate(a) : FldCycElt -> FldQuadElt
ComplexConjugate(s) : FldPrElt -> FldPrElt
ComplexConjugate(a) : FldQuadElt -> FldQuadElt
ComplexConjugate(q) : FldRatElt -> FldRatElt
ComplexConjugate(n) : RngIntElt -> RngIntElt
ComplexField
ComplexField(p) : RngIntElt -> FldCom
ComplexToPolar
ComplexToPolar(c) : FldComElt -> FldReElt, FldReElt
Component
Component(u) : Vert -> Grph
Components
Components(G) : Grph -> [ { Vert } ]
Composition
f * g : MagFormElt, MagFormElt -> MagFormElt
Composition(f, g) : RngPowElt, RngPowElt -> RngPowElt
Composition(T, q) : [ FldCycElt ], TabChtr -> AlgChtrElt
composition
Composition (MAPPINGS)
Composition and Convolution (POWER SERIES AND LAURENT SERIES)
Composition and Decomposition (CHARACTERS OF FINITE GROUPS)
Composition Series (GENERAL MODULES)
composition-convolution
Composition and Convolution (POWER SERIES AND LAURENT SERIES)
composition-decomposition
Composition and Decomposition (CHARACTERS OF FINITE GROUPS)
composition-series
Composition Series (GENERAL MODULES)
CompositionFactors
CompositionFactors(G) : : GrpFin -> [ <RngIntElt, RngIntElt, RngIntElt> ]
CompositionFactors(G) : : GrpMat -> [ <RngIntElt, RngIntElt, RngIntElt> ]
CompositionFactors(G) : : GrpPerm -> [ <RngIntElt, RngIntElt, RngIntElt> ]
CompositionFactors(M) : ModRng -> [ ModRng ]
CompositionSeries
CompositionSeries(G) : GrpPC -> [GrpPC]
CompositionSeries(M) : ModRng, ModRng -> [ ModRng ], [ ModRng ], AlgMatElt
Compositum
FldNum_Compositum (Example H30E3)
CompSeries
RMod_CompSeries (Example H36E18)
concatenation
Strings (OVERVIEW)
condition
The case expression (OVERVIEW)
The case statement (OVERVIEW)
The if statement (OVERVIEW)
The select expression (OVERVIEW)
conditional
Conditional Statements and Expressions (MAGMA LANGUAGE)
The case expression (OVERVIEW)
The case statement (OVERVIEW)
The if statement (OVERVIEW)
The select expression (OVERVIEW)
conditioned
Conditioned Presentations (SOLUBLE GROUPS)
conditioned-presentation
Conditioned Presentations (SOLUBLE GROUPS)
ConditionedGroup
ConditionedGroup(G) : GrpPC -> GrpPC
Conductor
Conductor(K) : FldCyc -> RngIntElt
Conductor(K) : FldQuad -> RngIntElt
Conductor(Q) : FldRat -> RngIntElt
Conductor(E) : GeomEC -> RngElt
Conic
Conic(p, q, r, s, t) : PlanePt, PlanePt, PlanePt, PlanePt, PlanePt -> SetEnum
conjugacy
Groups (OVERVIEW)
ConjugacyClasses
ConjugacyClasses(G) : GrpAb -> [ <RngIntElt, RngIntElt, GrpAbElt> ]
ConjugacyClasses(G) : GrpPC -> [ <RngIntElt, RngIntElt, GrpPCElt> ]
ConjugacyClasses(G: parameters) : GrpFin -> [ <RngIntElt, RngIntElt, GrpFinElt> ]
ConjugacyClasses(G: parameters) : GrpMat -> [ < RngIntElt, RngIntElt, GrpMatElt > ]
ConjugacyClasses(G: parameters) : GrpPerm -> [ <RngIntElt, RngIntElt, GrpPermElt> ]
Conjugate
Conjugate(a, n) : FldCycElt, RngIntElt -> FldCycElt
Conjugate(a) : FldQuadElt -> FldQuadElt
Conjugate(q) : FldRatElt -> FldRatElt
Conjugate(n) : RngIntElt -> RngIntElt
H ^ g : GrpAb, GrpAbElt -> GrpAb
H ^ g : GrpFin, GrpFinElt -> GrpFin
H ^ u : GrpFP, GrpFPElt -> GrpFP
H ^ g : GrpMat, GrpMatElt -> GrpMat
H ^ g : GrpPC, GrpPCElt -> GrpPC
H ^ g : GrpPerm, GrpPermElt -> GrpPerm
conjugate
Conjugacy (ABELIAN GROUPS)
Conjugacy (MATRIX GROUPS)
Conjugacy (PERMUTATION GROUPS)
Conjugacy (SOLUBLE GROUPS)
Conjugacy Classes of Elements (GROUPS)
Conjugates, Norm and Trace (RATIONAL FIELD)
Conjugates, Norm and Trace (RING OF INTEGERS)
Conjugation of Class Functions (CHARACTERS OF FINITE GROUPS)
Groups (OVERVIEW)
Introduction (SOLUBLE GROUPS)
conjugate-norm-trace
Conjugates, Norm and Trace (RATIONAL FIELD)
Conjugates, Norm and Trace (RING OF INTEGERS)
Conjugates
Class(H, g) : GrpAb, GrpAbElt -> { GrpAbElt }
Class(G, H) : GrpFin, GrpFin -> { GrpFin }
Class(H, x) : GrpFin, GrpFinElt -> { GrpFinElt }
Class(H, x) : GrpMat, GrpMatElt -> { GrpMatElt }
Class(H, g) : GrpPC, GrpPCElt -> { GrpPCElt }
Class(H, x) : GrpPerm, GrpPermElt -> { GrpPermElt }
Conjugates(a) : FldNumElt-> [FldNumElt]
conjugates
Conjugates, Minimal Polynomial (CYCLOTOMIC FIELDS)
Conjugates, Minimal Polynomial (QUADRATIC FIELDS)
conjugates-norm-trace
Conjugates, Minimal Polynomial (CYCLOTOMIC FIELDS)
conjugation
Groups (OVERVIEW)
connectedness
Connectedness, Paths and Circuits (GRAPHS)
connectedness-path-circuit
Connectedness, Paths and Circuits (GRAPHS)
ConnectionNumber
ConnectionNumber(p, B) : IncPt, IncBlk -> RngIntElt
Consistency
Consistency(~P: parameters) : Process(pQuot) ->
constant
Constants (REAL AND COMPLEX FIELDS)
Constituent
Constituent(C, i) : Cop, RngIntElt -> Struct
Constituents
Constituents(M) : ModRng -> [ ModRng ]
ConstituentsWithMultiplicities
ConstituentsWithMultiplicities(M) : ModRng -> [ <ModRng, RngIntElt> ]
construction
Construction of New Ideals (MULTIVARIATE POLYNOMIAL RINGS)
New Rings from Old Ones (INTRODUCTION [RINGS AND FIELDS])
Other Ring Constructions (INTRODUCTION [RINGS AND FIELDS])
Standard Constructions (ABELIAN GROUPS)
Constructions
GrpMat_Constructions (Example H17E11)
RMod_Constructions (Example H36E11)
Constructor
GrpMat_Constructor (Example H17E5)
constructor
Construction of Lists (LISTS)
Constructor (OVERVIEW)
Function Expressions (OVERVIEW)
Procedure Expressions (OVERVIEW)
Sequences (OVERVIEW)
Sets (OVERVIEW)
The Map Constructors (MAPPINGS)
Constructors
Design_Constructors (Example H42E1)
Graph_Constructors (Example H41E1)
GrpPerm_Constructors (Example H16E5)
Plane_Constructors (Example H43E1)
ContainsQuadrangle
ContainsQuadrangle(S) : { PlanePt } -> BoolElt
Content
Content(p) : RngMPolElt -> RngIntElt
Content(p) : RngUPolElt -> RngIntElt
content
Content and Primitive Part (MULTIVARIATE POLYNOMIAL RINGS)
Content and Primitive Part (UNIVARIATE POLYNOMIAL RINGS)
ContentAndPrimitivePart
ContentAndPrimitivePart(p) : RngMPolElt -> RngIntElt, RngMPolElt
ContentAndPrimitivePart(p) : RngUPolElt -> RngIntElt, RngUPolElt
contents
Contents of Database of Finite Perfect Groups (OVERVIEW)
Contents of Database of Groups of Order Dividing 256 (OVERVIEW)
Contents of Database of Groups of Order Dividing 729 (OVERVIEW)
context
The Initial Context (MAGMA SEMANTICS)
continuation
Comments and Continuation (MAGMA LANGUAGE)
continue
The continue statement (OVERVIEW)
continued
Continued Fractions (REAL AND COMPLEX FIELDS)
continued-fraction
Continued Fractions (REAL AND COMPLEX FIELDS)
ContinuedFraction
ContinuedFraction(r) : FldPrElt -> [ RngIntElt ]
Contpp
ContentAndPrimitivePart(p) : RngMPolElt -> RngIntElt, RngMPolElt
ContentAndPrimitivePart(p) : RngUPolElt -> RngIntElt, RngUPolElt
Contract
Contract(e) : Edge -> Grph
Contraction
Contraction(D, p) : Inc, IncPt -> Inc
contraction
Constructing Complements, Line Graphs; Contraction, Switching (GRAPHS)
Extension and Contraction of Ideals (MULTIVARIATE POLYNOMIAL RINGS)
The Construction of Related Structures (INCIDENCE STRUCTURES AND DESIGNS)
control
Control-C key (OVERVIEW)
Quitting (OVERVIEW)
control-\-key
<Ctrl>-\
<Ctrl>-\
control-A-key
<Ctrl>-A
control-B-key
<Ctrl>-B
control-C-key
Control-C key (OVERVIEW)
<Ctrl>-C
<Ctrl>-C
control-D-key
Quitting (OVERVIEW)
<Ctrl>-D
quit;
control-E-key
<Ctrl>-E
control-F-key
<Ctrl>-F
control-H-key
<Ctrl>-H
control-I-key
<Ctrl>-I
control-J-key
<Ctrl>-J
control-K-key
<Ctrl>-K
control-L-key
<Ctrl>-L
control-M-key
<Ctrl>-M
control-N-key
<Ctrl>-N
control-P-key
<Ctrl>-P
control-space-key
<Ctrl>- space
control-U-key
<Ctrl>-U
control-V-key
<Ctrl>-V<char>
control-W-key
<Ctrl>-W
control-X-key
<Ctrl>-X
control-Z-key
<Ctrl>-Z
ControlExtn
GrpFP_ControlExtn (Example H14E11)
conv
Design_conv (Example H42E9)
Convergents
Convergents(s) : [ RngIntElt ] -> ModMatRngElt
conversion
Conversion between Categories (SOLUBLE GROUPS)
Conversion Functions (MAGMA LANGUAGE)
Conversion to a PC-Group (MATRIX GROUPS)
Conversions (REAL AND COMPLEX FIELDS)
Converting between Graphs and Digraphs (GRAPHS)
Creation and Conversion (RING OF INTEGERS)
Element Conversions (RING OF INTEGERS)
Sets from Structures (SETS)
conversion-graph-digraph
Converting between Graphs and Digraphs (GRAPHS)
conversions
Conversion Functions (INCIDENCE STRUCTURES AND DESIGNS)
Conversions (FINITE PLANES)
Convolution
Convolution(f, g) : RngSerElt, RngSerElt -> RngSerElt
convolution
Composition and Convolution (POWER SERIES AND LAURENT SERIES)
ConwayPolynomial
ConwayPolynomial(p, n) : RngIntElt, RngIntElt -> RngUPolElt
Coordinates
Coordinates(C, u) : Code, ModTupFldElt -> [ FldFinElt ]
Coordinates(V, v) : ModTupFld, ModTupFldElt -> [FldElt]
Coordinates(M, u) : ModTupRng, ModTupRngElt -> [RngElt]
Coordinates(I, f) : RngMPol, RngMPolElt -> [ RngMPolElt ]
RngMPol_Coordinates (Example H25E11)
cop
cop< S_1, S_2, ..., S_k > : Struct, Struct, ... -> Cop, [ Map ]
Coproduct_cop (Example H8E1)
coproduct
COPRODUCTS
Core
Core(G, H) : GrpAb, GrpAb -> GrpAb
Core(G, H) : GrpFin, GrpFin -> GrpFin
Core(G, H) : GrpFP, GrpFP -> GrpFP
Core(G, H) : GrpMat, GrpMat -> GrpMat
Core(G, H) : GrpPC, GrpPC -> GrpPC
Core(G, H) : GrpPerm, GrpPerm -> GrpPerm
correcting
Combinatorial and Geometrical Structures (OVERVIEW)
ERROR-CORRECTING CODES
Cos
Cos(c) : FldComElt -> FldComElt
Cos(f) : RngSerElt -> RngSerElt
Cosec
Cosec(c) : FldComElt -> FldComElt
Cosech
Cosech(s) : FldPrElt -> FldPrElt
coset
Action on a Coset Space (GROUPS)
Action on a Coset Space (MATRIX GROUPS)
Action on a Coset Space (PERMUTATION GROUPS)
Coset Leaders (ERROR-CORRECTING CODES)
Coset Spaces (ABELIAN GROUPS)
Coset Spaces (SOLUBLE GROUPS)
Coset Spaces and Tables (FINITELY PRESENTED GROUPS)
Coset Spaces: Construction (FINITELY PRESENTED GROUPS)
Coset Tables (FINITELY PRESENTED GROUPS)
coset-leader
Coset Leaders (ERROR-CORRECTING CODES)
coset-space
Coset Spaces (ABELIAN GROUPS)
Coset Spaces (SOLUBLE GROUPS)
Coset Spaces: Construction (FINITELY PRESENTED GROUPS)
coset-space-action
Action on a Coset Space (GROUPS)
Action on a Coset Space (MATRIX GROUPS)
Action on a Coset Space (PERMUTATION GROUPS)
coset-space-table
Coset Spaces and Tables (FINITELY PRESENTED GROUPS)
coset-table
Coset Tables (FINITELY PRESENTED GROUPS)
CosetAction
CosetAction(G, H) : Grp, Grp -> Hom(Grp), Grp, Grp
CosetAction(G, H) : Grp, Grp -> Hom(Grp), GrpPerm, Grp
CosetAction(G, H) : Grp, Grp -> Hom(Grp), GrpPerm, Grp
CosetAction(G, H) : Grp, Grp -> Hom(Grp), GrpPerm, GrpPerm
CosetAction(G, H) : GrpMat, GrpMat -> Hom(Grp), GrpPerm, GrpMat
GrpMat_CosetAction (Example H17E16)
Grp_CosetAction (Example H11E8)
CosetDistanceDistribution
CosetDistanceDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
CosetGraph
[Future release] CosetGraph(C) : Code -> GrphUnd
CosetImage
CosetImage(G, H) : Grp, Grp -> Grp
CosetImage(G, H) : Grp, Grp -> GrpPerm
CosetImage(G, H) : Grp, Grp -> GrpPerm
CosetImage(G, H) : Grp, Grp -> GrpPerm
CosetImage(G, H) : GrpMat, GrpMat -> GrpPerm
CosetKernel
CosetKernel(G, H) : Grp, Grp -> Grp
CosetKernel(G, H) : Grp, Grp -> Grp
CosetKernel(G, H) : Grp, Grp -> Grp
CosetKernel(G, H) : GrpFP, GrpFP -> GrpFP
CosetKernel(G, H) : GrpMat, GrpMat -> GrpMat
CosetLeaders
CosetLeaders(C) : Code -> {@ ModTupFldElt @}, Map
Code_CosetLeaders (Example H44E13)
CosetSatisfying
CosetsSatisfying(T, S: parameters) : Map, { GrpFPElt }: -> { GrpFPCosElt }
CosetSpace
CosetSpace(G, H: parameters) : GrpFP, GrpFP: -> GrpFPCos
CosetsSatisfying
CosetsSatisfying(T, S: parameters) : Map, { GrpFPElt }: -> { GrpFPCosElt }
CosetTable
CosetTable(G, H) : Grp, Grp -> Hom(Grp)
CosetTable(G, H) : Grp, Grp -> Map
CosetTable(G, H) : GrpFin, GrpFin -> Map
CosetTable(G, H: parameters) : GrpFP, GrpFP -> Map
CosetTableToPermutationGroup
CosetTableToPermutationGroup(G, T) : GrpFP, Map -> GrpPerm
CosetTableToRepresentation
CosetTableToRepresentation(G, T): GrpFP, Map -> Map, GrpPerm, Grp
Cosh
Cosh(s) : FldPrElt -> FldPrElt
Cosh(f) : RngSerElt -> RngSerElt
Cot
Cot(c) : FldComElt -> FldComElt
Coth
Coth(s) : FldPrElt -> FldPrElt
Covalence
Covalence(D, s) : Dsgn, RngIntElt -> RngIntElt
Covalence(S) : { IncPt } -> RngIntElt
CoveringRadius
CoveringRadius(C) : Code -> RngIntElt
Coxeter
Index of a Subgroup: The Todd-Coxeter Algorithm (FINITELY PRESENTED GROUPS)
GrpFP_Coxeter (Example H14E8)
CPU
Timing (OVERVIEW)
Cputime
Timing (OVERVIEW)
Cputime() : -> FldReElt
Create
GrpMat_Create (Example H17E1)
HMod_Create (Example H37E1)
create
Creating Lattices (GENERAL MODULES)
CreateA4wrC3
RMod_CreateA4wrC3 (Example H36E7)
CreateA7
RMod_CreateA7 (Example H36E5)
CreateComplexField
FldRe_CreateComplexField (Example H31E3)
CreateElements
FldRe_CreateElements (Example H31E4)
CreateK35
KMod_CreateK35 (Example H35E2)
CreateK6
RMod_CreateK6 (Example H36E2)
CreateL27
RMod_CreateL27 (Example H36E3)
CreateLattice
RMod_CreateLattice (Example H36E21)
CreateM11
RMod_CreateM11 (Example H36E6)
CreateM12
RMod_CreateM12 (Example H36E4)
CreateMatrices
RMod_CreateMatrices (Example H36E8)
CreateQ6
KMod_CreateQ6 (Example H35E1)
CreateSubgroupPoset
Grp_CreateSubgroupPoset (Example H11E15)
CreateZ6
RMod_CreateZ6 (Example H36E1)
Creation
AlgMat_Creation (Example H38E1)
Elcu_Creation (Example H40E1)
FldLoc_Creation (Example H33E1)
FldNum_Creation (Example H30E2)
creation
Construction of a Base and Strong Generating Set (MATRIX GROUPS)
Construction of a Base and Strong Generating Set (PERMUTATION GROUPS)
Construction of a Codeword (ERROR-CORRECTING CODES)
Construction of a Free Algebra (FINITELY PRESENTED ALGEBRAS)
Construction of a General Digraph (GRAPHS)
Construction of a General Graph (GRAPHS)
Construction of a General Group (GROUPS)
Construction of a General Permutation Group (PERMUTATION GROUPS)
Construction of a Matrix (THE MODULES Hom_(R)(M, N) AND End(M))
Construction of a Vector (VECTOR SPACES)
Construction of a Vector Space (VECTOR SPACES)
Construction of an Incidence Structure (INCIDENCE STRUCTURES AND DESIGNS)
Construction of Elements (GROUPS)
Construction of Free Abelian Group and its Elements (ABELIAN GROUPS)
Construction of Hom_(R)(M, N) (THE MODULES Hom_(R)(M, N) AND End(M))
Construction of Matrix Algebras and their Elements (MATRIX ALGEBRAS)
Construction of Module Elements (GENERAL MODULES)
Creating a G-Set (PERMUTATION GROUPS)
Creating a Record (RECORDS)
Creating a Tuple (TUPLES AND CARTESIAN PRODUCTS)
Creating Edges and Vertices (GRAPHS)
Creating Sequences (SEQUENCES)
Creating Sets (SETS)
Creating the Poset of Subgroup Classes (GROUPS)
Creation Functions (CHARACTERS OF FINITE GROUPS)
Creation Functions (COPRODUCTS)
Creation Functions (CYCLOTOMIC FIELDS)
Creation Functions (ELLIPTIC CURVES)
Creation Functions (FINITE FIELDS)
Creation Functions (MAPPINGS)
Creation Functions (NUMBER FIELDS AND THEIR ORDERS)
Creation Functions (POWER SERIES AND LAURENT SERIES)
Creation Functions (QUADRATIC FIELDS)
Creation Functions (RATIONAL FIELD)
Creation Functions (RATIONAL FUNCTION FIELDS)
Creation Functions (REAL AND COMPLEX FIELDS)
Creation Functions (RESIDUE CLASS RINGS)
Creation Functions (RING OF INTEGERS)
Creation Functions (UNIVARIATE POLYNOMIAL RINGS)
Creation Functions (VALUATION RINGS)
Creation of an Elliptic Curve (ELLIPTIC CURVES)
Creation of Booleans (MAGMA LANGUAGE)
Creation of Cyclotomic Fields (CYCLOTOMIC FIELDS)
Creation of Elements (FINITE FIELDS)
Creation of Elements (INTRODUCTION [RINGS AND FIELDS])
Creation of Elements (LOCAL FIELDS)
Creation of Elements (POWER SERIES AND LAURENT SERIES)
Creation of Ideals (MULTIVARIATE POLYNOMIAL RINGS)
Creation of Ideals and Quotients (UNIVARIATE POLYNOMIAL RINGS)
Creation of New Lists (LISTS)
Creation of Points (ELLIPTIC CURVES)
Creation of Polynomial Rings and Polynomials (MULTIVARIATE POLYNOMIAL RINGS)
Creation of Quotient Rings (MULTIVARIATE POLYNOMIAL RINGS)
Creation of Strings (MAGMA LANGUAGE)
Creation of Structures (LOCAL FIELDS)
Creation of the General Linear Group and its Elements (MATRIX GROUPS)
Creation of the Symmetric Group and Arithmetic with Permutations (PERMUTATION GROUPS)
Creation of Vector Spaces and Arithmetic with Vectors (VECTOR SPACES)
Defining a Quadratic Form (VECTOR SPACES)
Defining Ideals and Quotient Rings (INTRODUCTION [RINGS AND FIELDS])
Definition of a Code (ERROR-CORRECTING CODES)
Definition of a Module (GENERAL MODULES)
Definition of Soluble Groups using Power-conjugate Presentations (SOLUBLE GROUPS)
Element Constructors and Selectors (LOCAL FIELDS)
General Constructions (MATRIX GROUPS)
Specification of a Subgroup (FINITELY PRESENTED GROUPS)
Structure Creation (CHARACTERS OF FINITE GROUPS)
The Automorphism Group Function (GRAPHS)
The Automorphism Group Function (INCIDENCE STRUCTURES AND DESIGNS)
The Cartesian Product Constructor (TUPLES AND CARTESIAN PRODUCTS)
The Collineation Group Function (FINITE PLANES)
The Construction of a Matrix Group (MATRIX GROUPS)
The Construction of a Permutation Group (PERMUTATION GROUPS)
The Construction of a Vector Space (VECTOR SPACES)
The Construction of Direct Sums and Tensor Products (MATRIX ALGEBRAS)
The Construction of Finitely Presented Groups (FINITELY PRESENTED GROUPS)
The Construction of Finitely Presented Groups (FINITELY PRESENTED GROUPS)
The Construction of Free Semigroups and their Elements (FINITELY PRESENTED SEMIGROUPS)
The Construction of p-Quotients (FINITELY PRESENTED GROUPS)
The Record Format Constructor (RECORDS)
The Subcode Constructor (ERROR-CORRECTING CODES)
FldQuad_creation (Example H28E2)
creation-arithmetic
Creation of Vector Spaces and Arithmetic with Vectors (VECTOR SPACES)
creation-class-function-ring
Structure Creation (CHARACTERS OF FINITE GROUPS)
creation-curve
Creation of an Elliptic Curve (ELLIPTIC CURVES)
creation-digraph
Construction of a General Digraph (GRAPHS)
creation-element
Construction of a Matrix (THE MODULES Hom_(R)(M, N) AND End(M))
Construction of a Vector (VECTOR SPACES)
Creating a Tuple (TUPLES AND CARTESIAN PRODUCTS)
Creation of Elements (INTRODUCTION [RINGS AND FIELDS])
Creation of Elements (LOCAL FIELDS)
Creation of Elements (POWER SERIES AND LAURENT SERIES)
Definition of Soluble Groups using Power-conjugate Presentations (SOLUBLE GROUPS)
Element Constructors and Selectors (LOCAL FIELDS)
creation-format
The Record Format Constructor (RECORDS)
creation-general
Construction of a General Group (GROUPS)
Construction of a General Permutation Group (PERMUTATION GROUPS)
creation-general-linear-group
Creation of the General Linear Group and its Elements (MATRIX GROUPS)
creation-general-matrix-group
General Constructions (MATRIX GROUPS)
creation-graph
Construction of a General Graph (GRAPHS)
creation-incidence-structure
Construction of an Incidence Structure (INCIDENCE STRUCTURES AND DESIGNS)
creation-magma
Construction of a Vector Space (VECTOR SPACES)
The Cartesian Product Constructor (TUPLES AND CARTESIAN PRODUCTS)
creation-module
Definition of a Module (GENERAL MODULES)
creation-point
Creation of Points (ELLIPTIC CURVES)
creation-quadratic-form
Defining a Quadratic Form (VECTOR SPACES)
creation-record
Creating a Record (RECORDS)
creation-symmetric
Construction of Elements (GROUPS)
Creation of the Symmetric Group and Arithmetic with Permutations (PERMUTATION GROUPS)
Cunningham
Cunningham(b, k, c) : RngIntElt, RngIntElt, RngIntElt -> SeqEnum
curly
Sets (OVERVIEW)
curly-bracket
Sets (OVERVIEW)
curve
Combinatorial and Geometrical Structures (OVERVIEW)
Creation of an Elliptic Curve (ELLIPTIC CURVES)
ELLIPTIC CURVES
CutVertices
CutVertices(G) : Grph -> { Vert }
CycleStructure
CycleStructure(g) : GrpPermElt -> [ <RngIntElt, RngIntElt> ]
cyclic
Construction of General Cyclic Codes (ERROR-CORRECTING CODES)
CyclicCode
CyclicCode(u) : ModTupFldElt -> Code
Code_CyclicCode (Example H44E6)
CyclicGroup
CyclicGroup(C, n) : Cat, RngIntElt -> GrpFin
CyclicGroup(GrpFP, n) : Cat, RngIntElt -> GrpFP
CyclicGroup(GrpPC, n) : Cat, RngIntElt -> GrpPC
CyclicGroup(GrpPerm, n) : Cat, RngIntElt -> GrpPerm
cyclotomic
CYCLOTOMIC FIELDS
Functions Returning a Scalar (CHARACTERS OF FINITE GROUPS)
Rings, Fields, and Algebras (OVERVIEW)
CyclotomicField
CyclotomicField(m) : RngIntElt -> FldCyc
CyclotomicOrder
CyclotomicOrder(K) : FldCyc -> RngIntElt
[____] [____] [_____] [____] [__] [Index] [Root]