1 |
|
---|
2 | ;;; LEX> (p q &optional (start 0) (end (length p))) [FUNCTION]
|
---|
3 | ;;; Return T if P>Q with respect to lexicographic order, otherwise NIL.
|
---|
4 | ;;; The second returned value is T if P=Q, otherwise it is NIL.
|
---|
5 | ;;;
|
---|
6 | ;;; TOTAL-DEGREE (m &optional (start 0) (end (length m))) [FUNCTION]
|
---|
7 | ;;; Return the todal degree of a monomoal M.
|
---|
8 | ;;;
|
---|
9 | ;;; GRLEX> (p q &optional (start 0) (end (length p))) [FUNCTION]
|
---|
10 | ;;; Return T if P>Q with respect to graded lexicographic order, otherwise
|
---|
11 | ;;; NIL. The second returned value is T if P=Q, otherwise it is NIL.
|
---|
12 | ;;;
|
---|
13 | ;;; GREVLEX> (p q &optional (start 0) (end (length p))) [FUNCTION]
|
---|
14 | ;;; Return T if P>Q with respect to graded reverse lexicographic order,
|
---|
15 | ;;; NIL otherwise. The second returned value is T if P=Q, otherwise it is
|
---|
16 | ;;; NIL.
|
---|
17 | ;;;
|
---|
18 | ;;; REVLEX> (p q &optional (start 0) (end (length p))) [FUNCTION]
|
---|
19 | ;;; Return T if P>Q with respect to reverse lexicographic order, NIL
|
---|
20 | ;;; otherwise. The second returned value is T if P=Q, otherwise it is
|
---|
21 | ;;; NIL. This is not and admissible monomial order because some sets do
|
---|
22 | ;;; not have a minimal element. This order is useful in constructing
|
---|
23 | ;;; other orders.
|
---|
24 | ;;;
|
---|
25 | ;;; INVLEX> (p q &optional (start 0) (end (length p))) [FUNCTION]
|
---|
26 | ;;; Return T if P>Q with respect to inverse lexicographic order, NIL
|
---|
27 | ;;; otherwise The second returned value is T if P=Q, otherwise it is NIL.
|
---|
28 | ;;;
|
---|
29 | ;;; ELIMINATION-ORDER (k &key (primary-order #'lex>) [FUNCTION]
|
---|
30 | ;;; (secondary-order #'lex>))
|
---|
31 | ;;; Return a predicate which compares monomials according to the
|
---|
32 | ;;; K-th elimination order. Two optional arguments are PRIMARY-ORDER
|
---|
33 | ;;; and SECONDARY-ORDER and they should be term orders which are used
|
---|
34 | ;;; on the first K and the remaining variables.
|
---|
35 | ;;;
|
---|
36 | ;;; ELIMINATION-ORDER-1 (order) [FUNCTION]
|
---|
37 | ;;; A special case of the ELIMINATION-ORDER when there is only
|
---|
38 | ;;; one primary variable.
|
---|
39 | ;;;
|
---|