Documentation

presented
- FINITELY PRESENTED ALGEBRAS
- Finitely Presented Algebras (FINITELY PRESENTED ALGEBRAS)
- FINITELY PRESENTED GROUPS
- Finitely Presented Modules (FINITELY PRESENTED ALGEBRAS)
- FINITELY PRESENTED SEMIGROUPS
- FREE GROUPS
- INTRODUCTION TO FP-GROUPS [FINITELY-PRESENTED GROUPS]
Preserving
- GonalityPreservingLift(C) : Crv[FldFun] -> RngUPolElt, AlgMatElt, AlgMatElt
Pretty
- PrettyPrintInvariant(I) : RngSLPolElt -> MonStgElt
PrettyPrintInvariant
- PrettyPrintInvariant(I) : RngSLPolElt -> MonStgElt
Previous
- ClearPrevious() : ->
- GetPreviousSize() : -> RngIntElt
- PreviousPrime(n) : RngIntElt -> RngIntElt
- SetPreviousSize(n) : RngIntElt ->
- ShowPrevious() : ->
- ShowPrevious(i) : RngIntElt ->
previous
- PrimeDivisors(n) : RngIntElt -> [RngIntElt]
- Other Functions Relating to Primes (RING OF INTEGERS)
PreviousPrime
- PreviousPrime(n) : RngIntElt -> RngIntElt
PRI
- IsPRI(C) : CosetGeom -> BoolElt
- IsPrimitive(C) : CosetGeom -> BoolElt
Primality
- IsPrimeCertificate(cert) : List -> BoolElt
- PrimalityCertificate(n) : RngIntElt -> List
primality
- Primality (RING OF INTEGERS)
PrimalityCertificate
- IsPrimeCertificate(cert) : List -> BoolElt
- PrimalityCertificate(n) : RngIntElt -> List
Primary
- IsPrimary(I) : RngMPol -> BoolElt
- IsPrimary(I) : RngMPolRes -> BoolElt
- Primary(a) : RngQuadElt -> RngQuadElt
- PrimaryAbelianBasis(A) : GrpAb -> [ GrpAbElt ], [ RngIntElt ]
- PrimaryAbelianBasis(G) : GrpFin -> [ GrpFinElt ], [ RngIntElt ]
- PrimaryAbelianBasis(G) : GrpMat -> [ GrpMatElt ], [ RngIntElt ]
- PrimaryAbelianBasis(G) : GrpPC -> [ GrpPCElt ], [ RngIntElt ]
- PrimaryAbelianBasis(G) : GrpPerm -> [ GrpPermElt ], [ RngIntElt ]
- PrimaryAbelianInvariants(A) : GrpAb -> [ RngIntElt ]
- PrimaryAbelianInvariants(G) : GrpFin -> [ RngIntElt ]
- PrimaryAbelianInvariants(G) : GrpMat -> [ RngIntElt ]
- PrimaryAbelianInvariants(G) : GrpPC -> [RngIntElt]
- PrimaryAbelianInvariants(G) : GrpPerm -> [ RngIntElt ]
- PrimaryAlgebra(R) : RngInvar -> RngMPol
- PrimaryComponents(X) : Sch -> SeqEnum
- PrimaryDecomposition(I) : RngMPol -> [ RngMPol ], [ RngMPol ]
- PrimaryDecomposition(I) : RngMPolRes -> [ RngMPolRes ], [ RngMPolRes ]
- PrimaryIdeal(R) : RngInvar -> RngMPol
- PrimaryInvariantFactors(a) : AlgMatElt -> [ <RngUPolElt, RngIntElt ]
- PrimaryInvariantFactors(A) : Mtrx -> [ <RngUPolElt, RngIntElt> ]
- R`PrimaryInvariants
- PrimaryInvariants(R) : RngInvar -> [ RngMPolElt ]
- PrimaryRationalForm(a) : AlgMatElt -> AlgMatElt, AlgMatElt, [ <RngUPolElt, RngIntElt ]
- PrimaryRationalForm(A) : Mtrx -> AlgMatElt, AlgMatElt, [ <RngUPolElt, RngIntElt ]
primary
- Primary Decomposition (POLYNOMIAL RING IDEAL OPERATIONS)
- Primary Invariants (INVARIANT THEORY)
primary-decomposition
- Primary Decomposition (POLYNOMIAL RING IDEAL OPERATIONS)
PrimaryAbelianBasis
- AbelianBasis(A) : GrpAb -> [ GrpAbElt ], [ RngIntElt ]
- PrimaryAbelianBasis(A) : GrpAb -> [ GrpAbElt ], [ RngIntElt ]
- PrimaryAbelianBasis(G) : GrpFin -> [ GrpFinElt ], [ RngIntElt ]
- PrimaryAbelianBasis(G) : GrpMat -> [ GrpMatElt ], [ RngIntElt ]
- PrimaryAbelianBasis(G) : GrpPC -> [ GrpPCElt ], [ RngIntElt ]
- PrimaryAbelianBasis(G) : GrpPerm -> [ GrpPermElt ], [ RngIntElt ]
PrimaryAbelianInvariants
- AbelianInvariants(A) : GrpAb -> [ RngIntElt ]
- PrimaryAbelianInvariants(A) : GrpAb -> [ RngIntElt ]
- PrimaryAbelianInvariants(G) : GrpFin -> [ RngIntElt ]
- PrimaryAbelianInvariants(G) : GrpMat -> [ RngIntElt ]
- PrimaryAbelianInvariants(G) : GrpPC -> [RngIntElt]
- PrimaryAbelianInvariants(G) : GrpPerm -> [ RngIntElt ]
PrimaryAlgebra
- PrimaryAlgebra(R) : RngInvar -> RngMPol
PrimaryComponents
- PrimaryComponents(X) : Sch -> SeqEnum
PrimaryDecomposition
- PrimaryDecomposition(I) : RngMPol -> [ RngMPol ], [ RngMPol ]
- PrimaryDecomposition(I) : RngMPolRes -> [ RngMPolRes ], [ RngMPolRes ]
- Ideal_PrimaryDecomposition (Example H113E10)
PrimaryIdeal
- PrimaryIdeal(R) : RngInvar -> RngMPol
PrimaryInvariantFactors
- PrimaryInvariantFactors(a) : AlgMatElt -> [ <RngUPolElt, RngIntElt ]
- PrimaryInvariantFactors(A) : Mtrx -> [ <RngUPolElt, RngIntElt> ]
PrimaryInvariants
- R`PrimaryInvariants
- PrimaryInvariants(R) : RngInvar -> [ RngMPolElt ]
PrimaryRationalForm
- PrimaryRationalForm(a) : AlgMatElt -> AlgMatElt, AlgMatElt, [ <RngUPolElt, RngIntElt ]
- PrimaryRationalForm(A) : Mtrx -> AlgMatElt, AlgMatElt, [ <RngUPolElt, RngIntElt ]
Prime
- BadPrimeData(L) : LSer -> SeqEnum
- ClassGroupPrimeRepresentatives(O, I) : RngOrd, RngOrdIdl -> Map
- ComputePrimeFactorisation(~D) : DivSchElt ->
- DegreeOnePrimeIdeals(O, B) : RngOrd, RngIntElt -> [ RngOrdIdl ]
- IsFactorisationPrime(D) : DivSchElt -> BoolElt
- IsPrime(D) : DivSchElt -> BoolElt
- IsPrime(I) : OMIdl -> BoolElt
- IsPrime(I) : OMIdl -> BoolElt
- IsPrime(x) : RngElt -> BoolElt
- IsPrime(I) : RngFunOrdIdl -> BoolElt
- IsPrime(n) : RngIntElt -> BoolElt
- IsPrime(n) : RngIntElt -> BoolElt
- IsPrime(I) : RngMPol -> BoolElt
- IsPrime(I) : RngMPolRes -> BoolElt
- IsPrime(I) : RngOrdIdl -> BoolElt, RngOrdIdl
- IsPrimeField(F) : Fld -> BoolElt
- IsPrimePower(n) : RngIntElt -> BoolElt, RngIntElt, RngIntElt
- IsProbablePrime(n: parameter) : RngIntElt -> BoolElt
- NegativePrimeDivisors(D) : DivSchElt -> SeqEnum
- NextPrime(n) : RngIntElt -> RngIntElt
- NthPrime(n) : RngIntElt -> RngIntElt
- NumberOfPrimePolynomials(q, d) : RngIntElt, RngIntElt -> RngIntElt
- PreviousPrime(n) : RngIntElt -> RngIntElt
- PrimalityCertificate(n) : RngIntElt -> List
- Prime(L) : FldXPad -> RngIntElt
- Prime(M) : ModSS -> RngIntElt
- Prime(L) : RngLocA -> RngElt
- Prime(L) : RngPad -> RngIntElt
- Prime(G) : SymGenLoc -> RngIntElt
- PrimeBasis(n) : RngIntElt -> [RngIntElt]
- PrimeBasis(n) : RngIntElt -> [RngIntElt]
- PrimeComponents(X) : Sch -> SeqEnum
- PrimeField(F) : Fld -> Fld
- PrimeField(F) : FldFin -> FldFin
- PrimeField(N) : Nfd -> FldFin
- PrimeForm(Q, p) : QuadBin, RngIntElt -> QuadBinElt
- PrimeIdeal(S, p) : AlgQuatOrd, RngElt -> AlgQuatOrdIdl
- PrimePolynomials(R, d) : RngUPol, RngIntElt -> SeqEnum[ RngUPolElt ]
- PrimePowerRepresentation(x, k, a) : FldFunGElt, RngIntElt, FldFunGElt -> SeqEnum
- PrimeRing(F) : FldFun -> Rng
- PrimeRing(R) : Rng -> Rng
- PrimeRing(L) : RngPad -> RngPad
- RandomPrime(n: parameter) : RngIntElt -> RngIntElt
- RandomPrime(n: parameter) : RngIntElt -> RngIntElt
- RandomPrime(n, a, b, x: parameter) :RngIntElt, RngIntElt, RngIntElt -> BoolElt, RngIntElt
- RandomPrime(n, a, b, x: parameter) :RngIntElt, RngIntElt, RngIntElt -> BoolElt, RngIntElt
- RandomPrimePolynomial(R, d) : RngUPol, RngIntElt -> RngUPolElt

V2.28, 13 July 2023

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