- Timestamp:
- 2015-06-10T20:42:16-07:00 (10 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/division.lisp
r1181 r1182 153 153 154 154 ;; Merge it sometime with poly-pseudo-divide 155 (defun normal-form (ring f fl &optional (top-reduction-only $poly_top_reduction_only)) 155 (defun normal-form (ring-and-order f fl 156 &optional 157 (top-reduction-only $poly_top_reduction_only) 158 (ring (ro-ring ring-and-order))) 156 159 ;; Loop invariant: c*f0=sum ai*fi+r+f, where f0 is the initial value of f 157 160 #+grobner-check(when (null fl) (warn "normal-form: empty divisor list.")) … … 171 174 (type poly r)) 172 175 (multiple-value-setq (f r c division-count) 173 (normal-form-step ring fl f r c division-count))))176 (normal-form-step ring-and-order fl f r c division-count)))) 174 177 175 178 (defun buchberger-criterion (ring g)
Note:
See TracChangeset
for help on using the changeset viewer.