| 1 | ;;; -*- Mode: Lisp; Package: Maxima; Syntax: Common-Lisp; Base: 10 -*-
|
|---|
| 2 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|---|
| 3 | ;;;
|
|---|
| 4 | ;;; Copyright (C) 1999, 2002, 2009, 2015 Marek Rychlik <rychlik@u.arizona.edu>
|
|---|
| 5 | ;;;
|
|---|
| 6 | ;;; This program is free software; you can redistribute it and/or modify
|
|---|
| 7 | ;;; it under the terms of the GNU General Public License as published by
|
|---|
| 8 | ;;; the Free Software Foundation; either version 2 of the License, or
|
|---|
| 9 | ;;; (at your option) any later version.
|
|---|
| 10 | ;;;
|
|---|
| 11 | ;;; This program is distributed in the hope that it will be useful,
|
|---|
| 12 | ;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 13 | ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 14 | ;;; GNU General Public License for more details.
|
|---|
| 15 | ;;;
|
|---|
| 16 | ;;; You should have received a copy of the GNU General Public License
|
|---|
| 17 | ;;; along with this program; if not, write to the Free Software
|
|---|
| 18 | ;;; Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|---|
| 19 | ;;;
|
|---|
| 20 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|---|
| 21 |
|
|---|
| 22 | (defpackage "NGROBNER"
|
|---|
| 23 | (:use :cl)
|
|---|
| 24 | (:export
|
|---|
| 25 | "$LEX" "$GRLEX" "$GREVLEX" "$INVLEX" "$RING_OF_INTEGERS"
|
|---|
| 26 | "$POLY_ELIMINATION_ORDER" "$POLY_MONOMIAL_ORDER"
|
|---|
| 27 | "$POLY_MONOMIAL_ORDER" "$POLY_PRIMARY_ELIMINATION_ORDER"
|
|---|
| 28 | "$POLY_PRIMARY_ELIMINATION_ORDER" "$POLY_RETURN_TERM_LIST"
|
|---|
| 29 | "$POLY_SECONDARY_ELIMINATION_ORDER" "*EXPRESSION-RING*"
|
|---|
| 30 | "*ELIMINATION-ORDER*" "*MONOMIAL-ORDER*"
|
|---|
| 31 | "*PRIMARY-ELIMINATION-ORDER*" "*SECONDARY-ELIMINATION-ORDER*"
|
|---|
| 32 | "*RATDISREP-FUN*" "BUCHBERGER" "BUCHBERGER-CRITERION"
|
|---|
| 33 | "COERCE-COEFF" "COERCE-TO-MAXIMA" "COLON-IDEAL" "ELIMINATION-IDEAL"
|
|---|
| 34 | "GROBNER" "FIND-ORDER" "FIND-RING" "$POLY_COEFFICIENT_RING"
|
|---|
| 35 | "GROBNER-EQUAL" "GROBNER-MEMBER" "GROBNER-SUBSETP"
|
|---|
| 36 | "IDEAL-INTERSECTION" "IDEAL-POLYSATURATION"
|
|---|
| 37 | "IDEAL-POLYSATURATION-1" "IDEAL-SATURATION" "IDEAL-SATURATION-1"
|
|---|
| 38 | "MAKE-POLY-FROM-TERMLIST" "MAKE-POLY-ZERO" "MAKE-RING" "MAKE-TERM"
|
|---|
| 39 | "MAKE-VARIABLE" "MINIMIZATION" "NORMAL-FORM" "POLY-ADD"
|
|---|
| 40 | "MONOM-EXPONENTS" "POLY-CONTENT" "POLY-DEPENDS-P"
|
|---|
| 41 | "POLY-EXACT-DIVIDE" "POLY-EXPT" "POLY-LCM" "POLY-LM" "POLY-LT"
|
|---|
| 42 | "POLY-MUL" "POLY-NORMALIZE" "POLY-NORMALIZE-LIST"
|
|---|
| 43 | "POLY-PRIMITIVE-PART" "POLY-PSEUDO-DIVIDE" "POLY-SUB" "POLY-UMINUS"
|
|---|
| 44 | "POLY-ZEROP" "POLYSATURATION-EXTENSION" "POLY-TERMLIST"
|
|---|
| 45 | "REDUCED-GROBNER" "REDUCTION" "RING-UNIT" "SATURATION-EXTENSION"
|
|---|
| 46 | "SPOLY" "$POLY_COEFFICIENT_RING" "$POLY_ELIMINATION_ORDER"
|
|---|
| 47 | "TERM-COEFF" "TERM-MONOM" "$POLY_GROBNER_DEBUG" "MAKELIST-1" "MAKELIST"
|
|---|
| 48 | "MAKE-MONOM" "LEX>" "GRLEX>" "GREVLEX>" "REVLEX>" "INVLEX>"
|
|---|
| 49 | "ELIMINATION-ORDER" "ELIMINATION-ORDER-1"
|
|---|
| 50 | "*PRIMARY-ELIMINATION-ORDER*"
|
|---|
| 51 | "*SECONDARY-ELIMINATION-ORDER*"
|
|---|
| 52 | "*ELIMINATION-ORDER*"
|
|---|
| 53 | ))
|
|---|
| 54 |
|
|---|
| 55 | (in-package :ngrobner)
|
|---|
| 56 |
|
|---|
| 57 | (defun compile-ngrobner ()
|
|---|
| 58 | "Compile/load NGROBNER package files without ASDF. The order of files is
|
|---|
| 59 | important!"
|
|---|
| 60 | (dolist (file '("ngrobner-package" "utils" "ngrobner" "monomial"
|
|---|
| 61 | "order" "term" "termlist" "polynomial" "priority-queue"
|
|---|
| 62 | "pair-queue" "division" "criterion" "buchberger" "gebauer-moeller"
|
|---|
| 63 | "gb-postprocessing" "ideal"))
|
|---|
| 64 | (compile-file file :verbose t :print t)))
|
|---|
| 65 |
|
|---|
