Changeset 4124
- Timestamp:
- 2016-06-01T14:18:19-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/criterion.lisp
r4123 r4124 40 40 in G pointed to by the integers in PAIR have disjoint (relatively prime) 41 41 monomials. This test is known as the first Buchberger criterion." 42 (declare (type pair pair))43 (let ((f ( pair-first pair))44 (g ( pair-second pair)))42 (declare (type critical-pair pair)) 43 (let ((f (critical-pair-first pair)) 44 (g (critical-pair-second pair))) 45 45 (when (rel-prime-p (leading-monomial f) (leading-monomial g)) 46 46 (debug-cgb ":1") … … 48 48 49 49 (defun criterion-2 (pair b-done partial-basis 50 &aux (f ( pair-first pair)) (g (pair-second pair))50 &aux (f (critical-pair-first pair)) (g (critical-pair-second pair)) 51 51 (place :before)) 52 52 "Returns T if the leading monomial of some element P of … … 55 55 each of the polynomials pointed to by the the PAIR has already been 56 56 treated, as indicated by the absence in the hash table B-done." 57 (declare (type pair pair) (type hash-table b-done)57 (declare (type critical-pair pair) (type hash-table b-done) 58 58 (type poly f g)) 59 59 ;; In the code below we assume that pairs are ordered as follows: … … 71 71 #+grobner-check(assert (eq place :in-the-middle)) 72 72 (setf place :after)) 73 ((and ( monom-divides-monom-lcm-p (leading-monomial h) (leading-monomial f) (leading-monomial g))73 ((and (divides-lcm-p (leading-monomial h) (leading-monomial f) (leading-monomial g)) 74 74 (gethash (case place 75 75 (:before (list h f))
Note:
See TracChangeset
for help on using the changeset viewer.