source: CGBLisp/doc/poly.txt@ 1

;;; SCALAR-TIMES-POLY (c p &optional (ring *coefficient-ring*))      [FUNCTION]
;;;    Return product of a scalar C by a polynomial P with coefficient ring
;;;    RING. 
;;;
;;; TERM-TIMES-POLY (term f &optional (ring *coefficient-ring*))     [FUNCTION]
;;;    Return product of a term TERM by a polynomial F with coefficient ring
;;;    RING. 
;;;
;;; MONOM-TIMES-POLY (m f)                                           [FUNCTION]
;;;    Return product of a monomial M by a polynomial F with coefficient
;;;    ring RING. 
;;;
;;; MINUS-POLY (f &optional (ring *coefficient-ring*))               [FUNCTION]
;;;    Changes the sign of a polynomial F with coefficients in coefficient
;;;    ring RING, and returns the result.
;;;
;;; SORT-POLY (poly &optional (pred #'lex>) (start 0)                [FUNCTION]
;;;            (end (unless (null poly) (length (caar poly)))))
;;;    Destructively Sorts a polynomial POLY by predicate PRED; the
;;;    predicate is assumed to take arguments START and END in addition to
;;;    the pair of monomials, as the functions in the ORDER package do.
;;;
;;; POLY+ (p q &optional (pred #'lex>) (ring *coefficient-ring*))    [FUNCTION]
;;;    Returns the sum of two polynomials P and Q with coefficients in
;;;    ring RING, with terms ordered according to monomial order PRED.
;;;
;;; POLY- (p q &optional (pred #'lex>) (ring *coefficient-ring*))    [FUNCTION]
;;;    Returns the difference of two polynomials P and Q with coefficients
;;;    in ring RING, with terms ordered according to monomial order PRED.
;;;
;;; POLY* (p q &optional (pred #'lex>) (ring *coefficient-ring*))    [FUNCTION]
;;;    Returns the product of two polynomials P and Q with coefficients in
;;;    ring RING, with terms ordered according to monomial order PRED.
;;;
;;; POLY-OP (f m g pred ring)                                        [FUNCTION]
;;;    Returns F-M*G, where F and G are polynomials with coefficients in
;;;    ring RING, ordered according to monomial order PRED and M is a
;;;    monomial.
;;;
;;; POLY-EXPT (poly n &optional (pred #'lex>)                        [FUNCTION]
;;;            (ring *coefficient-ring*))
;;;    Exponentiate a polynomial POLY to power N. The terms of the
;;;    polynomial are assumed to be ordered by monomial order PRED and with
;;;    coefficients in ring RING.  Use the Chinese algorithm; assume N>=0
;;;    and POLY is non-zero (not NIL).
;;;
;;; POLY-MEXPT (plist monom &optional (pred #'lex>)                  [FUNCTION]
;;;             (ring *coefficient-ring*))
;;;    Raise a polynomial vector represented ad a list of polynomials
;;;    PLIST to power MULTIINDEX.  Every polynomial has its terms ordered by
;;;    predicate PRED and coefficients in the ring RING.
;;;
;;; POLY-CONSTANT-P (p)                                              [FUNCTION]
;;;    Returns T if P is a constant polynomial.
;;;
;;; POLY-EXTEND (p &optional (m (list 0)))                           [FUNCTION]
;;;    Given a polynomial P in k[x[r+1],...,xn], it returns the same
;;;    polynomial as an element of k[x1,...,xn], optionally multiplying it
;;;    by a monomial x1^m1*x2^m2*...*xr^mr, where m=(m1,m2,...,mr) is a
;;;    multiindex.
;;;
;;; POLY-EXTEND-END (p &optional (m (list 0)))                       [FUNCTION]
;;;    Similar to POLY-EXTEND, but it adds new variables at the end.
;;;
;;; POLY-ZEROP (p)                                                   [FUNCTION]
;;;    Returns T if P is a zero polynomial.
;;;
;;; LT (p)                                                           [FUNCTION]
;;;    Returns the leading term of a polynomial P.
;;;
;;; LM (p)                                                           [FUNCTION]
;;;    Returns the leading monomial of a polynomial P.
;;;
;;; LC (p)                                                           [FUNCTION]
;;;    Returns the leading coefficient of a polynomial P.
;;;