[____] [____] [_____] [____] [__] [Index] [Root]

Subindex: context  ..  conversion


context

   The Initial Context (MAGMA SEMANTICS)

continuation

   Comments and Continuation (STATEMENTS AND EXPRESSIONS)

Continue

   CanContinueEnumeration(P) : GrpFPCosetEnumProc -> BoolElt
   ContinueEnumeration(~P: parameters) : GrpFPCosetEnumProc ->

continue

   Early Exit from Iterative Statements (STATEMENTS AND EXPRESSIONS)
   The continue statement (OVERVIEW)

continue-break

   Early Exit from Iterative Statements (STATEMENTS AND EXPRESSIONS)

Continued

   ContinuedFraction(r) : FldPrElt -> [ RngIntElt ]

continued

   Continued Fractions (REAL AND COMPLEX FIELDS)

continued-fraction

   Continued Fractions (REAL AND COMPLEX FIELDS)

ContinuedFraction

   ContinuedFraction(r) : FldPrElt -> [ RngIntElt ]

ContinueEnumeration

   ContinueEnumeration(~P: parameters) : GrpFPCosetEnumProc ->

Contpp

   Contpp(f) : RngMPolElt -> RngIntElt, RngMPolElt
   ContentAndPrimitivePart(f) : RngMPolElt -> RngIntElt, RngMPolElt
   ContentAndPrimitivePart(p) : RngUPolElt -> RngIntElt, RngUPolElt

contr

   Vertex Insertion, Contraction (NETWORKS)

Contract

   Contract(e) : GrphEdge -> Grph
   Contract(u, v) : GrphVert, GrphVert -> Grph
   Contract(u, v) : GrphVert, GrphVert -> GrphNet
   Contract(S) : { GrphVert } -> Grph
   Contract(S) : { GrphVert } -> GrphNet

Contraction

   Contraction(D, b) : Inc, IncBlk -> Inc
   Contraction(D, p) : Inc, IncPt -> Inc

contraction

   Constructing Complements, Line Graphs; Contraction, Switching (GRAPHS)
   Extension and Contraction of Ideals (IDEAL THEORY AND GRÖBNER BASES)

Contribution

   GenusContribution(g) : GrphRes -> RngIntElt

control

   Control-C key (OVERVIEW)
   Controlling Selection of a Base (MATRIX GROUPS)
   Quitting (OVERVIEW)

control--key

   <Ctrl>-\
   <Ctrl>-\

control-_-key

   <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-Y-key

   <Ctrl>-Y

control-Z-key

   <Ctrl>-Z

ControlExtn

   GrpFP_1_ControlExtn (Example H26E15)

ContructFromMatrix

   GrpFPCox_ContructFromMatrix (Example H83E1)

conv

   Design_conv (Example H104E10)

Convergents

   Convergents(s) : [ RngIntElt ] -> ModMatRngElt

Converse

   Converse(G) : GrphDir -> GrphDir

Conversion

   GrpAtc_Conversion (Example H31E9)
   GrpRWS_Conversion (Example H30E8)
   MonRWS_Conversion (Example H15E8)

conversion

   Automatic Conversions (BRAID GROUPS)
   Character Conversion (INPUT AND OUTPUT)
   Construction of the Standard Presentation for a Coxeter Group (FINITELY PRESENTED GROUPS)
   Conversion between Categories (POLYCYCLIC GROUPS)
   Conversion from a Special Form of FP-Group (FINITELY PRESENTED GROUPS)
   Conversion Functions (INCIDENCE GEOMETRY)
   Conversion Functions (INCIDENCE STRUCTURES AND DESIGNS)
   Conversion to a Finitely Presented Group (AUTOMATIC GROUPS)
   Conversion to a Finitely Presented Group (GROUPS DEFINED BY REWRITE SYSTEMS)
   Conversion to a Finitely Presented Monoid (MONOIDS GIVEN BY REWRITE SYSTEMS)
   Conversion to a PC-Group (MATRIX GROUPS)
   Conversion to and from Dense Matrices (SPARSE MATRICES)
   Conversion to number fields (CLASS FIELD THEORY)
   Conversions (REAL AND COMPLEX FIELDS)
   Converting between Graphs and Digraphs (GRAPHS)
   Converting between Networks and Simple Graphs (NETWORKS)
   Creation and Conversion (RING OF INTEGERS)
   Element Conversions (RING OF INTEGERS)
   Sets from Structures (SETS)


[____] [____] [_____] [____] [__] [Index] [Root]