- Timestamp:
- 2015-06-12T14:53:56-07:00 (10 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/gb-postprocessing.lisp
r1359 r1540 47 47 ;;Find p in Q such that p is reducible mod Q\{p} 48 48 (setf found nil) 49 (dolist (x q) 50 (let ((q1 (remove x q))) 51 (multiple-value-bind (h c div-count) 52 (normal-form ring-and-order x q1 nil #| not a top reduction! |# ) 53 (declare (ignore c)) 54 (unless (zerop div-count) 55 (setf found t q q1) 56 (unless (poly-zerop h) 57 (setf q (nconc q1 (list h)))) 58 (return))))))) 49 (let ((x (find-if 50 #'(lambda (y) 51 (multiple-value-bind (h c div-count) 52 (normal-form ring-and-order 53 y 54 (remove y q) 55 nil #| not a top reduction! |# 56 ) 57 (declare (ignore c)) 58 (plusp (zerop div-count))))))) 59 (when x 60 (setf found t 61 q (delete x q)))))) 59 62 60 63 (defun minimization (plist)
Note:
See TracChangeset
for help on using the changeset viewer.