version 1.5, 2000/06/08 08:35:01 |
version 1.17, 2004/05/13 05:52:53 |
|
|
% $OpenXM: OpenXM/src/kan96xx/Doc/hol.sm1,v 1.4 2000/03/14 13:01:28 takayama Exp $ |
% $OpenXM: OpenXM/src/kan96xx/Doc/hol.sm1,v 1.16 2004/05/04 08:29:35 takayama Exp $ |
%% hol.sm1, 1998, 11/8, 11/10, 11/14, 11/25, 1999, 5/18, 6/5. 2000, 6/8 |
%% hol.sm1, 1998, 11/8, 11/10, 11/14, 11/25, 1999, 5/18, 6/5. 2000, 6/8 |
%% rank, rrank, characteristic |
%% rank, rrank, characteristic |
%% This file is error clean. |
%% This file is error clean. |
Line 13 hol.version [(Version)] system_variable gt |
|
Line 13 hol.version [(Version)] system_variable gt |
|
$hol.sm1, basic package for holonomic systems (C) N.Takayama, 2000, 06/08 $ |
$hol.sm1, basic package for holonomic systems (C) N.Takayama, 2000, 06/08 $ |
message-quiet |
message-quiet |
|
|
|
/gb.warning 0 def |
|
/gb.oxRingStructure [ ] def |
/rank.v [(x) (y) (z)] def %% default value of v (variables). |
/rank.v [(x) (y) (z)] def %% default value of v (variables). |
/rank.ch [ ] def %% characteristic variety. |
/rank.ch [ ] def %% characteristic variety. |
/rank.verbose 0 def |
/rank.verbose 0 def |
|
|
/gb.v 1 def |
/gb.v 1 def |
/gb.verbose 0 def |
/gb.verbose 0 def |
/gb.options [ ] def |
/gb.options [ ] def |
|
/gb.characteristic 0 def |
|
/gb.homogenized 0 def |
|
/gb.autoHomogenize 1 def |
/gb { |
/gb { |
/arg1 set |
/arg1 set |
[/in-gb /aa /typev /setarg /f /v |
[/in-gb /aa /typev /setarg /f /v |
/gg /wv /termorder /vec /ans /rr /mm |
/gg /wv /termorder /vec /ans /rr /mm |
|
/degreeShift /env2 |
] pushVariables |
] pushVariables |
[(CurrentRingp) (KanGBmessage)] pushEnv |
[(CurrentRingp) (KanGBmessage)] pushEnv |
[ |
[ |
|
|
aa isArray { } { ( << array >> gb) error } ifelse |
aa isArray { } { ( << array >> gb) error } ifelse |
/setarg 0 def |
/setarg 0 def |
/wv 0 def |
/wv 0 def |
|
/degreeShift 0 def |
aa { tag } map /typev set |
aa { tag } map /typev set |
typev [ ArrayP ] eq |
typev [ ArrayP ] eq |
{ /f aa 0 get def |
{ /f aa 0 get def |
|
|
/v aa 1 get def |
/v aa 1 get def |
/setarg 1 def |
/setarg 1 def |
} { } ifelse |
} { } ifelse |
|
typev [ArrayP RingP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/setarg 1 def |
|
} { } ifelse |
typev [ArrayP ArrayP] eq |
typev [ArrayP ArrayP] eq |
{ /f aa 0 get def |
{ /f aa 0 get def |
/v aa 1 get from_records def |
/v aa 1 get from_records def |
|
|
/wv aa 2 get def |
/wv aa 2 get def |
/setarg 1 def |
/setarg 1 def |
} { } ifelse |
} { } ifelse |
|
typev [ArrayP StringP ArrayP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/wv aa 2 get def |
|
/degreeShift aa 3 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP ArrayP ArrayP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get from_records def |
|
/wv aa 2 get def |
|
/degreeShift aa 3 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
|
|
/env1 getOptions def |
|
|
setarg { } { (gb : Argument mismatch) error } ifelse |
setarg { } { (gb : Argument mismatch) error } ifelse |
|
|
[(KanGBmessage) gb.verbose ] system_variable |
[(KanGBmessage) gb.verbose ] system_variable |
|
|
%%% Start of the preprocess |
%%% Start of the preprocess |
f getRing /rr set |
v tag RingP eq { |
|
/rr v def |
|
}{ |
|
f getRing /rr set |
|
} ifelse |
%% To the normal form : matrix expression. |
%% To the normal form : matrix expression. |
f gb.toMatrixOfString /f set |
f gb.toMatrixOfString /f set |
/mm gb.itWasMatrix def |
/mm gb.itWasMatrix def |
|
|
rr tag 0 eq { |
rr tag 0 eq |
|
v isInteger not |
|
or { |
%% Define our own ring |
%% Define our own ring |
v isInteger { |
v isInteger { |
(Error in gb: Specify variables) error |
(Error in gb: Specify variables) error |
} { } ifelse |
} { } ifelse |
wv isInteger { |
wv isInteger { |
[v ring_of_differential_operators |
[v ring_of_differential_operators |
0] define_ring |
gb.characteristic] define_ring |
/termorder 1 def |
/termorder 1 def |
}{ |
}{ |
[v ring_of_differential_operators |
degreeShift isInteger { |
wv weight_vector |
[v ring_of_differential_operators |
0] define_ring |
wv weight_vector |
wv gb.isTermOrder /termorder set |
gb.characteristic] define_ring |
|
wv gb.isTermOrder /termorder set |
|
}{ |
|
[v ring_of_differential_operators |
|
wv weight_vector |
|
gb.characteristic |
|
[(degreeShift) degreeShift] |
|
] define_ring |
|
wv gb.isTermOrder /termorder set |
|
} ifelse |
} ifelse |
} ifelse |
} { |
} { |
%% Use the ring structre given by the input. |
%% Use the ring structre given by the input. |
v isInteger not { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
|
rr ring_def |
rr ring_def |
/wv rr gb.getWeight def |
/wv rr gb.getWeight def |
wv gb.isTermOrder /termorder set |
wv gb.isTermOrder /termorder set |
} ifelse |
} ifelse |
%%% Enf of the preprocess |
%%% Enf of the preprocess |
|
|
|
termorder { |
|
/gb.homogenized 0 def |
|
}{ |
|
/gb.homogenized 1 def |
|
} ifelse |
gb.verbose { (gb.options = ) messagen gb.options message } { } ifelse |
gb.verbose { (gb.options = ) messagen gb.options message } { } ifelse |
termorder { |
termorder { |
f { {. dehomogenize} map } map /f set |
f { {,,, dehomogenize} map } map /f set |
[f gb.options] groebner_sugar 0 get /gg set |
[f gb.options] groebner_sugar 0 get /gg set |
}{ |
}{ |
f { {. dehomogenize} map} map /f set |
f { {,,, dehomogenize} map} map /f set |
f fromVectors { homogenize } map /f set |
gb.autoHomogenize { |
|
f fromVectors { homogenize } map /f set |
|
} { } ifelse |
[f gb.options] groebner 0 get /gg set |
[f gb.options] groebner 0 get /gg set |
}ifelse |
}ifelse |
wv isInteger { |
wv isInteger { |
|
|
/ans set |
/ans set |
}{ } |
}{ } |
ifelse |
ifelse |
|
ans getRing (oxRingStructure) dc /gb.oxRingStructure set |
%% |
%% |
|
env1 restoreOptions %% degreeShift changes "grade" |
|
|
/arg1 ans def |
/arg1 ans def |
] pop |
] pop |
|
|
} { } ifelse |
} { } ifelse |
wv isInteger { |
wv isInteger { |
[v ring_of_polynomials |
[v ring_of_polynomials |
0] define_ring |
gb.characteristic] define_ring |
/termorder 1 def |
/termorder 1 def |
}{ |
}{ |
[v ring_of_polynomials |
[v ring_of_polynomials |
wv weight_vector |
wv weight_vector |
0] define_ring |
gb.characteristic] define_ring |
wv gb.isTermOrder /termorder set |
wv gb.isTermOrder /termorder set |
} ifelse |
} ifelse |
} { |
} { |
%% Use the ring structre given by the input. |
%% Use the ring structre given by the input. |
v isInteger not { |
v isInteger not { |
(Warning : the given ring definition is not used.) message |
gb.warning { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
} { } ifelse |
} { } ifelse |
rr ring_def |
rr ring_def |
/wv rr gb.getWeight def |
/wv rr gb.getWeight def |
|
|
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f v]; array f; string v; v is the variables. ) |
(a : [f v]; array f; string v; v is the variables. ) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
|
(a : [f v w ds]; array f; string v; array of array w; w is the weight matirx.) |
|
( array ds; ds is the degree shift ) |
( ) |
( ) |
|
(gb.authoHomogenize 1 [default]) |
|
(gb.oxRingStructure ) |
|
( ) |
$Example 1: [ [( (x Dx)^2 + (y Dy)^2 -1) ( x y Dx Dy -1)] (x,y) $ |
$Example 1: [ [( (x Dx)^2 + (y Dy)^2 -1) ( x y Dx Dy -1)] (x,y) $ |
$ [ [ (Dx) 1 ] ] ] gb pmat ; $ |
$ [ [ (Dx) 1 ] ] ] gb pmat ; $ |
(Example 2: ) |
(Example 2: ) |
|
|
$Example 4: [[ [(x^2) (y+x)] [(x+y) (y^3)] [(2 x^2+x y) (y+x+x y^3)]] (x,y) $ |
$Example 4: [[ [(x^2) (y+x)] [(x+y) (y^3)] [(2 x^2+x y) (y+x+x y^3)]] (x,y) $ |
$ [ [ (x) -1 (y) -1] ] ] gb pmat ; $ |
$ [ [ (x) -1 (y) -1] ] ] gb pmat ; $ |
( ) |
( ) |
|
$Example 5: [[ [(x^2) (y+x)] [(x+y) (y^3)] [(2 x^2+x y) (y+x+x y^3)]] (x,y) $ |
|
$ [ [ (x) -1 (y) -1] ] [[0 1] [-3 1] ] ] gb pmat ; $ |
|
( ) |
(cf. gb, groebner, groebner_sugar, syz. ) |
(cf. gb, groebner, groebner_sugar, syz. ) |
]] putUsages |
]] putUsages |
|
|
|
|
/v aa 1 get def |
/v aa 1 get def |
/setarg 1 def |
/setarg 1 def |
} { } ifelse |
} { } ifelse |
|
typev [ArrayP RingP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/setarg 1 def |
|
} { } ifelse |
typev [ArrayP ArrayP] eq |
typev [ArrayP ArrayP] eq |
{ /f aa 0 get def |
{ /f aa 0 get def |
/v aa 1 get from_records def |
/v aa 1 get from_records def |
|
|
/wv aa 2 get def |
/wv aa 2 get def |
/setarg 1 def |
/setarg 1 def |
} { } ifelse |
} { } ifelse |
|
typev [ArrayP RingP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/wv aa 2 get def |
|
/setarg 1 def |
|
} { } ifelse |
typev [ArrayP ArrayP ArrayP] eq |
typev [ArrayP ArrayP ArrayP] eq |
{ /f aa 0 get def |
{ /f aa 0 get def |
/v aa 1 get from_records def |
/v aa 1 get from_records def |
|
|
|
|
|
|
%%% Start of the preprocess |
%%% Start of the preprocess |
f getRing /rr set |
v tag RingP eq { |
|
/rr v def |
|
}{ |
|
f getRing /rr set |
|
} ifelse |
%% To the normal form : matrix expression. |
%% To the normal form : matrix expression. |
f gb.toMatrixOfString /f set |
f gb.toMatrixOfString /f set |
/mm gb.itWasMatrix def |
/mm gb.itWasMatrix def |
|
|
}{ |
}{ |
%% Use the ring structre given by the input. |
%% Use the ring structre given by the input. |
v isInteger not { |
v isInteger not { |
(Warning : the given ring definition is not used.) message |
gb.warning { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
} { } ifelse |
} { } ifelse |
rr ring_def |
rr ring_def |
/wv rr gb.getWeight def |
/wv rr gb.getWeight def |
|
|
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f v]; array f; string v; v is the variables.) |
(a : [f v]; array f; string v; v is the variables.) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
|
( v may be a ring object. ) |
$Example 1: [(x,y) ring_of_polynomials 0] define_ring $ |
$Example 1: [(x,y) ring_of_polynomials 0] define_ring $ |
$ [ [(x^2+y^2-4). (x y -1).] ] syz :: $ |
$ [ [(x^2+y^2-4). (x y -1).] ] syz :: $ |
$Example 2: [ [(x^2+y^2) (x y)] (x,y) [ [(x) -1 (y) -1] ] ] syz :: $ |
$Example 2: [ [(x^2+y^2) (x y)] (x,y) [ [(x) -1 (y) -1] ] ] syz :: $ |
|
|
} { |
} { |
%% Use the ring structre given by the input. |
%% Use the ring structre given by the input. |
v isInteger not { |
v isInteger not { |
(Warning : the given ring definition is not used.) message |
gb.warning { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
} { } ifelse |
} { } ifelse |
rr ring_def |
rr ring_def |
/wv rr gb.getWeight def |
/wv rr gb.getWeight def |
|
|
[ |
[ |
|
|
/aa arg1 def |
/aa arg1 def |
|
gb.verbose { (Getting in gb_h) message } { } ifelse |
aa isArray { } { ( << array >> gb_h) error } ifelse |
aa isArray { } { ( << array >> gb_h) error } ifelse |
/setarg 0 def |
/setarg 0 def |
/wv 0 def |
/wv 0 def |
|
|
/v aa 1 get def |
/v aa 1 get def |
/setarg 1 def |
/setarg 1 def |
} { } ifelse |
} { } ifelse |
|
typev [ArrayP RingP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/setarg 1 def |
|
} { } ifelse |
typev [ArrayP ArrayP] eq |
typev [ArrayP ArrayP] eq |
{ /f aa 0 get def |
{ /f aa 0 get def |
/v aa 1 get from_records def |
/v aa 1 get from_records def |
|
|
setarg { } { (gb_h : Argument mismatch) error } ifelse |
setarg { } { (gb_h : Argument mismatch) error } ifelse |
|
|
[(KanGBmessage) gb.verbose ] system_variable |
[(KanGBmessage) gb.verbose ] system_variable |
[(Homogenize_vec) 0] system_variable |
|
|
|
%%% Start of the preprocess |
%%% Start of the preprocess |
f getRing /rr set |
v tag RingP eq { |
|
/rr v def |
|
}{ |
|
f getRing /rr set |
|
} ifelse |
%% To the normal form : matrix expression. |
%% To the normal form : matrix expression. |
f gb.toMatrixOfString /f set |
f gb.toMatrixOfString /f set |
/mm gb.itWasMatrix def |
/mm gb.itWasMatrix def |
|
|
} { |
} { |
%% Use the ring structre given by the input. |
%% Use the ring structre given by the input. |
v isInteger not { |
v isInteger not { |
(Warning : the given ring definition is not used.) message |
gb.warning { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
} { } ifelse |
} { } ifelse |
rr ring_def |
rr ring_def |
/wv rr gb.getWeight def |
/wv rr gb.getWeight def |
|
|
} ifelse |
} ifelse |
getOptions /gb_h.opt set |
getOptions /gb_h.opt set |
(grade) (module1v) switch_function |
(grade) (module1v) switch_function |
|
[(Homogenize_vec) 0] system_variable |
%%% End of the preprocess |
%%% End of the preprocess |
|
|
gb.verbose { (gb.options = ) messagen gb.options message } { } ifelse |
gb.verbose { (gb.options = ) messagen gb.options message } { } ifelse |
|
|
}{ } |
}{ } |
ifelse |
ifelse |
gb_h.opt restoreOptions |
gb_h.opt restoreOptions |
|
gb.verbose { (Getting out of gb_h) message } { } ifelse |
%% |
%% |
|
|
/arg1 ans def |
/arg1 ans def |
|
|
$ [(Homogenize_vec) 0] system_variable (grade) (module1v) switch_function$ |
$ [(Homogenize_vec) 0] system_variable (grade) (module1v) switch_function$ |
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f v]; array f; string v; v is the variables. ) |
(a : [f v]; array f; string v; v is the variables. ) |
|
(a : [f r]; array f; ring r ) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
( ) |
( ) |
$Example 1: [ [( (x Dx)^2 + (y Dy)^2 -h^4) ( x y Dx Dy -h^4)] (x,y) $ |
$Example 1: [ [( (x Dx)^2 + (y Dy)^2 -h^4) ( x y Dx Dy -h^4)] (x,y) $ |
|
|
/v aa 1 get def |
/v aa 1 get def |
/setarg 1 def |
/setarg 1 def |
} { } ifelse |
} { } ifelse |
|
typev [ArrayP RingP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/setarg 1 def |
|
} { } ifelse |
typev [ArrayP ArrayP] eq |
typev [ArrayP ArrayP] eq |
{ /f aa 0 get def |
{ /f aa 0 get def |
/v aa 1 get from_records def |
/v aa 1 get from_records def |
|
|
|
|
|
|
%%% Start of the preprocess |
%%% Start of the preprocess |
f getRing /rr set |
v tag RingP eq { |
|
/rr v def |
|
}{ |
|
f getRing /rr set |
|
} ifelse |
%% To the normal form : matrix expression. |
%% To the normal form : matrix expression. |
f gb.toMatrixOfString /f set |
f gb.toMatrixOfString /f set |
/mm gb.itWasMatrix def |
/mm gb.itWasMatrix def |
|
|
}{ |
}{ |
%% Use the ring structre given by the input. |
%% Use the ring structre given by the input. |
v isInteger not { |
v isInteger not { |
(Warning : the given ring definition is not used.) message |
gb.warning { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
} { } ifelse |
} { } ifelse |
rr ring_def |
rr ring_def |
/wv rr gb.getWeight def |
/wv rr gb.getWeight def |
|
|
$ [(Homogenize_vec) 0] system_variable (grade) (module1v) switch_function$ |
$ [(Homogenize_vec) 0] system_variable (grade) (module1v) switch_function$ |
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f v]; array f; string v; v is the variables.) |
(a : [f v]; array f; string v; v is the variables.) |
|
(a : [f r]; array f; ring r ) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
$Example 1: [ [( (x Dx)^2 + (y Dy)^2 -h^4) ( x y Dx Dy -h^4)] (x,y) $ |
$Example 1: [ [( (x Dx)^2 + (y Dy)^2 -h^4) ( x y Dx Dy -h^4)] (x,y) $ |
$ [ [ (Dx) 1 ] ] ] syz_h pmat ; $ |
$ [ [ (Dx) 1 ] ] ] syz_h pmat ; $ |
|
|
%% comparison of hilbert series has not yet been implemented. |
%% comparison of hilbert series has not yet been implemented. |
aa length 3 eq { } |
aa length 3 eq { } |
{ ([ii jj vv] isSameIdeal) error } ifelse |
{ ([ii jj vv] isSameIdeal) error } ifelse |
gb.verbose { (isSameIdeal) message } { } ifelse |
gb.verbose { (Getting in isSameIdeal) message } { } ifelse |
/ii aa 0 get def |
/ii aa 0 get def |
/jj aa 1 get def |
/jj aa 1 get def |
/vv aa 2 get def |
/vv aa 2 get def |
|
|
|
|
/isSameIdeal_h { |
/isSameIdeal_h { |
/arg1 set |
/arg1 set |
[/in-isSameIdeal_h /aa /ii /jj /iigg /jjgg /vv /ans /k /n /f] pushVariables |
[/in-isSameIdeal_h /aa /ii /jj /iigg /jjgg /vv /ans /k /n /f |
[(CurrentRingp)] pushEnv |
/isSameIdeal_h.opt |
|
] pushVariables |
|
[(CurrentRingp) (Homogenize_vec)] pushEnv |
[ |
[ |
/aa arg1 def |
/aa arg1 def |
|
gb.verbose { (Getting in isSameIdeal_h) message } { } ifelse |
%% comparison of hilbert series has not yet been implemented. |
%% comparison of hilbert series has not yet been implemented. |
aa length 3 eq { } |
aa length 3 eq { } |
{ ([ii jj vv] isSameIdeal_h) error } ifelse |
{ ([ii jj vv] isSameIdeal_h) error } ifelse |
gb.verbose { (isSameIdeal_h) message } { } ifelse |
|
/ii aa 0 get def |
/ii aa 0 get def |
/jj aa 1 get def |
/jj aa 1 get def |
/vv aa 2 get def |
/vv aa 2 get def |
|
|
|
|
iigg getRing ring_def |
iigg getRing ring_def |
|
|
|
getOptions /isSameIdeal_h.opt set |
|
(grade) (module1v) switch_function |
|
[(Homogenize_vec) 0] system_variable |
/ans 1 def |
/ans 1 def |
iigg 0 get { [ (toe_) 3 -1 roll ] gbext } map |
iigg 0 get { [ (toe_) 3 -1 roll ] gbext } map |
/iigg set |
/iigg set |
jjgg 0 get { [ (toe_) 3 -1 roll ] gbext } map |
jjgg 0 get { [ (toe_) 3 -1 roll ] gbext } map |
/jjgg set |
/jjgg set |
|
|
|
gb.verbose { (Comparing) message iigg message (and) message jjgg message } |
|
{ } ifelse |
gb.verbose { ( ii < jj ?) messagen } { } ifelse |
gb.verbose { ( ii < jj ?) messagen } { } ifelse |
iigg length /n set |
iigg length /n set |
0 1 n 1 sub { |
0 1 n 1 sub { |
|
|
} for |
} for |
/LLL.isSame_h |
/LLL.isSame_h |
gb.verbose { ( Done) message } { } ifelse |
gb.verbose { ( Done) message } { } ifelse |
|
isSameIdeal_h.opt restoreOptions |
/arg1 ans def |
/arg1 ans def |
] pop |
] pop |
popEnv |
popEnv |
|
|
$ [[(x Dx -h^2) (0)] [(Dx^2) (1)] [(Dx^3) (Dx)]] (x,y)] isSameIdeal_h $ |
$ [[(x Dx -h^2) (0)] [(Dx^2) (1)] [(Dx^3) (Dx)]] (x,y)] isSameIdeal_h $ |
]] putUsages |
]] putUsages |
|
|
|
/gb.reduction { |
|
/arg2 set |
|
/arg1 set |
|
[/in-gb.reduction /gbasis /flist /ans /gbasis2 |
|
] pushVariables |
|
[(CurrentRingp) (KanGBmessage)] pushEnv |
|
[ |
|
/gbasis arg2 def |
|
/flist arg1 def |
|
gbasis 0 get tag 6 eq { } |
|
{ (gb.reduction: the second argument must be a list of lists) error } |
|
ifelse |
|
|
|
gbasis length 1 eq { |
|
gbasis getRing ring_def |
|
/gbasis2 gbasis 0 get def |
|
} { |
|
[ [(1)] ] gbasis rest join gb 0 get getRing ring_def |
|
/gbasis2 gbasis 0 get ,,, def |
|
} ifelse |
|
|
|
|
|
flist ,,, /flist set |
|
flist tag 6 eq { |
|
flist { gbasis2 reduction } map /ans set |
|
}{ |
|
flist gbasis2 reduction /ans set |
|
} ifelse |
|
/arg1 ans def |
|
|
|
] pop |
|
popEnv |
|
popVariables |
|
arg1 |
|
} def |
|
|
|
/gb.reduction.test { |
|
[ |
|
[( 2*(1-x-y) Dx + 1 ) ( 2*(1-x-y) Dy + 1 )] |
|
(x,y) [[(Dx) 1 (Dy) 1] [(x) -1 (y) -1 (Dx) 1 (Dy) 1]]] |
|
gb /gg set |
|
|
|
((h-x-y)*Dx) [gg 0 get] gb.reduction /gg2 set |
|
gg2 message |
|
(-----------------------------) message |
|
|
|
[[( 2*(h-x-y) Dx + h^2 ) ( 2*(h-x-y) Dy + h^2 )] |
|
(x,y) [[(Dx) 1 (Dy) 1] [(x) -1 (y) -1 (Dx) 1 (Dy) 1]]] /ggg set |
|
((h-x-y)*Dx) ggg gb.reduction /gg4 set |
|
gg4 message |
|
(-----------------------------) message |
|
[gg2 gg4] |
|
} def |
|
[(gb.reduction) |
|
[ (f basis gb.reduction r) |
|
(f is reduced by basis by the normal form algorithm.) |
|
(The first element of basis <g_1,...,g_m> must be a Grobner basis.) |
|
(r is the return value format of reduction;) |
|
(r=[h,c0,syz,input], h = c0 f + \sum syz_i g_i) |
|
(basis is given in the argument format of gb.) |
|
$h[1,1](D)-homogenization is used.$ |
|
(cf. reduction, gb, ecartd.gb, gb.reduction.test ) |
|
$Example:$ |
|
$ [[( 2*(h-x-y) Dx + h^2 ) ( 2*(h-x-y) Dy + h^2 )] $ |
|
$ (x,y) [[(Dx) 1 (Dy) 1] [(x) -1 (y) -1 (Dx) 1 (Dy) 1]]] /ggg set $ |
|
$ ((h-x-y)^2*Dx*Dy) ggg gb.reduction :: $ |
|
]] putUsages |
|
|
( ) message-quiet ; |
( ) message-quiet ; |
|
|