PolynomialFactorizationExplicit¶
catdef.spad line 1227 [edit on github]
This is the category of domains that know “enough” about themselves in order to factor univariate polynomials over their fraction field.
- 0: %
from AbelianMonoid
- 1: %
from MagmaWithUnit
- *: (%, %) -> %
from LeftModule %
- *: (Integer, %) -> %
from AbelianGroup
- *: (NonNegativeInteger, %) -> %
from AbelianMonoid
- *: (PositiveInteger, %) -> %
from AbelianSemiGroup
- +: (%, %) -> %
from AbelianSemiGroup
- -: % -> %
from AbelianGroup
- -: (%, %) -> %
from AbelianGroup
- ^: (%, NonNegativeInteger) -> %
from MagmaWithUnit
- ^: (%, PositiveInteger) -> %
from Magma
- annihilate?: (%, %) -> Boolean
from Rng
- antiCommutator: (%, %) -> %
- associates?: (%, %) -> Boolean
from EntireRing
- associator: (%, %, %) -> %
from NonAssociativeRng
- characteristic: () -> NonNegativeInteger
from NonAssociativeRing
- charthRoot: % -> Union(%, failed) if % has CharacteristicNonZero
charthRoot(r)returns thep-th root ofr, or “failed” if none exists in the domain.
- coerce: % -> %
from Algebra %
- coerce: % -> OutputForm
from CoercibleTo OutputForm
- coerce: Integer -> %
from NonAssociativeRing
- commutator: (%, %) -> %
from NonAssociativeRng
- conditionP: Matrix % -> Union(Vector %, failed) if % has CharacteristicNonZero
conditionP(m)returns a vector of elements, not all zero, whosep-th powers (pis the characteristic of the domain) are a solution of the homogenous linear system represented bym, or “failed” is there is no such vector.
- exquo: (%, %) -> Union(%, failed)
from EntireRing
- factorPolynomial: SparseUnivariatePolynomial % -> Factored SparseUnivariatePolynomial %
factorPolynomial(p)returns the factorization into irreducibles of the univariate polynomialp.
- factorSquareFreePolynomial: SparseUnivariatePolynomial % -> Factored SparseUnivariatePolynomial %
factorSquareFreePolynomial(p)factors the univariate polynomialpinto irreducibles wherepis known to be square free and primitive with respect to its main variable.
- gcdPolynomial: (SparseUnivariatePolynomial %, SparseUnivariatePolynomial %) -> SparseUnivariatePolynomial %
gcdPolynomial(p, q)returns thegcdof the univariate polynomialspqndq.
- latex: % -> String
from SetCategory
- lcmCoef: (%, %) -> Record(llcm_res: %, coeff1: %, coeff2: %)
from LeftOreRing
- leftPower: (%, NonNegativeInteger) -> %
from MagmaWithUnit
- leftPower: (%, PositiveInteger) -> %
from Magma
- leftRecip: % -> Union(%, failed)
from MagmaWithUnit
- one?: % -> Boolean
from MagmaWithUnit
- opposite?: (%, %) -> Boolean
from AbelianMonoid
- plenaryPower: (%, PositiveInteger) -> %
from NonAssociativeAlgebra %
- recip: % -> Union(%, failed)
from MagmaWithUnit
- rightPower: (%, NonNegativeInteger) -> %
from MagmaWithUnit
- rightPower: (%, PositiveInteger) -> %
from Magma
- rightRecip: % -> Union(%, failed)
from MagmaWithUnit
- sample: %
from AbelianMonoid
- solveLinearPolynomialEquation: (List SparseUnivariatePolynomial %, SparseUnivariatePolynomial %) -> Union(List SparseUnivariatePolynomial %, failed)
solveLinearPolynomialEquation([f1, ..., fn], g)(where thefiare relatively prime to each other) returns a list ofaisuch thatg/prod fi = sum ai/fior returns “failed” if no such list ofai'sexists.
- squareFree: % -> Factored %
- squareFreePart: % -> %
- squareFreePolynomial: SparseUnivariatePolynomial % -> Factored SparseUnivariatePolynomial %
squareFreePolynomial(p)returns the square-free factorization of the univariate polynomialp.
- subtractIfCan: (%, %) -> Union(%, failed)
- unit?: % -> Boolean
from EntireRing
- unitCanonical: % -> %
from EntireRing
- unitNormal: % -> Record(unit: %, canonical: %, associate: %)
from EntireRing
- zero?: % -> Boolean
from AbelianMonoid
Algebra %
BiModule(%, %)
Module %