[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: lift .. Linear
Teichmüller Lifts (p-ADIC RINGS AND THEIR EXTENSIONS)
LiftCharacter(c, f, G) : AlgChtrElt, Map, Grp -> AlgChtrElt
LiftCharacters(T, f, G) : [AlgChtrElt], Map, Grp -> AlgChtrElt
LiftCocycle(M, c) : Map, UserProgram -> UserProgram
InflationMapImage(M, c) : Map, UserProgram -> UserProgram
TwoDescendantsOverTwoIsogenyDescendant(C) : CrvHyp -> SeqEnum[ CrvHyp ], List, MapSch
LiftDescendant(C) : CrvHyp -> SeqEnum[ CrvHyp ], List, MapSch
IsolatedPointsLifter(S,P) : Sch, SeqEnum -> BoolElt, Pt
LiftHomomorphism(x, n) : ModAlgElt, RngIntElt -> ModMatFldElt
LiftHomomorphism(X, N) : SeqEnum[ModAlgElt], SeqEnum[RngIntElt] -> ModMatFldElt
Induction, Restriction and Lifting (CHARACTERS OF FINITE GROUPS)
Lifting Algorithm (FINITE SOLUBLE GROUPS)
Lifting Algorithm (FINITE SOLUBLE GROUPS)
LiftMap(m, R) : Map, RngDiffOp -> Map
LiftPoint(P, n) : Pt, RngIntElt -> Pt
LiftToChainmap(P,f,d) : ModCpx, Mtrx, RngIntElt -> MapChn
Z as a Number Field Order (INTEGER RESIDUE CLASS RINGS)
MAGMA_MEMORY_LIMIT
HypergeometricMotiveClearTable() : Void -> Void
HypergeometricMotiveSaveLimit(n) : RngIntElt -> Void
PrimitiveGroupDatabaseLimit() : -> RngIntElt
SetMemoryLimit(n) : RngIntElt ->
SmallGroupDatabaseLimit() : -> RngIntElt
TransitiveGroupDatabaseLimit() : -> RngIntElt
Limits (FINITELY PRESENTED ALGEBRAS)
Modifying Limits (AUTOMATIC GROUPS)
Linear Algebra (p-ADIC RINGS AND THEIR EXTENSIONS)
LINEAR PROGRAMMING
Linear Algebra (p-ADIC RINGS AND THEIR EXTENSIONS)
LINEAR PROGRAMMING
IsSubsystem(L,K) : LinearSys,LinearSys -> BoolElt
Basic Algebra of Linear Systems (SCHEMES)
IsLineRegular(D) : IncNsp -> BoolElt, RngIntElt
IsLineTransitive(P) : Plane -> BoolElt
Line(C,p,q) : CrvPln, Pt,Pt -> CrvPln
Line(D, p, q) : Inc, IncPt, IncPt -> IncBlk
LineAtInfinity(A) : Aff -> CrvPln
LineGraph(G) : Grph -> Grph
LineGraph(P) : Plane -> Grph
LineGraph(P) : Plane -> GrphUnd
LineGroup(P) : Plane -> GrpPerm, PowMap, Map
LineOrbits(G) : GrpMat -> [ SetIndx ]
LineSet(P) : Plane -> PlaneLnSet
SetLineEditor(b) : BoolElt ->
TangentLine(p) : Pt -> Crv
Constructing Complements, Line Graphs; Contraction, Switching (GRAPHS)
The Magma Line Editor (ENVIRONMENT AND OPTIONS)
The Point-Set and Line-Set of a Plane (FINITE PLANES)
The Set of Points and Set of Lines (FINITE PLANES)
Using the Point-Set and Line-Set to Create Points and Lines (FINITE PLANES)
The Magma Line Editor (ENVIRONMENT AND OPTIONS)
AdjointLinearSystemForNodalCurve(C, d) : Crv -> LinearSys
AdjointIdealForNodalCurve(C) : Crv -> RngMPol
AdjointLinearSystemFromIdeal(I, d) : RngMPol, RngIntElt -> LinearSys
AffineGammaLinearGroup(arguments)
AffineGeneralLinearGroup(arguments)
AffineGeneralLinearGroup(GrpMat, n, q) : Cat, RngIntElt, RngIntElt -> GrpMat
AffineSigmaLinearGroup(arguments)
AffineSpecialLinearGroup(arguments)
AffineSpecialLinearGroup(GrpMat, n, q) : Cat, RngIntElt, RngIntElt -> GrpMat
AllLinearRelations(q,p): SeqEnum, RngIntElt -> Lat
BDLC(K, n, d) : FldFin, RngIntElt, RngIntElt -> Code, BoolElt
BKLC(K, n, k) : FldFin, RngIntElt, RngIntElt -> Code, BoolElt
BLLC(K, k, d) : FldFin, RngIntElt, RngIntElt -> Code, BoolElt
CanonicalLinearSystem(C) : Crv -> LinearSys
CanonicalLinearSystemFromIdeal(I, d) : RngMPol, RngIntElt -> LinearSys
ConeQuotientByLinearSubspace(C) : TorCon -> TorCon,Map,Map
GeneralLinearGroup(n, R) : RngIntElt, Rng -> GrpMat
GeneralLinearGroup(n, q) : RngIntElt, RngIntElt -> GrpMat
GilbertVarshamovLinearBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
HasLinearGrayMapImage(C) : Code -> BoolElt, Code
IsAffineLinear(f) : MapSch -> BoolElt
IsAffineLinear(P) : TorPol -> BoolElt
IsLinear(x) : AlgChtrElt -> BoolElt
IsLinear(f) : MapSch -> BoolElt
IsLinear(X) : Sch -> BoolElt
IsLinearGroup(G) : GrpMat -> BoolElt
IsLinearSpace(D) : Inc -> BoolElt
IsLinearSystemNonEmpty(D) : DivSchElt -> BoolElt, DivSchElt
IsNearLinearSpace(D) : Inc -> BoolElt
IsSemiLinear(G) : GrpMat -> BoolElt
LinearCharacters(G): Grp -> SeqEnum
LinearCharacters(G) : GrpMat -> [ Chtr ]
LinearCode(C, S) : Code, FldFin -> Code, Map
LinearCode<R, n | L> : FldFin, RngIntElt, List -> Code
LinearCode(D, K) : Inc, FldFin -> Code
LinearCode(A) : ModMatRngElt -> Code
LinearCode(A) : ModMatRngElt -> Code
LinearCode(U) : ModTupRng -> Code
LinearCode(U) : ModTupRng -> Code
LinearCode(P, K) : Plane, FldFin -> Code
LinearCode<R, n | L> : Rng, RngIntElt, List -> Code
LinearCovariants(f) : RngMPolElt -> SeqEnum
LinearElimination(S) : Sch -> Map
LinearRelation(q: parameters) : [ FldComElt ] -> [ RngIntElt ]
LinearRelations(f) : RngUPolElt -> Mtrx, GaloisData
LinearRelations(f, I) : RngUPolElt, [RngSLPolElt] -> Mtrx, GaloisData
LinearSpace(I) : Inc -> IncLsp
LinearSpace< v | X : parameters > : RngIntElt, List -> IncLsp
LinearSpanEquations(C) : TorCon -> SeqEnum
LinearSpanGenerators(C) : TorCon -> SeqEnum
LinearSubspaceGenerators(C) : TorCon -> SeqEnum
LinearSystem(L,V) : LinearSys,ModTupFld -> LinearSys
LinearSystem(L,p) : LinearSys,Pt -> LinearSys
LinearSystem(L,p,m) : LinearSys,Pt,RngIntElt -> LinearSys
LinearSystem(L,X) : LinearSys,Sch -> LinearSys
LinearSystem(L,F) : LinearSys,SeqEnum -> LinearSys
LinearSystem(P, d) : Sch, [RngIntElt] -> LinearSys
LinearSystem(P,d) : Sch,RngIntElt -> LinearSys
LinearSystem(P,F) : Sch,SeqEnum[RngMPolElt] -> LinearSys
LinearSystemTrace(L,X) : LinearSys,Sch -> LinearSys
NearLinearSpace(I) : Inc -> IncNsp
NearLinearSpace< v | X : parameters > : RngIntElt, List -> IncNsp
ProjectiveGammaLinearGroup(arguments)
ProjectiveGeneralLinearGroup(arguments)
ProjectiveSigmaLinearGroup(arguments)
ProjectiveSpecialLinearGroup(arguments)
RandomLinearCode(K, n, k) : FldFin, RngIntElt, RngIntElt -> Code
RandomLinearCode(R, n, k) : Rng, RngIntElt, RngIntElt -> Code
RemoveLinearRelations(X) : Sch -> Sch, MapIsoSch
ResolveLinearSystem(D) : DivTorElt -> TorVar
SemiLinearGroup(G, S) : GrpMat, FldFin -> GrpMat
SpecialLinearGroup(n, q) : RngIntElt, RngIntElt -> GrpMat
[____] [____] [_____] [____] [__] [Index] [Root]
Version: V2.19 of
Mon Dec 17 14:40:36 EST 2012