Changeset 513 for branches

Timestamp:

2015-06-06T21:22:21-07:00 (10 years ago)

Author:

Marek Rychlik

Message:

* empty log message *

File:

• branches/f4grobner/ngrobner.lisp (modified) (2 diffs)

branches/f4grobner/ngrobner.lisp

@@ -60 +60 @@
 list of terms in the current monomial order rather than a Maxima general expression.")
 
-(defvar $poly_grobner_algorithm '$buchberger
-  "The name of the algorithm used to find grobner bases.")
-
-(defvar $poly_top_reduction_only nil
-  "If not FALSE, use top reduction only whenever possible.
-Top reduction means that division algorithm stops after the first reduction.")
-
-
 (defvar *ratdisrep-fun* #'identity
   "A function applied to polynomials after conversion to Maxima representation.")
@@ -110 +102 @@
 
 
-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;
-;; Selection of algorithm and pair heuristic
-;;
-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-
-(defun find-grobner-function (algorithm)
-  "Return a function which calculates Grobner basis, based on its
-names. Names currently used are either Lisp symbols, Maxima symbols or
-keywords."
-  (ecase algorithm
-    ((buchberger :buchberger $buchberger) #'buchberger)
-    ((parallel-buchberger :parallel-buchberger $parallel_buchberger) #'parallel-buchberger)
-    ((gebauer-moeller :gebauer_moeller $gebauer_moeller) #'gebauer-moeller)))
-
-(defun grobner (ring f &optional (start 0) (top-reduction-only nil))
-  ;;(setf F (sort F #'< :key #'sugar))
-  (funcall
-   (find-grobner-function $poly_grobner_algorithm)
-   ring f start top-reduction-only))
-
-(defun reduced-grobner (ring f &optional (start 0) (top-reduction-only $poly_top_reduction_only))
-  (reduction ring (grobner ring f start top-reduction-only)))
 
 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;