Documentation

TrapezoidalQuadrature
- TrapezoidalQuadrature(f, a, b, n) : Program, FldReElt, FldReElt, RngIntElt -> FldReElt
Trasformation
- HadamardTrasformation(e) : HilbSpcElt -> HilbSpcElt
Tree
- BFSTree(u) : GrphVert -> Grph
- BreadthFirstSearchTree(u) : GrphVert -> Grph, GrphVertSet, GrphEdgeSet
- BreadthFirstSearchTree(u) : GrphVert -> GrphMult, GrphVertSet, GrphEdgeSet
- CleanCompositionTree(G) : Grp ->
- CompositionTree(G) : GrpMat[FldFin] -> []
- CompositionTree(G : parameters) : GrpMat[FldFin] -> []
- CompositionTreeCBM(G) : GrpMat[FldFin -> GrpMatElt
- CompositionTreeElementToWord(G, g) : Grp, GrpElt -> BoolElt, GrpSLPElt
- CompositionTreeFactorNumber(G, g) : Grp, GrpElt -> RngIntElt
- CompositionTreeFastVerification(G) : Grp -> BoolElt
- CompositionTreeNiceGroup(G) : Grp -> GrpMat[FldFin]
- CompositionTreeNiceToUser(G) : Grp -> Map, []
- CompositionTreeNonAbelianFactors(G) : Grp -> RngIntElt
- CompositionTreeNonAbelianFactors(G) : GrpMat[FldFin] -> List
- CompositionTreeOrder(G) : Grp -> RngIntElt
- CompositionTreeOrder(G) : Grp -> RngIntElt
- CompositionTreeReductionInfo(G, t) : Grp, RngIntElt -> MonStgElt,Grp, Grp
- CompositionTreeSLPGroup(G) : Grp -> GrpSLP, Map
- CompositionTreeSeries(G) : Grp -> SeqEnum, List, List, List, BoolElt, []
- CompositionTreeVerify(G) : Grp -> BoolElt, []
- DepthFirstSearchTree(u) : GrphVert -> Grph, GrphVertSet, GrphEdgeSet, SeqEnum
- DepthFirstSearchTree(u) : GrphVert -> GrphMult, GrphVertSet, GrphEdgeSet, SeqEnum
- DisplayCompTreeNodes(G : parameters) : Grp ->
- HasCompositionTree(G) : Grp -> BoolElt
- IrreducibleSimpleSubalgebraTreeSU(Q, d) : SeqEnum[SeqEnum[Tup]], RngIntElt -> GrphDir
- IsPathTree(B) : AlgBas -> Bool
- IsRootedTree(G) : GrphDir -> BoolElt, GrphVert
- IsTree(G) : Grph -> BoolElt
- MinimumWeightTree(u : parameters) : GrphVert -> SeqEnum
- PathTree(B, i) : AlgBas, RngIntElt -> ModRng
- RandomTree(n : parameters) : RngIntElt -> GrphUnd
- SpanningTree(G) : GrphMultUnd -> GrphMultUnd, GrphVertSet, GrphEdgeSet
- SpanningTree(G) : GrphUnd -> Grph, GrphVertSet, GrphEdgeSet
tree
- Accessing the Composition Tree (MATRIX GROUPS OVER FINITE FIELDS)
- Composition Trees for Matrix Groups (MATRIX GROUPS OVER FINITE FIELDS)
- Constructing the Composition Tree (MATRIX GROUPS OVER FINITE FIELDS)
- Directed Trees (GRAPHS)
- Spanning Trees (MULTIGRAPHS)
- Spanning Trees of a Graph or Digraph (GRAPHS)
- The Composition Tree Algorithm (MATRIX GROUPS OVER FINITE FIELDS)
Trees
- PrintTreesSU(Q, F) : SeqEnum[SeqEnum[Tup]], MonStgElt ->
Tri
- TriTangentLines(S) : Srfc -> List
Trial
- TrialDivision(n) : RngIntElt -> RngIntEltFact, [ RngIntElt ]
- TrialDivision(n, B) : RngQuadElt, RngIntElt -> SeqEnum, SeqEnum, Tup
TrialDivision
- TrialDivision(n) : RngIntElt -> RngIntEltFact, [ RngIntElt ]
- TrialDivision(n, B) : RngQuadElt, RngIntElt -> SeqEnum, SeqEnum, Tup
Triangle
- AdmissableTriangleGroups() : -> SeqEnum
- ArithmeticTriangleGroup(p,q,r) : RngIntElt, RngIntElt, RngIntElt -> GrpPSL2, Rng
- IsTriangleGroup(G) : GrpPSL2 -> BoolElt
- PascalTriangle(D) : Dsgn -> SeqEnum
- ReduceToTriangleVertices(G,z) : GrpPSL2, SpcHypElt -> SpcHypElt
triangle
- Triangle Groups (ARITHMETIC FUCHSIAN GROUPS AND SHIMURA CURVES)
triangle-groups
- Triangle Groups (ARITHMETIC FUCHSIAN GROUPS AND SHIMURA CURVES)
Triangle239CMPoints1
- GrpPSL2Shim_Triangle239CMPoints1 (Example H140E9)
Triangle239CMPoints2
- GrpPSL2Shim_Triangle239CMPoints2 (Example H140E10)
Triangular
- EnsureUpperTriangular(A) : AlgMatElt -> AlgMatElt
- IsLowerTriangular(A) : Mtrx -> BoolElt
- IsLowerTriangular(A) : MtrxSprs -> BoolElt
- IsUpperTriangular(A) : Mtrx -> BoolElt
- IsUpperTriangular(A) : MtrxSprs -> BoolElt
- LowerTriangularMatrix(R, Q) : Rng, [ RngElt ] -> Mtrx
- LowerTriangularMatrix(Q) : [ RngElt ] -> Mtrx
- TriangularDecomposition(I) : RngMPol -> [ RngMPol ], BoolElt
- TriangularGraph(n) : RngIntElt -> GrphUnd
- UpperTriangularMatrix(R, Q) : Rng, [ RngElt ] -> Mtrx
- UpperTriangularMatrix(Q) : [ RngElt ] -> Mtrx
triangular
- Triangular Decomposition (POLYNOMIAL RING IDEAL OPERATIONS)
triangular-decomposition
- Triangular Decomposition (POLYNOMIAL RING IDEAL OPERATIONS)
TriangularDecomposition
- TriangularDecomposition(I) : RngMPol -> [ RngMPol ], BoolElt
- Ideal_TriangularDecomposition (Example H113E11)
TriangularGraph
- TriangularGraph(n) : RngIntElt -> GrphUnd
Triangulation
- Triangulation(P) : TorPol -> SetEnum
- TriangulationOfBoundary(P) : TorPol -> SetEnum
TriangulationOfBoundary
- TriangulationOfBoundary(P) : TorPol -> SetEnum

V2.28, 13 July 2023

Magma is maintained and distributed by the Computational Algebra Group, School of Mathematics and Statistics, University of Sydney.