Changeset 1665 for branches/f4grobner
- Timestamp:
- 2015-06-14T20:48:05-07:00 (10 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/5am-tests.lisp
r1612 r1665 125 125 (t2 (make-term m2 9)) 126 126 (t3 (make-term m3 (* 7 9)))) 127 (is (equalp (term-mul *ring-of-integers*t1 t2) t3))))127 (is (equalp (term-mul +ring-of-integers+ t1 t2) t3)))) 128 128 129 129 (test termlist … … 157 157 "Conversion to infix form" 158 158 (is (equal 159 (coerce-to-infix :term (make-term-variable *ring-of-integers*5 3) '(x y z w u v))159 (coerce-to-infix :term (make-term-variable +ring-of-integers+ 5 3) '(x y z w u v)) 160 160 '(* 1 (EXPT X 0) (EXPT Y 0) (EXPT Z 0) (EXPT W 1) (EXPT U 0))))) 161 161 … … 237 237 (y-sq (string->poly "y^2" '(x y))) 238 238 (fl (cdr (string->poly "[x+y,x-2*y]" '(x y)))) 239 (ring *ring-of-integers*)239 (ring +ring-of-integers+) 240 240 (order #'lex>) 241 241 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 248 248 (g (string->poly "x+2*y" '(x y))) 249 249 (h (string->poly "x-2*y" '(x y))) 250 (ring *ring-of-integers*)250 (ring +ring-of-integers+) 251 251 (order #'lex>) 252 252 (ring-and-order (make-ring-and-order :ring ring :order order))) … … 257 257 "Buchberger algorithm" 258 258 (let* ((fl (cdr (string->poly "[x+y,x-2*y]" '(x y)))) 259 (ring *ring-of-integers*)259 (ring +ring-of-integers+) 260 260 (order #'lex>) 261 261 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 268 268 "Gebauer-Moeller algorithm" 269 269 (let* ((fl (cdr (string->poly "[x+y,x-2*y]" '(x y)))) 270 (ring *ring-of-integers*)270 (ring +ring-of-integers+) 271 271 (order #'lex>) 272 272 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 278 278 "Reduction algorithm" 279 279 (let* ((fl (cdr (string->poly "[x^2,x+y,x-2*y]" '(x y)))) 280 (ring *ring-of-integers*)280 (ring +ring-of-integers+) 281 281 (order #'lex>) 282 282 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 296 296 (let* (($poly_grobner_algorithm :buchberger) 297 297 (fl (cdr (string->poly "[x+y,x-2*y]" '(x y)))) 298 (ring *ring-of-integers*)298 (ring +ring-of-integers+) 299 299 (order #'lex>) 300 300 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 310 310 (let* (($poly_grobner_algorithm :buchberger) 311 311 (fl (cdr (string->poly "[x+y,x-2*y]" '(x y)))) 312 (ring *ring-of-integers*)312 (ring +ring-of-integers+) 313 313 (order #'lex>) 314 314 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 322 322 (I (cdr (string->poly "[x^2*y,x*y^2]" '(x y)))) 323 323 (J (cdr (string->poly "[x,y]" '(x y)))) 324 (ring *ring-of-integers*)324 (ring +ring-of-integers+) 325 325 (order #'lex>) 326 326 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 333 333 (f (string->poly "x^2-y^2" '(x y))) 334 334 (g (string->poly "(x+y)^2" '(x y))) 335 (ring *ring-of-integers*)335 (ring +ring-of-integers+) 336 336 (order #'lex>) 337 337 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 344 344 (f (string->poly "y" '(x y))) 345 345 (fl (cdr (string->poly "[x-y,x+y,y]" '(x y)))) 346 (ring *ring-of-integers*)346 (ring +ring-of-integers+) 347 347 (order #'lex>) 348 348 (ring-and-order (make-ring-and-order :ring ring :order order))) … … 355 355 (fl (cdr (string->poly "[x,x-y,y]" '(x y)))) 356 356 (gl (cdr (string->poly "[x-y,x+2*y,y]" '(x y)))) 357 (ring *ring-of-integers*)357 (ring +ring-of-integers+) 358 358 (order #'lex>) 359 359 (ring-and-order (make-ring-and-order :ring ring :order order))) … … 368 368 (F (cdr (string->poly F-str '(x y)))) 369 369 (P (string->poly "x^2" '(x y))) 370 (ring *ring-of-integers*)370 (ring +ring-of-integers+) 371 371 (F-sat (append (cdr (string->poly F-str '(u x y))) 372 372 (cdr (string->poly "[u*x^2-1]" '(u x y)))))) … … 379 379 (F (cdr (string->poly F-str '(x y)))) 380 380 (P (cdr (string->poly "[x^2,x*y]" '(x y)))) 381 (ring *ring-of-integers*)381 (ring +ring-of-integers+) 382 382 (F-sat (append (cdr (string->poly F-str '(u1 u2 x y))) 383 383 (cdr (string->poly "[u1*(x^2) + u2*(x*y)-1]" '(u1 u2 x y)))))) … … 390 390 (F (cdr (string->poly "[x^3*(y+z^2),x^2*(y-z^2)]" '(x y z)))) 391 391 (p (string->poly "x" '(x y z))) 392 (ring *ring-of-integers*)392 (ring +ring-of-integers+) 393 393 (order #'lex>) 394 394 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 402 402 (F (cdr (string->poly "[x^3*z*y,x*z*y^2]" '(x y z)))) 403 403 (P (cdr (string->poly "[x,z]" '(x y z)))) 404 (ring *ring-of-integers*)404 (ring +ring-of-integers+) 405 405 (order #'lex>) 406 406 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 414 414 (F (cdr (string->poly "[x^3*(y+z^2),x^2*(y-z^2)]" '(x y z)))) 415 415 (P (cdr (string->poly "[x]" '(x y z)))) 416 (ring *ring-of-integers*)416 (ring +ring-of-integers+) 417 417 (order #'lex>) 418 418 (ring-and-order (make-ring-and-order :ring ring :order order)) … … 427 427 (P1 (cdr (string->poly "[x]" '(x y z)))) 428 428 (P2 (cdr (string->poly "[z]" '(x y z)))) 429 (ring *ring-of-integers*)429 (ring +ring-of-integers+) 430 430 (order #'lex>) 431 431 (ring-and-order (make-ring-and-order :ring ring :order order))
Note:
See TracChangeset
for help on using the changeset viewer.