This CD holds a collection of basic constructs for univariate polynomials over rings.
The data structures for polynomials can be arithmetic expressions, for
instance using the ring1.expression symbol, or DMP as
in the CD polyd1.
This symbol is a binary function whose first argument should be a polynomial
f and whose second argument should be a non-negative integer n.
It represents the coefficient of the i-th power of the variable in the
polynomial f.
Example:
The coefficient of the first power of X in the polynomial (X+1)^2 in (Z/7Z)[X]
is equal to 2.
This symbol represents a
unary function, whose argument should be univariate polynomial. When applied
to a polynomial, it represents its degree, that is the highest power of the
variable occurring in a term of the polynomial. If the polynomial has no
terms, it is the zero polynomial, in which case the value represented is -1.
This symbol represents a
unary function, whose argument should be univariate polynomial. When applied
to a polynomial, it represents its leading term, that is the term that is the
product of
the highest power of the variable and its coefficient.
If the polynomial is zero, the value represented is zero.
This symbol represents a
unary function, whose argument should be univariate polynomial. When applied
to a polynomial, it represents the coefficient of the monomial of highest degree.
If the polynomial is zero, the value represented is zero.
This symbol represents a
unary function, whose argument should be a nonzero univariate polynomial. When applied
to such a polynomial, it represents the highest power of the variable
occurring in the polynomial.
Commented Mathematical property (CMP):
The leading term of a nonzero polynomial is the product of the
leading monomial and the leading coefficient of the polynomial.