Univariate Polynomial Rings
- Introduction
- Creation Functions
- Creation of Structures
- Print Options
- Creation of Elements
P . 1: RngUPol, RngInt → RngPolElt
elt< P | a₀, ..., a_d >: RngUPol, RngElt, ..., RngElt → RngUPolElt
P ! s: RngUPol, RngElt → RngPolElt
P ! s: RngUPol, [ RngElt ] → RngPolElt
elt< P | s >: RngUPol, [ RngElt ] → RngUPolElt
Polynomial(Q): [ RngElt ] → RngUPolElt
Polynomial(R, Q): Rng, [ RngElt] → RngUPolElt
Polynomial(R, f): Rng, RngUPolElt → RngUPolElt
One(P): RngUPol → RngUPolElt
Identity(P): RngUPol → RngUPolElt
Zero(P): RngUPol → RngUPolElt
Representative(P): RngUPol → RngUPolElt
Example: Polynomials
- Structure Operations
- Element Operations
- Parent and Category
- Arithmetic Operators
+ a: RngUPolElt → RngUPolElt
- a: RngUPolElt → RngUPolElt
a + b: RngUPolElt, RngUPolElt → RngUPolElt
a - b: RngUPolElt, RngUPolElt → RngUPolElt
a * b: RngUPolElt, RngUPolElt → RngUPolElt
a ^ k: RngUPolElt, RngIntElt → RngUPolElt
a / b: RngUPolElt, RngElt → FldFunUElt
a div b: RngUPolElt, RngUPolElt → RngUPolElt
a mod b: RngUPolElt, RngUPolElt → RngUPolElt
a +:= b: RngUPolElt, RngUPolElt → RngUPolElt
a -:= b: RngUPolElt, RngUPolElt → RngUPolElt
a *:= b: RngUPolElt, RngUPolElt → RngUPolElt
- Equality and Membership
- Predicates on Ring Elements
- Coefficients and Terms
- Degree
- Roots
Roots(p): RngUPolElt → [ < RngElt, RngIntElt> ]
Roots(p, S): RngUPolElt → [ < RngElt, RngIntElt> ]
HasRoot(p): RngUPolElt → BoolElt, RngElt
HasRoot(p, S): RngUPolElt, Rng → BoolElt, RngElt
SmallRoots(p, N, X): RngUPolElt, RngElt, RngElt → [RngElt]
Example: Small Roots Usage
SetVerbose("SmallRoots", v): MonStgElt, RngIntElt
- Derivative, Integral
- Evaluation, Interpolation
- Decomposition
- Quotient and Remainder
Quotrem(f, g): RngUPolElt, RngUPolElt → RngUPolElt, RngUPolElt
f div g: RngUPolElt, RngUPolElt → RngUPolElt
IsDivisibleBy(f, g): RngUPolElt, RngUPolElt → BoolElt, RngUPolElt
ExactQuotient(f, g): RngUPolElt, RngUPolElt → RngUPolElt
f mod g: RngUPolElt, RngUPolElt → RngUPolElt
Valuation(f, g): RngUPolElt, RngUPolElt → RngIntElt
Reductum(f): RngUPolElt → RngUPolElt
PseudoRemainder(f, g): RngUPolElt, RngUPolElt → RngUPolElt
EuclideanNorm(p): RngUPol → RngIntElt
- Modular Arithmetic
- Other Operations
- Common Divisors and Common Multiples
- Common Divisors and Common Multiples
GreatestCommonDivisor(f, g): RngUPolElt, RngUPolElt → RngUPolElt
Gcd(f, g): RngUPolElt, RngUPolElt → RngUPolElt
GCD(f, g): RngUPolElt, RngUPolElt → RngUPolElt
ExtendedGreatestCommonDivisor(f, g): RngUPolElt, RngUPolElt → RngUPolElt, RngUPolElt, RngUPolElt
Xgcd(f, g): RngUPolElt, RngUPolElt → RngUPolElt, RngUPolElt, RngUPolElt
XGCD(f, g): RngUPolElt, RngUPolElt → RngUPolElt, RngUPolElt, RngUPolElt
LeastCommonMultiple(f, g): RngUPolElt, RngUPolElt → RngUPolElt
Lcm(f, g): RngUPolElt, RngUPolElt → RngUPolElt
LCM(f, g): RngUPolElt, RngUPolElt → RngUPolElt
Normalize(f): RngUPolElt → RngUPolElt
- Content and Primitive Part
- Polynomials over the Integers
- Polynomials over Finite Fields
PrimePolynomials(R, d): RngUPol, RngIntElt → SeqEnum[ RngUPolElt ]
PrimePolynomials(R, d, n): RngUPol, RngIntElt, RngIntElt → SeqEnum[ RngUPolElt ]
RandomPrimePolynomial(R, d): RngUPol, RngIntElt → RngUPolElt
NumberOfPrimePolynomials(q, d): RngIntElt, RngIntElt → RngIntElt
NumberOfPrimePolynomials(K, d): FldFin, RngIntElt → RngIntElt
NumberOfPrimePolynomials(R, d): RngUPol, RngIntElt → RngIntElt
JacobiSymbol(a,b): RngUPol, RngUPol → RngIntElt
- Factorization
- Factorization and Irreducibility
Factorization(f): RngUPolElt → [ < RngUPolElt, RngIntElt >], RngElt
Factorisation(f): RngUPolElt → [ < RngUPolElt, RngIntElt >], RngElt
HasPolynomialFactorization(R): Rng → BoolElt
SetVerbose("PolyFact", v): MonStgElt, RngIntElt
FactorisationToPolynomial(f): [Tup] → BoolElt
Facpol(f): [Tup] → BoolElt
Example: Swinnerton Dyer Polynomial
SquarefreeFactorization(f): RngUPolElt → [ <RngUPolElt, RngIntElt> ]
DistinctDegreeFactorization(f): RngUPolElt → [ <RngIntElt, RngUPolElt> ]
EqualDegreeFactorization(f, d, g): RngUPolElt, RngIntElt, RngUPolElt → [ RngUPolElt ]
IsIrreducible(f): RngUPolElt → BoolElt
IsSeparable(f): RngUPolElt → BoolElt
QMatrix(f): RngUPolElt → AlgMatElt
- Sylvester Matrix, Resultant and Discriminant
- Hensel Lifting
- Ideals and Quotient Rings
- Creation of Ideals and Quotients
ideal< R | a₁, ..., aᵣ >: RngUPol, RngUPolElt, ..., RngUPolElt → RngUPol
quo< R | I >: RngUPol, RngUPol → RngUPolRes
quo< R | a₁, ..., aᵣ >: RngUPol, RngUPolElt, ..., RngUPolElt → RngUPolRes, Map
- Ideal Arithmetic
- Other Functions on Ideals
- Other Functions on Quotients
- Special Families of Polynomials