[____] [____] [_____] [____] [__] [Index] [Root]
Index B
B
b
BachBound(K) : FldNum -> RngIntElt
BachBound(K) : FldNum -> RngIntElt
<Delete>
<Backspace>
BadPrimes(E) : CrvEll -> [ RngIntElt ]
BadPrimes(C) : CrvHyp -> SeqEnum
BadPrimes(J) : JacHyp -> SeqEnum
BadPrimes(E) : CrvEll -> [ RngIntElt ]
BadPrimes(C) : CrvHyp -> SeqEnum
BadPrimes(J) : JacHyp -> SeqEnum
BaerDerivation(q2) : RngIntElt -> PlaneAff, PlanePtSet, PlaneLnSet
BaerSubplane(P) : PlaneProj -> PlaneProj, PlanePtSet, PlaneLnSet
Plane_baer (Example H95E14)
BaerDerivation(q2) : RngIntElt -> PlaneAff, PlanePtSet, PlaneLnSet
BaerSubplane(P) : PlaneProj -> PlaneProj, PlanePtSet, PlaneLnSet
IsBalanced(D, t: parameters) : Inc, RngIntElt -> BoolElt, RngIntElt
Ball(u, n) : GrphVert, RngIntElt -> { GrphVert }
Ball(u, n) : Vert, RngIntElt -> { GrphVert }
Bang(D, C) : Struct, Struct -> Map
Coercion(D, C) : Struct, Struct -> Map
Base(G) : GrpMat -> [Elt]
Base(G) : GrpPerm -> [Elt]
BaseChange(E, h) : CrvEll, Map -> CrvEll
BaseChange(E, K) : CrvEll, Rng -> CrvEll
BaseChange(E, n) : CrvEll, RngIntElt -> CrvEll
BaseChange(J, j) : JacHyp, Map -> JacHyp
BaseChange(J, F) : JacHyp, Rng -> JacHyp
BaseChange(J, n) : JacHyp, RngIntElt -> JacHyp
BaseChange(C, K) : Sch, Fld -> Sch
BaseChange(A,m) : Sch, Map -> Sch
BaseChange(C, j) : Sch, Map -> Sch
BaseChange(C, n) : Sch, RngIntElt -> Sch
BaseChange(C, n) : Sch, RngIntElt -> Sch
BaseChange(X, n) : Sch, RngIntElt -> Sch
BaseChange(C,m) : Sch,Map -> Sch
BaseChange(A,K) : Sch,Rng -> Sch
BaseChange(C,K) : Sch,Rng -> Sch
BaseChange(C,A) : Sch,Sch -> Sch
BaseChange(X,A) : Sch,Sch -> Sch
BaseChange(F,K) : SeqEnum,Rng -> SeqEnum
BaseChange(K, j) : SrfKum, Map -> SrfKum
BaseChange(K, F) : SrfKum, Rng -> SrfKum
BaseChange(K, n): SrfKum, RngIntElt -> SrfKum
BaseChangeMatrix(A) : AlgBas -> ModAlg
BaseComponent(L) : LinSys -> SchProj
BaseCurve(X) : CrvMod -> CrvMod, MapSch
BaseExtend(G, R) : GrpDrch, Rng -> GrpDrch
BaseExtend(G, R, z) : GrpDrch, Rng, RngElt -> GrpDrch
BaseExtend(M,R) : ModBrdt, Rng -> ModBrdt
BaseExtend(M, phi) : ModFrm, Map -> ModFrm, Map
BaseExtend(M, R) : ModFrm, Rng -> ModFrm, Map
BaseField(A) : AlgQuat -> Fld
BaseField(Q) : FldRat -> FldRat
BaseField(J) : JacHyp -> Fld
CoefficientRing(J) : JacHyp -> Rng
BaseField(C) : Sch -> Fld
CoefficientRing(C) : Sch -> Fld
BaseField(K) : SrfKum -> Fld
CoefficientRing(K) : SrfKum -> Rng
BaseImage(x) : GrpPermElt -> [Elt]
BaseMPolynomial(n, m, d) : RngIntElt, RngIntElt, RngIntElt -> RngMPolElt
BaseModule(R, S) : AlgMat, Rng -> ModTup
BasePoint(G, i) : GrpMat, RngIntElt -> Elt
BasePoint(G, i) : GrpPerm, RngIntElt -> Elt
BasePoints(L) : LinSys -> SeqEnum
BasePoints(f) : MapSch -> SetEnum
BaseRing(B) : AlgBas -> Rng
BaseRing(R) : AlgMat -> Rng
BaseRing(S) : AlgQuatOrd -> Rng
BaseRing(E) : CrvEll -> Rng
BaseRing(F) : Fld -> Rng
CoefficientRing(F) : FldFun -> Rng
BaseRing(F) : FldFunRat -> Rng
BaseRing( G ) : GrpLie -> Rng
BaseRing(G) : GrpPSL2 -> Rng
BaseRing(L) : Lat -> Rng
BaseRing(M) : ModBrdt -> Rng
BaseRing(M) : ModOrd -> Rng
BaseRing(A) : Mtrx -> Rng
BaseRing(F) : RngFunOrd -> Rng
BaseRing(P) : RngMPol -> Rng
BaseRing(O) : RngOrd -> Rng
BaseRing(R) : RngSer -> Rng
BaseRing(P) : RngUPol -> Rng
BaseRing(C) : Sch -> Rng
BaseField(C) : Sch -> Fld
BaseRing(X) : Sch -> Rng
BaseRing(G) : SchGrpEll -> Rng
BaseScheme(L) : LinSys -> SchProj
BaseScheme(f) : MapSch -> Sch
ChangeBase(~G, Q) : GrpPerm, [Elt] ->
ChangeRing(L, S) : Lat, Rng -> Lat, Map
BaseExtend(L, S) : Lat, Rng -> Lat, Map
CoefficientField(V) : ModTupFld -> Fld
CoefficientRing(A) : AlgGen -> Rng
CoefficientRing(G) : GrpMat -> Rng
CoefficientRing(M) : ModMPol -> ModMPol
CoefficientRing(M) : ModTupRng -> Rng
CoefficientRing(M) : ModTupRng -> Rng
CoefficientRing(X) : Sch -> Fld
GoodBasePoints(G: parameters) : GrpMat -> []
GroundField(F) : FldAlg -> Fld
IsBasePointFree(L) : LinSys -> BoolElt
Base and Strong Generating Set (MATRIX GROUPS)
Base and Strong Generating Set (PERMUTATION GROUPS)
Base Change (PLANE ALGEBRAIC CURVES)
Base Change for Schemes (SCHEMES)
Base Extension (MODULAR FORMS)
Base Ring and Base Change (LATTICES)
Construction of a Base and Strong Generating Set (PERMUTATION GROUPS)
Scheme_base-change-schemes (Example H81E9)
Base Extension (MODULAR FORMS)
BaseChange(L, S) : Lat, Rng -> Lat, Map
BaseExtend(L, S) : Lat, Rng -> Lat, Map
Base Ring and Base Change (LATTICES)
Changing the Base Ring (HYPERELLIPTIC CURVES)
BaseExtend(J, n) : JacHyp, RngIntElt -> JacHyp
Changing the Base Ring (HYPERELLIPTIC CURVES)
BaseExtend(K, n): SrfKum, RngIntElt -> SrfKum
Changing the Base Ring (HYPERELLIPTIC CURVES)
BaseRing(C) : Sch -> Fld
CoefficientRing(C) : Sch -> Fld
Base Ring (HYPERELLIPTIC CURVES)
BaseRing(J) : JacHyp -> Rng
CoefficientRing(J) : JacHyp -> Rng
Base Ring (HYPERELLIPTIC CURVES)
BaseRing(K) : SrfKum -> Rng
CoefficientRing(K) : SrfKum -> Rng
Base Ring (HYPERELLIPTIC CURVES)
BaseExtend(E, h) : CrvEll, Map -> CrvEll
BaseChange(E, h) : CrvEll, Map -> CrvEll
BaseChange(E, K) : CrvEll, Rng -> CrvEll
BaseChange(E, n) : CrvEll, RngIntElt -> CrvEll
BaseChange(J, j) : JacHyp, Map -> JacHyp
BaseChange(J, F) : JacHyp, Rng -> JacHyp
BaseChange(J, n) : JacHyp, RngIntElt -> JacHyp
BaseChange(C, K) : Sch, Fld -> Sch
BaseChange(A,m) : Sch, Map -> Sch
BaseChange(C, j) : Sch, Map -> Sch
BaseChange(C, n) : Sch, RngIntElt -> Sch
BaseChange(C, n) : Sch, RngIntElt -> Sch
BaseChange(X, n) : Sch, RngIntElt -> Sch
BaseChange(C,m) : Sch,Map -> Sch
BaseChange(A,K) : Sch,Rng -> Sch
BaseChange(C,K) : Sch,Rng -> Sch
BaseChange(C,A) : Sch,Sch -> Sch
BaseChange(X,A) : Sch,Sch -> Sch
BaseChange(F,K) : SeqEnum,Rng -> SeqEnum
BaseChange(K, j) : SrfKum, Map -> SrfKum
BaseChange(K, F) : SrfKum, Rng -> SrfKum
BaseChange(K, n): SrfKum, RngIntElt -> SrfKum
ChangeRing(L, S) : Lat, Rng -> Lat, Map
BaseChangeMatrix(A) : AlgBas -> ModAlg
BaseComponent(L) : LinSys -> SchProj
BaseCurve(X) : CrvMod -> CrvMod, MapSch
BaseExtend(E, h) : CrvEll, Map -> CrvEll
BaseChange(E, h) : CrvEll, Map -> CrvEll
BaseChange(E, K) : CrvEll, Rng -> CrvEll
BaseChange(E, n) : CrvEll, RngIntElt -> CrvEll
BaseChange(J, j) : JacHyp, Map -> JacHyp
BaseChange(J, F) : JacHyp, Rng -> JacHyp
BaseChange(J, n) : JacHyp, RngIntElt -> JacHyp
BaseChange(C, K) : Sch, Fld -> Sch
BaseChange(A,m) : Sch, Map -> Sch
BaseChange(C, j) : Sch, Map -> Sch
BaseChange(C, n) : Sch, RngIntElt -> Sch
BaseChange(X, n) : Sch, RngIntElt -> Sch
BaseChange(A,K) : Sch,Rng -> Sch
BaseChange(X,A) : Sch,Sch -> Sch
BaseChange(F,K) : SeqEnum,Rng -> SeqEnum
BaseChange(K, j) : SrfKum, Map -> SrfKum
BaseChange(K, F) : SrfKum, Rng -> SrfKum
BaseChange(K, n): SrfKum, RngIntElt -> SrfKum
BaseExtend(G, R) : GrpDrch, Rng -> GrpDrch
BaseExtend(G, R, z) : GrpDrch, Rng, RngElt -> GrpDrch
BaseExtend(M,R) : ModBrdt, Rng -> ModBrdt
BaseExtend(M, phi) : ModFrm, Map -> ModFrm, Map
BaseExtend(M, R) : ModFrm, Rng -> ModFrm, Map
ChangeRing(L, S) : Lat, Rng -> Lat, Map
CrvEll_BaseExtend (Example H85E2)
ModForm_BaseExtend (Example H90E4)
CrvHyp_BaseExtension (Example H86E2)
BaseRing(A) : AlgQuat -> Fld
BaseField(A) : AlgQuat -> Fld
BaseField(Q) : FldRat -> FldRat
BaseField(J) : JacHyp -> Fld
BaseField(C) : Sch -> Fld
BaseField(K) : SrfKum -> Fld
BaseRing(F) : Fld -> Rng
BaseRing(C) : Sch -> Rng
CoefficientField(V) : ModTupFld -> Fld
CoefficientRing(X) : Sch -> Fld
GroundField(F) : FldAlg -> Fld
BaseImage(x) : GrpPermElt -> [Elt]
BaseModule(R, S) : AlgMat, Rng -> ModTup
BaseMPolynomial(n, m, d) : RngIntElt, RngIntElt, RngIntElt -> RngMPolElt
BasePoint(G, i) : GrpMat, RngIntElt -> Elt
BasePoint(G, i) : GrpPerm, RngIntElt -> Elt
BasePoints(L) : LinSys -> SeqEnum
BasePoints(f) : MapSch -> SetEnum
BaseRing(A) : AlgQuat -> Fld
BaseField(A) : AlgQuat -> Fld
BaseField(J) : JacHyp -> Fld
BaseField(C) : Sch -> Fld
BaseField(K) : SrfKum -> Fld
BaseRing(B) : AlgBas -> Rng
BaseRing(R) : AlgMat -> Rng
BaseRing(S) : AlgQuatOrd -> Rng
BaseRing(E) : CrvEll -> Rng
BaseRing(F) : Fld -> Rng
BaseRing(F) : FldFunRat -> Rng
BaseRing( G ) : GrpLie -> Rng
BaseRing(G) : GrpPSL2 -> Rng
BaseRing(L) : Lat -> Rng
BaseRing(M) : ModBrdt -> Rng
BaseRing(M) : ModOrd -> Rng
BaseRing(A) : Mtrx -> Rng
BaseRing(F) : RngFunOrd -> Rng
BaseRing(P) : RngMPol -> Rng
BaseRing(O) : RngOrd -> Rng
BaseRing(R) : RngSer -> Rng
BaseRing(P) : RngUPol -> Rng
BaseRing(C) : Sch -> Rng
BaseRing(X) : Sch -> Rng
BaseRing(G) : SchGrpEll -> Rng
CoefficientRing(A) : AlgGen -> Rng
CoefficientRing(G) : GrpMat -> Rng
CoefficientRing(M) : ModMPol -> ModMPol
CoefficientRing(M) : ModTupRng -> Rng
CoefficientRing(M) : ModTupRng -> Rng
Bases (MODULAR FORMS)
ModForm_Bases (Example H90E6)
RngOrd_Bases (Example H53E14)
Bases (ALGEBRAS)
Bases (MATRIX ALGEBRAS)
Bases (MODULAR SYMBOLS)
BaseScheme(L) : LinSys -> SchProj
BaseScheme(f) : MapSch -> Sch
BasicAlgebra(FA, N, LR, R) : AlgFP, RngIntElt, SeqEnum, SeqEnum -> AlgBas
BasicAlgebra(G, k) : GrpPerm, FldFin -> AlgBas
BasicAlgebra(Q) : SeqEnum[Tup] -> AlgBas
BasicDegrees( W ) : GrpCox -> RngIntElt
BasicOrbit(G, i) : GrpMat, RngIntElt -> SetIndx
BasicOrbit(G, i) : GrpPerm, RngIntElt -> SetIndx
BasicOrbitLength(G, i) : GrpMat, RngIntElt -> RngIntElt
BasicOrbitLength(G, i) : GrpPerm, RngIntElt -> RngIntElt
BasicOrbitLengths(G) : GrpMat -> [RngIntElt]
BasicOrbitLengths(G) : GrpPerm -> [RngIntElt]
BasicOrbits(G) : GrpPerm -> [SetIndx]
BasicStabilizer(G, i) : GrpMat, RngIntElt -> GrpMat
BasicStabilizer(G, i) : GrpPerm, RngIntElt -> GrpPerm
BasicStabilizerChain(G) : GrpMat -> [GrpMat]
BasicStabilizerChain(G) : GrpPerm -> [GrpPerm]
IsMemberBasicOrbit(G, i, a) : GrpPerm, RngIntElt, Elt -> BoolElt
BASIC ALGEBRAS
Basic Attributes of Schemes (SCHEMES)
Basic Functions (DATABASES OF GROUPS)
Basic Small Group Functions (DATABASES OF GROUPS)
Functions of the Ambient Space (SCHEMES)
GrpPSL2_basic-example (Example H33E1)
Basic Functions (DATABASES OF GROUPS)
Basic Small Group Functions (DATABASES OF GROUPS)
GrpAtc_BasicAccess (Example H31E4)
GrpPerm_BasicAccess (Example H20E4)
GrpRWS_BasicAccess (Example H30E4)
MonRWS_BasicAccess (Example H18E4)
BasicAlgebra(FA, N, LR, R) : AlgFP, RngIntElt, SeqEnum, SeqEnum -> AlgBas
BasicAlgebra(G, k) : GrpPerm, FldFin -> AlgBas
BasicAlgebra(Q) : SeqEnum[Tup] -> AlgBas
AlgBas_BasicAlgebras (Example H79E1)
BasicDegrees( W ) : GrpCox -> RngIntElt
GrpCox_BasicDegrees (Example H36E8)
RootDtm_BasicOperations (Example H35E6)
BasicOrbit(G, i) : GrpMat, RngIntElt -> SetIndx
BasicOrbit(G, i) : GrpPerm, RngIntElt -> SetIndx
BasicOrbitLength(G, i) : GrpMat, RngIntElt -> RngIntElt
BasicOrbitLength(G, i) : GrpPerm, RngIntElt -> RngIntElt
BasicOrbitLengths(G) : GrpMat -> [RngIntElt]
BasicOrbitLengths(G) : GrpPerm -> [RngIntElt]
BasicOrbits(G) : GrpPerm -> [SetIndx]
GrpPerm_BasicProperties (Example H20E5)
ModForm_Basics (Example H90E1)
BasicStabiliser(G, i) : GrpMat, RngIntElt -> GrpMat
BasicStabilizer(G, i) : GrpMat, RngIntElt -> GrpMat
BasicStabilizer(G, i) : GrpPerm, RngIntElt -> GrpPerm
BasicStabiliserChain(G) : GrpMat -> [GrpMat]
BasicStabilizerChain(G) : GrpMat -> [GrpMat]
BasicStabilizerChain(G) : GrpPerm -> [GrpPerm]
BasicStabiliser(G, i) : GrpMat, RngIntElt -> GrpMat
BasicStabilizer(G, i) : GrpMat, RngIntElt -> GrpMat
BasicStabilizer(G, i) : GrpPerm, RngIntElt -> GrpPerm
BasicStabiliserChain(G) : GrpMat -> [GrpMat]
BasicStabilizerChain(G) : GrpMat -> [GrpMat]
BasicStabilizerChain(G) : GrpPerm -> [GrpPerm]
AbelianBasis(G) : GrpFin -> [ GrpFinElt ], [ RngIntElt ]
AbelianBasis(G) : GrpPC -> [ GrpPCElt ], [ RngIntElt ]
AbsoluteBasis(K) : FldAlg -> [FldAlgElt]
Basis(B) : AlgBas -> SeqEnum
Basis(A) : AlgGen -> [ AlgGenElt ]
Basis(R) : AlgMat -> [ AlgMatElt ]
Basis(A) : AlgQuat -> SeqEnum
Basis(S) : AlgQuatOrd -> SeqEnum
Basis(C) : Code -> [ ModTupRngElt ]
Basis(C) : Code -> [ ModTupRngElt ]
Basis(D) : DivCrvElt -> SeqEnum
Basis(F) : FldFun -> SeqEnum[FldFunElt]
Basis(Q) : FldRat -> [FldRatElt]
Basis(L) : Lat -> [ FldReElt ]
Basis(M) : ModBrdt -> SeqEnum
Basis(M) : ModFrm -> SeqEnum
Basis(M) : ModMPol -> RngMPolElt
Basis(M) : ModOrd -> SeqEnum
Basis(M) : ModSym -> SeqEnum
Basis(V) : ModTupFld -> [ModTupFldElt]
Basis(M) : ModTupRng -> [ModTupRngElt]
Basis(D : parameters) : DivFunElt -> [ FldFunElt ]
Basis(O) : RngFunOrd -> SeqEnum[FldFunElt]
Basis(I) : RngFunOrdIdl -> [FldFunElt]
Basis(I) : RngMPol -> RngMPolElt
Basis(O) : RngOrd -> [ FldOrdElt ]
Basis(I) : RngOrdIdl -> [RngOrdElt]
BasisElement(A, i) : AlgGen, RngIntElt -> AlgGenElt
BasisElement(R, i) : AlgMat, RngIntElt -> AlgMatElt
BasisElement(M, i) : ModMPol, RngIntElt -> RngMPolElt
BasisElement(V, i) : ModTupFld, RngIntElt -> ModTupFldElt
BasisElement(I, i) : RngMPol, RngIntElt -> RngMPolElt
BasisMatrix(S) : AlgGrpSub -> ModMatRngElt
BasisMatrix(L) : Lat -> ModMatRngElt
BasisMatrix(M) : ModMPol -> ModMatRngElt
BasisMatrix(V) : ModTupFld -> ModMatElt
BasisMatrix(I) : RngFunOrdIdl -> AlgMatElt
BasisMatrix(O) : RngOrd -> AlgMatElt
BasisMatrix(I) : RngOrdFracIdl -> MtrxSpcElt
BasisOfDifferentialsFirstKind(F) : FldFunG -> SeqEnum[DiffFunElt]
BasisProduct(A, i, j) : AlgGen, RngIntElt, RngIntElt -> AlgGenElt
BasisProducts(A) : AlgGen -> [[ AlgGenElt ]]
CharacterTable(G) : Grp -> SeqEnum
ComplementBasis(G) : GrpPC -> [GrpPC]
CoprimeBasis(S) : [ RngIntElt ] -> [ RngIntElt ]
DifferentialBasis(D) : DivCrvElt -> SeqEnum
DifferentialBasis(D) : DivFunElt -> [DiffFunElt]
DifferentialBasis(D) : DivFunElt -> [DiffFunElt]
DualBasisLattice(L) : Lat -> Lat
ExtendBasis(S, A) : AlgGen, AlgGen -> [ AlgElt ]
ExtendBasis(U, V) : ModTupFld, ModTupFld -> [ModTupFldElt]
ExtendBasis(Q, U) : [ModTupFldElt], ModTupFld -> [ModTupFldElt]
FactorBasis(K, B) : FldNum, RngIntElt -> [ RngOrdIdl ]
FactorBasis(O) : RngOrd -> [ RngOrdIdl ], Integer
GeneratorMatrix(C) : Code -> ModMatFldElt
GroebnerBasis(I: parameters) : RngMPol -> RngMPolElt
GroebnerBasis(S, d : parameters) : [ RngMPol ], RngInt -> RngMPolElt
GroebnerBasis(S, d: parameters) : [ RngMPol ], RngInt -> RngMPolElt
GroebnerBasis(S: parameters) : [ RngMPolElt ] -> [ RngMPolElt ]
GroebnerBasis(X) : Sch -> SeqEnum
GroebnerBasisUnreduced(S: parameters) : [ RngMPolElt ] -> [ RngMPolElt ]
HasGroebnerBasis(I) : RngMPol -> BoolElt
HilbertGroebnerBasis(S, H) : [ RngMPolElt ], FldFunRatUElt -> BoolElt, [ RngMPolElt ]
HomogeneousModuleTestBasis(P, S, L) : [ RngMPol ], [ RngMPol ], [ RngMPol ] -> [ BoolElt ], [ [ RngMPol ] ]
ImageWithBasis(X, M) : ModMatRngElt, ModRng -> ModRng
IntegralBasis(F) : FldAlg -> [ FldAlgElt ]
IntegralBasis(Q) : FldRat -> [ FldRatElt ]
IntegralBasis(M) : ModSym -> Lat
KMatrixSpaceWithBasis(Q) : [ ModMatRngElt ] -> ModMatRng
LatticeWithBasis(G, B) : GrpMat, ModMatRngElt -> Lat
LatticeWithBasis(G, B, M) : GrpMat, ModMatRngElt, AlgMatElt -> Lat
LatticeWithBasis(B) : ModMatRngElt -> Lat
LatticeWithBasis(B, M) : ModMatRngElt, AlgMatElt -> Lat
MinimalBasis(M) : ModMPol -> [ ModMPolElt ]
MinimalBasis(X) : Sch -> [ RngMPolElt ]
MinimalBasis(S) : [ ModMPolElt ] -> [ ModMPolElt ]
PrimeBasis(n) : RngIntElt -> [RngIntElt]
PrimeBasis(n) : RngIntElt -> [RngIntElt]
PseudoBasis(M) : ModOrd -> SeqEnum
RMatrixSpaceWithBasis(Q) : [ ModMatRngElt ] -> ModMatRng
RMatrixSpaceWithBasis(Q) : [ModTupRngElt] -> ModMatRng
RModuleWithBasis(Q) : [ModRngElt] -> ModTupRng
ReduceGroebnerBasis(S) : [ RngMPolElt ] -> [ RngMPolElt ]
ReducedBasis(S) : AlgQuatOrd -> SeqEnum
ReducedBasis(S: Precision) : [JacHypPt] -> SeqEnum, AlgMatElt
ShortBasis(D : parameters) : DivFunElt -> [RngElt], [RngIntElt]
SylowBasis(G) : GrpPC -> [GrpPC]
TensorBasis(G) : GrpMat -> GrpMatElt
TensorInducedBasis(G) : GrpMat -> GrpMatElt
VectorSpaceWithBasis(B) : [ModTupFldElt] -> ModTupFld
KModuleWithBasis(B) : [ModTupFldElt] -> ModTupFld
qExpansionBasis(M, prec) : ModBrdt, RngIntElt -> SeqEnum
qExpansionBasis(M, prec : parameters) : ModSym, RngIntElt -> SeqEnum
qIntegralBasis(M, prec : parameters: Al) : ModSym, RngIntElt -> SeqEnum
ModFld_Basis (Example H63E13)
Bases (FREE MODULES)
Bases (VECTOR SPACES)
Basis of a Module (MODULES OVER ORDERS)
Basis Representation (ORDERS AND ALGEBRAIC FIELDS)
Basis Representation (ORDERS AND ALGEBRAIC FIELDS)
Changing Basis (MODULES OVER A MATRIX ALGEBRA)
Construction of a Module with Specified Basis (FREE MODULES)
Construction of Gröbner Bases (IDEAL THEORY AND GRÖBNER BASES)
Module Bases (MODULES OVER AFFINE ALGEBRAS)
Modules öm_(R)(M, N) with Given Basis (FREE MODULES)
RngOrd_basis-ring (Example H53E13)
AlgQuat_Basis_Reduction (Example H71E11)
A . i : AlgGen, RngIntElt -> AlgGenElt
BasisElement(A, i) : AlgGen, RngIntElt -> AlgGenElt
BasisElement(R, i) : AlgMat, RngIntElt -> AlgMatElt
BasisElement(M, i) : ModMPol, RngIntElt -> RngMPolElt
BasisElement(V, i) : ModTupFld, RngIntElt -> ModTupFldElt
BasisElement(I, i) : RngMPol, RngIntElt -> RngMPolElt
BasisMatrix(S) : AlgGrpSub -> ModMatRngElt
BasisMatrix(L) : Lat -> ModMatRngElt
BasisMatrix(M) : ModMPol -> ModMatRngElt
BasisMatrix(V) : ModTupFld -> ModMatElt
BasisMatrix(I) : RngFunOrdIdl -> AlgMatElt
BasisMatrix(O) : RngOrd -> AlgMatElt
BasisMatrix(I) : RngOrdFracIdl -> MtrxSpcElt
GeneratorMatrix(C) : Code -> ModMatFldElt
BasisOfHolomorphicDifferentials(F) : FldFunG -> SeqEnum[DiffFunElt]
BasisOfDifferentialsFirstKind(F) : FldFunG -> SeqEnum[DiffFunElt]
BasisOfHolomorphicDifferentials(F) : FldFunG -> SeqEnum[DiffFunElt]
BasisOfDifferentialsFirstKind(F) : FldFunG -> SeqEnum[DiffFunElt]
BasisProduct(A, i, j) : AlgGen, RngIntElt, RngIntElt -> AlgGenElt
BasisProducts(A) : AlgGen -> [[ AlgGenElt ]]
Basket(X) : VSrfK3 -> SeqEnum
K3SurfacesFromBasket(DB,B) : SeqEnum,SeqEnum -> SeqEnum
Baskets(n) : RngIntElt -> SeqEnum,SeqEnum,SeqEnum,SeqEnum
BlumBlumShubModulus(b) : RngIntElt -> RngIntElt
BBSModulus(b) : RngIntElt -> RngIntElt
BCH Codes and their Generalizations (LINEAR CODES OVER FINITE FIELDS)
BCHBound(C) : Code -> RngIntElt, RngIntElt
BCHCode(K, n, d, b) : FldFin, RngIntElt, RngIntElt, RngIntElt -> Code
CodeFld_BCHCode (Example H97E26)
BestDimensionLinearCode(K, n, d) : FldFin,RngIntElt,RngIntElt -> Code
BDLC(K, n, d) : FldFin,RngIntElt,RngIntElt -> Code
BDLCLowerBound(F, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BDLCLowerBound(F, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BDLCUpperBound(F, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BDLCUpperBound(F, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
GetBeep() : -> BoolElt
SetBeep(b) : BoolElt ->
Overview (OVERVIEW)
ConnectionPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
CharacteristicPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
BerlekampMassey(S) : SeqEnum -> RngUPolElt, RngIntElt
ConnectionPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
CharacteristicPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
BerlekampMassey(S) : SeqEnum -> RngUPolElt, RngIntElt
BernoulliApproximation(n) : RngIntElt -> FldPrElt
BernoulliApproximation(n) : RngIntElt -> FldPrElt
BernoulliNumber(n) : RngIntElt -> FldRatElt
BernoulliNumber(n) : RngIntElt -> RngIntElt
BernoulliPolynomial(n) : RngIntElt -> RngUPolElt
BernoulliPolynomial(n) : RngIntElt -> RngUPolElt
RngSer_Bernoulli (Example H60E3)
The Bernoulli Polynomial (UNIVARIATE POLYNOMIAL RINGS)
The Bernoulli Polynomial (UNIVARIATE POLYNOMIAL RINGS)
BernoulliApproximation(n) : RngIntElt -> FldPrElt
BernoulliApproximation(n) : RngIntElt -> FldPrElt
BernoulliNumber(n) : RngIntElt -> FldRatElt
BernoulliNumber(n) : RngIntElt -> RngIntElt
BernoulliPolynomial(n) : RngIntElt -> RngUPolElt
BernoulliPolynomial(n) : RngIntElt -> RngUPolElt
BesselFunction(n, r) : RngIntElt, FldReElt -> FldReElt
KBessel2(n, s) : FldPrElt, FldPrElt -> FldPrElt
Gamma, Bessel and Associated Functions (REAL AND COMPLEX FIELDS)
BesselFunction(n, r) : RngIntElt, FldReElt -> FldReElt
BestDimensionLinearCode(K, n, d) : FldFin,RngIntElt,RngIntElt -> Code
BDLC(K, n, d) : FldFin,RngIntElt,RngIntElt -> Code
BKLC(K, n, k) : FldFin,RngIntElt,RngIntElt -> Code
BLLC(K, k, d) : FldFin,RngIntElt,RngIntElt -> Code, BoolElt
BestApproximation(r, n) : FldPrElt, RngIntElt -> FldPrElt
BestTranslation( T ) : Tup -> Tup
Best Known Bounds for Linear Codes (LINEAR CODES OVER FINITE FIELDS)
Best Known Linear Codes (LINEAR CODES OVER FINITE FIELDS)
Best Known Bounds for Linear Codes (LINEAR CODES OVER FINITE FIELDS)
Best Known Linear Codes (LINEAR CODES OVER FINITE FIELDS)
BestApproximation(r, n) : FldPrElt, RngIntElt -> FldPrElt
BestDimensionLinearCode(K, n, d) : FldFin,RngIntElt,RngIntElt -> Code
BDLC(K, n, d) : FldFin,RngIntElt,RngIntElt -> Code
BestKnownLinearCode(K, n, k) : FldFin,RngIntElt,RngIntElt -> Code
BKLC(K, n, k) : FldFin,RngIntElt,RngIntElt -> Code
CodeFld_BestLengthDimension (Example H97E40)
BestLengthLinearCode(K, k, d) : FldFin,RngIntElt,RngIntElt -> Code, BoolElt
BLLC(K, k, d) : FldFin,RngIntElt,RngIntElt -> Code, BoolElt
BestTranslation( T ) : Tup -> Tup
SubcodeBetweenCode(C1, C2, k) : Code,Code,RngIntElt -> Code
BFSTree(u) : GrphVert -> Grph
BreadthFirstSearchTree(u) : GrphVert -> Grph
Bibliography for Database of Irreducible Soluble Subgroups of GL(n,p) for n > 1 and p^n < 256 (OVERVIEW)
Bibliography for Database of Simple Groups (OVERVIEW)
Bicomponents(G) : GrphUnd -> [GrphUnd]
O(x) : RngLocElt -> RngLocElt
BigO(x) : RngLocElt -> RngLocElt
BigO(x) : RngLocElt -> RngLocElt
BigO(f) : RngSerElt -> RngIntElt
Comparison (OVERVIEW)
O(x) : RngLocElt -> RngLocElt
BigO(x) : RngLocElt -> RngLocElt
BigO(x) : RngLocElt -> RngLocElt
BigO(f) : RngSerElt -> RngIntElt
IsBijective(a) : ModMatRngElt -> BoolElt
ScalarsSymmetricBilinearForm(G) : GrpMat -> SeqEnum
SymmetricBilinearForm(G) : GrpMat -> AlgMatElt
SymmetricBilinearForm(f) : RngMPolElt -> ModMatRngElt
QuadraticForms(D) : RngIntElt -> QuadBin
BinaryQuadraticForms(D) : RngIntElt -> QuadBin
Binary Set Operators (SETS)
QuadraticForms(D) : RngIntElt -> QuadBin
BinaryQuadraticForms(D) : RngIntElt -> QuadBin
Key Bindings (Emacs and VI mode) (ENVIRONMENT AND OPTIONS)
Key Bindings in Emacs mode only (ENVIRONMENT AND OPTIONS)
Key Bindings in VI mode only (ENVIRONMENT AND OPTIONS)
Binomial(n, r) : RngIntElt, RngIntElt -> RngIntElt
Binomial(n, r) : RngIntElt, RngIntElt -> RngIntElt
bInvariants(E) : CrvEll -> [ RngElt ]
BipartiteGraph(m, n) : RngIntElt, RngIntElt -> GrphUnd
IsBipartite(G) : GrphUnd -> BoolElt
BipartiteGraph(m, n) : RngIntElt, RngIntElt -> GrphUnd
Bipartition(G) : GrphUnd -> [ { GrphVert } ]
BiquadraticResidueSymbol(a, b) : RngQuadElt, RngQuadElt -> RngQuadElt
BiquadraticResidueSymbol(a, b) : RngQuadElt, RngQuadElt -> RngQuadElt
RandomBits(n) : RngIntElt -> RngIntElt
RandomConsecutiveBits(n, a, b) : RngIntElt, RngIntElt -> RngIntElt
BestKnownLinearCode(K, n, k) : FldFin,RngIntElt,RngIntElt -> Code
BKLC(K, n, k) : FldFin,RngIntElt,RngIntElt -> Code
BKLCLowerBound(F, n, k) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BKLCLowerBound(F, n, k) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BKLCUpperBound(F, n, k) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BKLCUpperBound(F, n, k) : FldFin, RngIntElt, RngIntElt -> RngIntElt
Groups (OVERVIEW)
GROUPS WHOSE ELEMENTS ARE STRAIGHT-LINE PROGRAMS
BestLengthLinearCode(K, k, d) : FldFin,RngIntElt,RngIntElt -> Code, BoolElt
BLLC(K, k, d) : FldFin,RngIntElt,RngIntElt -> Code, BoolElt
BLLCLowerBound(F, k, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BLLCLowerBound(F, k, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BLLCUpperBound(F, k, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BLLCUpperBound(F, k, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
Block(D, i) : Inc, RngIntElt -> IncBlk
BlockDegree(D) : Dsgn -> RngIntElt
BlockDegree(D, B) : Inc, IncBlk -> RngIntElt
# B : IncBlk -> RngIntElt
BlockDegrees(D) : Inc -> [ RngIntElt ]
BlockGraph(D) : Inc -> Grph
BlockGraph(D) : Inc -> GrphUnd
BlockGroup(D) : Inc -> GrpPerm
BlockSet(D) : Inc -> IncBlkSet
BlockSystem(G) : GrpMat -> Rec
InsertBlock(~a, b, i, j) : AlgMatElt, ModHomElt, RngIntElt, RngIntElt -> AlgMatElt
InsertBlock(A, B, i, j) : Mtrx, Mtrx, RngIntElt, RngIntElt -> Mtrx
IsBlock(G, S) : GrpPerm, { Elt } -> BoolElt
IsBlock(D, S) : Inc, IncBlk -> BoolElt, IncBlk
IsBlockTransitive(D) : Inc -> BoolElt
IsolMinBlockSize(n, p, i) : RngIntElt, RngIntElt, RngIntElt -> RngIntElt
Line(D, p, q) : Inc, IncPt, IncPt -> IncBlk
Submatrix(a, i, j, p, q) : AlgMatElt, RngIntElt, RngIntElt, RngIntElt, RngIntElt -> ModMatRngElt
Submatrix(A, i, j, p, q) : Mtrx, RngIntElt, RngIntElt, RngIntElt, RngIntElt -> Mtrx
SubmatrixRange(A, i, j, r, s) : Mtrx, RngIntElt, RngIntElt, RngIntElt, RngIntElt -> Mtrx
Creating Points and Blocks (INCIDENCE STRUCTURES AND DESIGNS)
Operations on Points and Blocks (INCIDENCE STRUCTURES AND DESIGNS)
The Point--Set and Block--Set of an Incidence Structure (INCIDENCE STRUCTURES AND DESIGNS)
BlockSize(D) : Dsgn -> RngIntElt
BlockDegree(D) : Dsgn -> RngIntElt
BlockDegree(D, B) : Inc, IncBlk -> RngIntElt
BlockSizes(D) : Inc -> [ RngIntElt ]
BlockDegrees(D) : Inc -> [ RngIntElt ]
BlockGraph(D) : Inc -> Grph
BlockGraph(D) : Inc -> GrphUnd
BlockGroup(D) : Inc -> GrpPerm
Blocks(D) : Inc -> { IncBlk }
BlocksAction(G, P) : GrpPerm, GSet -> Hom(GrpPerm), GrpPerm, GrpPerm
BlocksImage(G) : GrpMat -> GrpPerm
BlocksImage(G, P) : GrpPerm, GSet -> GrpPerm
BlocksKernel(G, P) : GrpPerm, GSet -> GrpPerm
NumberOfBlocks(D) : Inc -> RngIntElt
BlocksAction(G, P) : GrpPerm, GSet -> Hom(GrpPerm), GrpPerm, GrpPerm
GrpPerm_BlocksActions (Example H20E22)
BlockSet(D) : Inc -> IncBlkSet
BlocksImage(G) : GrpMat -> GrpPerm
BlocksImage(G, P) : GrpPerm, GSet -> GrpPerm
BlockSize(D) : Dsgn -> RngIntElt
BlockDegree(D) : Dsgn -> RngIntElt
BlockDegree(D, B) : Inc, IncBlk -> RngIntElt
BlockSizes(D) : Inc -> [ RngIntElt ]
BlockDegrees(D) : Inc -> [ RngIntElt ]
BlocksKernel(G, P) : GrpPerm, GSet -> GrpPerm
BlockSystem(G) : GrpMat -> Rec
Resolution of Singularities (PLANE ALGEBRAIC CURVES)
Resolution of Singularities (PLANE ALGEBRAIC CURVES)
Blowup(C) : Crv -> Crv, Crv
Blowup(C,M) : Crv,Mtrx -> Crv, RngIntElt, RngIntElt
BlumBlumShubModulus(b) : RngIntElt -> RngIntElt
BBSModulus(b) : RngIntElt -> RngIntElt
RandomSequenceBlumBlumShub(b, t) : RngIntElt, RngIntElt -> SeqEnum
RandomSequenceBlumBlumShub(n, s, t) : RngIntElt, RngIntElt, RngIntElt -> SeqEnum
BlumBlumShub(b, t) : RngIntElt, RngIntElt -> SeqEnum
RandomSequenceBlumBlumShub(b, t) : RngIntElt, RngIntElt -> SeqEnum
RandomSequenceBlumBlumShub(n, s, t) : RngIntElt, RngIntElt, RngIntElt -> SeqEnum
BlumBlumShubModulus(b) : RngIntElt -> RngIntElt
BBSModulus(b) : RngIntElt -> RngIntElt
Documentation (OVERVIEW)
Boolean Functions (INPUT AND OUTPUT)
Boolean Functions and Operators (SETS)
Boolean Operators for Elements (FINITELY PRESENTED ALGEBRAS)
Boolean Operators on Ideals (INTRODUCTION [BASIC RINGS])
Boolean Predicates (LINEAR CODES OVER FINITE RINGS)
Booleans (OVERVIEW)
Comparison of Words (FINITELY PRESENTED GROUPS)
Elementary Graph Predicates (GRAPHS)
Equality (TUPLES AND CARTESIAN PRODUCTS)
Equality and Comparison (ABELIAN GROUPS)
Equality and Comparison (FINITELY PRESENTED SEMIGROUPS)
Equality and Comparison (GROUPS WHOSE ELEMENTS ARE STRAIGHT-LINE PROGRAMS)
Equality and Membership (ALGEBRAICALLY CLOSED FIELDS)
Equality and Membership (FINITE FIELDS)
Equality and Membership (GALOIS RINGS)
Equality and Membership (INTRODUCTION [BASIC RINGS])
Equality and Membership (RATIONAL FIELD)
Equality and Membership (RING OF INTEGERS)
Equality and Membership (RING OF INTEGERS)
Field Predicates (ORDERS AND ALGEBRAIC FIELDS)
General Group Properties (ABELIAN GROUPS)
General Properties of Subgroups (ABELIAN GROUPS)
Membership and Equality (ABELIAN GROUPS)
Membership and Equality (AUTOMATIC GROUPS)
Membership and Equality (FREE MODULES)
Membership and Equality (GROUPS DEFINED BY REWRITE SYSTEMS)
Membership and Equality (GROUPS WHOSE ELEMENTS ARE STRAIGHT-LINE PROGRAMS)
Membership and Equality (GROUPS)
Membership and Equality (LINEAR CODES OVER FINITE FIELDS)
Membership and Equality (MATRIX ALGEBRAS)
Membership and Equality (MATRIX GROUPS)
Membership and Equality (MODULES OVER A MATRIX ALGEBRA)
Membership and Equality (MONOIDS GIVEN BY REWRITE SYSTEMS)
Membership and Equality (PERMUTATION GROUPS)
Membership and Equality (VECTOR SPACES)
Order Predicates (ORDERS AND ALGEBRAIC FIELDS)
Predicates (MATRIX ALGEBRAS)
Predicates and Booleans (CHARACTERS OF FINITE GROUPS)
Predicates for Matrices (MATRIX GROUPS)
Predicates on Ideals (ORDERS AND ALGEBRAIC FIELDS)
Predicates on Ring Elements (ALGEBRAICALLY CLOSED FIELDS)
Predicates on Ring Elements (FINITE FIELDS)
Predicates on Ring Elements (GALOIS RINGS)
Predicates on Ring Elements (INTRODUCTION [BASIC RINGS])
Predicates on Ring Elements (MULTIVARIATE POLYNOMIAL RINGS)
Predicates on Ring Elements (POWER, LAURENT AND PUISEUX SERIES)
Predicates on Ring Elements (RATIONAL FIELD)
Predicates on Ring Elements (RATIONAL FUNCTION FIELDS)
Predicates on Ring Elements (RING OF INTEGERS)
Predicates on Ring Elements (RING OF INTEGERS)
Predicates on Ring Elements (UNIVARIATE POLYNOMIAL RINGS)
Predicates on Sequences (SEQUENCES)
Properties of a Automatic Group (AUTOMATIC GROUPS)
Properties of a Rewrite Group (GROUPS DEFINED BY REWRITE SYSTEMS)
Properties of a Rewrite Monoid (MONOIDS GIVEN BY REWRITE SYSTEMS)
Properties of Codes (LINEAR CODES OVER FINITE FIELDS)
Properties of Subgroups (FINITELY PRESENTED GROUPS)
Ring Predicates (ORDERS AND ALGEBRAIC FIELDS)
Ring Predicates and Booleans (RATIONAL FIELD)
Ring Predicates and Booleans (REAL AND COMPLEX FIELDS)
Ring Predicates and Booleans (RING OF INTEGERS)
Boolean Operations (BINARY QUADRATIC FORMS)
Boolean values (STATEMENTS AND EXPRESSIONS)
Comparison Operators for Elements (POLYCYCLIC GROUPS)
Elementary Properties of Incidence Structures and Designs (INCIDENCE STRUCTURES AND DESIGNS)
General Group Properties (POLYCYCLIC GROUPS)
General Properties of Subgroups (POLYCYCLIC GROUPS)
Membership and Equality (GENERIC ABELIAN GROUPS)
Membership and Equality (POLYCYCLIC GROUPS)
Predicates on Elements (ALGEBRAIC FUNCTION FIELDS)
Predicates on Elements (ALGEBRAIC FUNCTION FIELDS)
Predicates on Elements (ALGEBRAIC FUNCTION FIELDS)
Predicates on Elements (ALGEBRAIC FUNCTION FIELDS)
Predicates on Elements (ORDERS AND ALGEBRAIC FIELDS)
Predicates on Ideals (ALGEBRAIC FUNCTION FIELDS)
Properties of Planes (FINITE PLANES)
Properties of Subgroups Requiring a Nil-po-tent Covering Group (POLYCYCLIC GROUPS)
Ring Predicates and Booleans (MULTIVARIATE POLYNOMIAL RINGS)
Ring Predicates and Booleans (POWER, LAURENT AND PUISEUX SERIES)
Ring Predicates and Booleans (UNIVARIATE POLYNOMIAL RINGS)
Boolean Operations (BINARY QUADRATIC FORMS)
Booleans() : Nil -> Bool
State_Booleans (Example H1E8)
BorderedDoublyCirculantQRCode(p,a,b) : RngIntElt, RngElt, RngElt -> Code
BorderedDoublyCirculantQRCode(p,a,b) : RngIntElt, RngElt, RngElt -> Code
BorelSubgroup(C) : CosetGeom -> GrpPerm
Borel(C) : CosetGeom -> GrpPerm
BorelSubgroup(C) : CosetGeom -> GrpPerm
Borel(C) : CosetGeom -> GrpPerm
Bottom(L) : SubFldLat -> SubFldLatElt
Bottom(L): SubGrpLat -> SubGrpLatElt
Bottom(L): SubModLat -> SubModLatElt
BDLCLowerBound(F, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BDLCUpperBound(F, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BKLCLowerBound(F, n, k) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BKLCUpperBound(F, n, k) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BLLCLowerBound(F, k, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BLLCUpperBound(F, k, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
BachBound(K) : FldNum -> RngIntElt
ClassGroupGenerationBound(F) : FldFun -> RngIntElt
ClassGroupGenerationBound(q, g) : RngIntElt, RngIntElt -> RngIntElt
ClassNumberApproximationBound(q, g, e) : RngIntElt, RngIntElt, -> RngIntElt
EliasAsymptoticBound(K, delta) : FldFin, FldPrElt -> FldPrElt
EliasBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
GilbertVarshamovAsymptoticBound(K, delta) : FldFin, FldPrElt -> FldPrElt
GilbertVarshamovBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
GilbertVarshamovLinearBound(K, n, d) : FldFin,RngIntElt,RngIntElt -> RngIntElt
GriesmerBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
GriesmerLengthBound(K, k, d) : FldFin,RngIntEt,RngIntElt -> RngIntElt
GriesmerMinimumWeightBound(K, n, k) : FldFin,RngIntElt,RngIntElt->RngIntElt
HammingAsymptoticBound(K, delta) : FldFin, FldPrElt -> FldPrElt
HeckeBound(M) : ModSym -> RngIntElt
IharaBound(F) : FldFun -> RngIntElt
JohnsonBound(n, d) : RngIntElt, RngIntElt -> RngIntElt
LevenshteinBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
McElieceEtAlAsymptoticBound(delta) : FldPrElt -> FldPrElt
MinkowskiBound(K) : FldNum -> RngIntElt
NumberOfPlacesOfDegreeOneBound(F) : FldFun -> RngIntElt
NumberOfPlacesOfDegreeOneBound(F, m) : FldFun, RngIntElt -> RngIntElt
PlotkinAsymptoticBound(K, delta) : FldFin, FldPrElt -> FldPrElt
PlotkinBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
PrecisionBound(M : parameters) : ModFrm -> RngIntElt
RegulatorLowerBound(O) : RngOrd -> FldPrElt
SerreBound(F) : FldFun -> RngIntElt
SetHeckeBound(M, n) : ModSym, RngIntElt -> RngIntElt
SetLowerBound(L, n, b) : LP, RngIntElt, RngElt ->
SetUpperBound(L, n, b) : LP, RngIntElt, RngElt ->
SilvermanBound(H) : SetPtEll -> FldPrElt
SingletonAsymptoticBound(delta) : FldPrElt -> FldPrElt
SingletonBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
SpherePackingBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
TorsionBound(J, n) : JacHyp, RngIntElt -> RngIntElt
TorsionBound(M, maxp) : ModSym, RngIntElt -> RngIntElt
VanLintBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
VerifyMinimumDistanceLowerBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumDistanceUpperBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
Asymptotic Bounds on the Information Rate (LINEAR CODES OVER FINITE FIELDS)
Bounds (LINEAR CODES OVER FINITE FIELDS)
Bounds on the Minimum Distance (LINEAR CODES OVER FINITE FIELDS)
BoundaryMap(C, n) : ModCpx, RngIntElt -> ModMatFldElt
BoundaryMap(M) : ModSym -> ModMatFldElt
BoundaryMaps(C) : ModCpx -> List
IsBoundary(N, p) : NwtnPgon,Tup -> BoolElt
LayerBoundary(G,i,j,k) : GrpPC, RngIntElt, RngIntElt, RngIntElt -> RngIntElt
MinorBoundary(G,i,j) : GrpPC, RngIntElt, RngIntElt -> RngIntElt
NilpotentBoundary(G,i) : GrpPC, RngIntElt -> RngIntElt
BoundaryMap(C, n) : ModCpx, RngIntElt -> ModMatFldElt
BoundaryMap(M) : ModSym -> ModMatFldElt
ModSym_BoundaryMap (Example H88E13)
BoundaryMaps(C) : ModCpx -> List
OrbitActionBounded(G, T, b) : GrpMat, Elt, RngIntElt -> BoolElt, Hom(Grp), GrpPerm, GrpMat
OrbitBounded(G, y, b) : GrpMat, Elt, RngIntElt -> BoolElt, SetEnum
OrbitImageBounded(G, T, b) : GrpMat, Set, RngIntElt -> BoolElt, GrpPerm
OrbitKernelBounded(G, T, b) : GrpMat, Set, RngIntElt -> BoolElt, GrpMat
WordsOfBoundedWeight(C, l, u) : Code, RngIntElt, RngIntElt -> { ModTupFldElt }
MordellWeilRankBounds(H: parameters) : SetPtEll -> RngIntElt, RngIntElt
RankBounds(H: parameters) : SetPtEll -> RngIntElt, RngIntElt
UnsetBounds(L) : LP ->
Best Known Bounds for Linear Codes (LINEAR CODES OVER FINITE FIELDS)
Sets (OVERVIEW)
{* e_1, e_2, ..., e_n *} : Elt, ..., Elt -> SetMulti
{* *} : Null -> SetMulti
{* U | *} : Struct -> SetMulti
{* U | e_1, e_2, ..., e_m *} : Struct, Elt, ..., Elt -> SetMulti
{* e(x) : x in E | P(x) *}
{* U | e(x) : x in E | P(x) *}
{* e(x_1,...,x_k) : x_1 in E_1, ..., x_kin E_k | P(x_1, ..., x_k) *}
{* U | e(x_1,...,x_k) : x_1 in E_1, ...,x_k in E_k | P(x_1, ..., x_k) *}
(a, b) : AlgAssElt, AlgAssElt -> AlgAssElt
LieBracket(a, b) : AlgAssElt, AlgAssElt -> AlgAssElt
Expression (OVERVIEW)
Generator Assignment (OVERVIEW)
Sequences (OVERVIEW)
Sets (OVERVIEW)
BraidGroup( W ) : GrpCox -> GrpFP, Map
BraidGroup( F ) : GrpFP -> GrpFP, Map
BraidGroup(n) : RngIntElt -> GrpFP
PureBraidGroup( W ) : GrpCox -> GrpFP, Map
PureBraidGroup( F ) : GrpFP -> GrpFP, Map
Braid groups (COXETER GROUPS)
BraidGroup( W ) : GrpCox -> GrpFP, Map
BraidGroup( F ) : GrpFP -> GrpFP, Map
BraidGroup(n) : RngIntElt -> GrpFP
GrpCox_BraidGroups (Example H36E17)
BranchVertexPath(u,v) : GrphVert,GrphVert -> SeqEnum
BranchVertexPath(u,v) : GrphVert,GrphVert -> SeqEnum
BrandtModule(A) : AlgQuatOrd -> ModBrdt
BrandtModule(D) : RngIntElt, RngIntElt -> ModBrdt
BrandtModuleDimension(D,N) : RngIntElt, RngIntElt -> RngIntElt
BRANDT MODULES
BRANDT MODULES
BrandtModule(A) : AlgQuatOrd -> ModBrdt
BrandtModule(D) : RngIntElt, RngIntElt -> ModBrdt
BrandtModuleDimension(D,N) : RngIntElt, RngIntElt -> RngIntElt
BravaisGroup(G) : GrpMat -> GrpMat
BravaisGroup(G) : GrpMat -> GrpMat
BFSTree(u) : GrphVert -> Grph
BreadthFirstSearchTree(u) : GrphVert -> Grph
BFSTree(u) : GrphVert -> Grph
BreadthFirstSearchTree(u) : GrphVert -> Grph
Early Exit from Iterative Statements (STATEMENTS AND EXPRESSIONS)
The break statement (OVERVIEW)
State_break (Example H1E15)
GetHelpExternalBrowser() : -> MonStgElt, MonStgElt
SetHelpExternalBrowser(S, T) : MonStgElt, MonStgElt ->
SetHelpUseExternalBrowser(b) : BoolElt ->
Internal Help Browser (ENVIRONMENT AND OPTIONS)
Bruhat( g ) : GrpLieElte -> GrpLieElt, GrpLieElt, GrpLieElt, GrpLieElt
GrpLie_Bruhat (Example H37E6)
Bruhat normalisation (GROUPS OF LIE TYPE)
ModSym_BSD (Example H88E22)
ModSym_BSD389A (Example H88E26)
Base and Strong Generating Set (MATRIX GROUPS)
Base and Strong Generating Set (PERMUTATION GROUPS)
BSGS(G) : GrpMat ->
BSGS(G) : GrpPerm ->
GrpPerm_BSGS (Example H20E32)
Base and Strong Generating Set (MATRIX GROUPS)
Base and Strong Generating Set (PERMUTATION GROUPS)
SetBufferSize(D, n) : DB, RngIntElt ->
Magma Updates (OVERVIEW)
Building the K3 Database (THE K3 DATABASE)
Gathering the Data (THE K3 DATABASE)
Working with the Raw Elements (THE K3 DATABASE)
Building Permutation Groups (PERMUTATION GROUPS)
Building Permutation Groups (PERMUTATION GROUPS)
GrpFP_1_BuildSubgroups (Example H22E44)
Intrinsics (OVERVIEW)
BurnsideMatrix(G) : GrpPC -> AlgMatElt
DisplayBurnsideMatrix(G) : GrpPC ->
BurnsideMatrix(G) : GrpPC -> AlgMatElt
IsDivisibleBy(a, b) : FldFunElt, FldFunElt -> BoolElt, FldFunElt
IsDivisibleBy(a, b) : RngFunOrdElt, RngFunOrdElt -> BoolElt, RngFunOrdElt
IsDivisibleBy(n, d) : RngIntElt, RngIntElt -> BoolElt, RngIntElt
IsDivisibleBy(a, b) : RngMPolElt, RngMPolElt -> BoolElt, RngMPolElt
MultiplicationByMMap(E, m) : CrvEll, RngIntElt -> Map
Call by Value Evaluation (MAGMA SEMANTICS)
Creation by Hand (RESOLUTION GRAPHS AND SPLICE DIAGRAMS)
Definition of Subgroups by Generators (FINITE SOLUBLE GROUPS)
Expression (OVERVIEW)
Sequences (OVERVIEW)
Sets (OVERVIEW)
The for statement (OVERVIEW)
Control-C key (OVERVIEW)
Quitting (OVERVIEW)
[____] [____] [_____] [____] [__] [Index] [Root]