Annotation of OpenXM/src/asir-doc/parts/groebner.texi, Revision 1.7
1.7 ! noro 1: @comment $OpenXM: OpenXM/src/asir-doc/parts/groebner.texi,v 1.6 2003/04/20 09:55:18 noro Exp $
1.2 noro 2: \BJP
1.1 noro 3: @node $B%0%l%V%J4pDl$N7W;;(B,,, Top
4: @chapter $B%0%l%V%J4pDl$N7W;;(B
1.2 noro 5: \E
6: \BEG
7: @node Groebner basis computation,,, Top
8: @chapter Groebner basis computation
9: \E
1.1 noro 10:
11: @menu
1.2 noro 12: \BJP
1.1 noro 13: * $BJ,;6I=8=B?9`<0(B::
14: * $B%U%!%$%k$NFI$_9~$_(B::
15: * $B4pK\E*$JH!?t(B::
16: * $B7W;;$*$h$SI=<($N@)8f(B::
17: * $B9`=g=x$N@_Dj(B::
18: * $BM-M}<0$r78?t$H$9$k%0%l%V%J4pDl7W;;(B::
19: * $B4pDlJQ49(B::
1.5 noro 20: * Weyl $BBe?t(B::
1.1 noro 21: * $B%0%l%V%J4pDl$K4X$9$kH!?t(B::
1.2 noro 22: \E
23: \BEG
24: * Distributed polynomial::
25: * Reading files::
26: * Fundamental functions::
27: * Controlling Groebner basis computations::
28: * Setting term orderings::
29: * Groebner basis computation with rational function coefficients::
30: * Change of ordering::
1.5 noro 31: * Weyl algebra::
1.2 noro 32: * Functions for Groebner basis computation::
33: \E
1.1 noro 34: @end menu
35:
1.2 noro 36: \BJP
1.1 noro 37: @node $BJ,;6I=8=B?9`<0(B,,, $B%0%l%V%J4pDl$N7W;;(B
38: @section $BJ,;6I=8=B?9`<0(B
1.2 noro 39: \E
40: \BEG
41: @node Distributed polynomial,,, Groebner basis computation
42: @section Distributed polynomial
43: \E
1.1 noro 44:
45: @noindent
1.2 noro 46: \BJP
1.1 noro 47: $BJ,;6I=8=B?9`<0$H$O(B, $BB?9`<0$NFbIt7A<0$N0l$D$G$"$k(B. $BDL>o$NB?9`<0(B
48: (@code{type} $B$,(B 2) $B$O(B, $B:F5"I=8=$H8F$P$l$k7A<0$GI=8=$5$l$F$$$k(B. $B$9$J$o(B
49: $B$A(B, $BFCDj$NJQ?t$r<gJQ?t$H$9$k(B 1 $BJQ?tB?9`<0$G(B, $B$=$NB>$NJQ?t$O(B, $B$=$N(B 1 $BJQ(B
50: $B?tB?9`<0$N78?t$K(B, $B<gJQ?t$r4^$^$J$$B?9`<0$H$7$F8=$l$k(B. $B$3$N78?t$,(B, $B$^$?(B,
51: $B$"$kJQ?t$r<gJQ?t$H$9$kB?9`<0$H$J$C$F$$$k$3$H$+$i:F5"I=8=$H8F$P$l$k(B.
1.2 noro 52: \E
53: \BEG
54: A distributed polynomial is a polynomial with a special internal
55: representation different from the ordinary one.
56:
57: An ordinary polynomial (having @code{type} 2) is internally represented
58: in a format, called recursive representation.
59: In fact, it is represented as an uni-variate polynomial with respect to
60: a fixed variable, called main variable of that polynomial,
61: where the other variables appear in the coefficients which may again
62: polynomials in such variables other than the previous main variable.
63: A polynomial in the coefficients is again represented as
64: an uni-variate polynomial in a certain fixed variable,
65: the main variable. Thus, by this recursive structure of polynomial
66: representation, it is called the `recursive representation.'
67: \E
1.1 noro 68:
69: @iftex
70: @tex
1.2 noro 71: \JP $(x+y+z)^2 = 1 \cdot x^2 + (2 \cdot y + (2 \cdot z)) \cdot x + ((2 \cdot z) \cdot y + (1 \cdot z^2 ))$
72: \EG $(x+y+z)^2 = 1 \cdot x^2 + (2 \cdot y + (2 \cdot z)) \cdot x + ((2 \cdot z) \cdot y + (1 \cdot z^2 ))$
1.1 noro 73: @end tex
74: @end iftex
75: @ifinfo
76: @example
77: (x+y+z)^2 = 1 x^2 + (2 y + (2 z)) x + ((2 z) y + (1 z^2 ))
78: @end example
79: @end ifinfo
80:
81: @noindent
1.2 noro 82: \BJP
1.1 noro 83: $B$3$l$KBP$7(B, $BB?9`<0$r(B, $BJQ?t$NQQ@Q$H78?t$N@Q$NOB$H$7$FI=8=$7$?$b$N$rJ,;6(B
84: $BI=8=$H8F$V(B.
1.2 noro 85: \E
86: \BEG
87: On the other hand,
88: we call a representation the distributed representation of a polynomial,
89: if a polynomial is represented, according to its original meaning,
90: as a sum of monomials,
91: where a monomial is the product of power product of variables
92: and a coefficient. We call a polynomial, represented in such an
93: internal format, a distributed polynomial. (This naming may sounds
94: something strange.)
95: \E
1.1 noro 96:
97: @iftex
98: @tex
1.2 noro 99: \JP $(x+y+z)^2 = 1 \cdot x^2 + 2 \cdot xy + 2 \cdot xz + 1 \cdot y^2 + 2 \cdot yz +1 \cdot z^2$
100: \EG $(x+y+z)^2 = 1 \cdot x^2 + 2 \cdot xy + 2 \cdot xz + 1 \cdot y^2 + 2 \cdot yz +1 \cdot z^2$
1.1 noro 101: @end tex
102: @end iftex
103: @ifinfo
104: @example
105: (x+y+z)^2 = 1 x^2 + 2 xy + 2 xz + 1 y^2 + 2 yz +1 z^2$
106: @end example
107: @end ifinfo
108:
109: @noindent
1.2 noro 110: \BJP
1.1 noro 111: $B%0%l%V%J4pDl7W;;$K$*$$$F$O(B, $BC19`<0$KCmL\$7$FA`:n$r9T$&$?$aB?9`<0$,J,;6I=8=(B
112: $B$5$l$F$$$kJ}$,$h$j8zN($N$h$$1i;;$,2DG=$K$J$k(B. $B$3$N$?$a(B, $BJ,;6I=8=B?9`<0$,(B,
113: $B<1JL;R(B 9 $B$N7?$H$7$F(B @b{Asir} $B$N%H%C%W%l%Y%k$+$iMxMQ2DG=$H$J$C$F$$$k(B.
114: $B$3$3$G(B, $B8e$N@bL@$N$?$a$K(B, $B$$$/$D$+$N8@MU$rDj5A$7$F$*$/(B.
1.2 noro 115: \E
116: \BEG
117: For computation of Groebner basis, efficient operation is expected if
118: polynomials are represented in a distributed representation,
119: because major operations for Groebner basis are performed with respect
120: to monomials.
121: From this view point, we provide the object type distributed polynomial
122: with its object identification number 9, and objects having such a type
123: are available by @b{Asir} language.
124:
125: Here, we provide several definitions for the later description.
126: \E
1.1 noro 127:
128: @table @b
1.2 noro 129: \BJP
1.1 noro 130: @item $B9`(B (term)
131: $BJQ?t$NQQ@Q(B. $B$9$J$o$A(B, $B78?t(B 1 $B$NC19`<0$N$3$H(B. @b{Asir} $B$K$*$$$F$O(B,
1.2 noro 132: \E
133: \BEG
134: @item term
135: The power product of variables, i.e., a monomial with coefficient 1.
136: In an @b{Asir} session, it is displayed in the form like
137: \E
1.1 noro 138:
139: @example
140: <<0,1,2,3,4>>
141: @end example
142:
1.2 noro 143: \BJP
1.1 noro 144: $B$H$$$&7A$GI=<($5$l(B, $B$^$?(B, $B$3$N7A$GF~NO2DG=$G$"$k(B. $B$3$NNc$O(B, 5 $BJQ?t$N9`(B
145: $B$r<($9(B. $B3FJQ?t$r(B @code{a}, @code{b}, @code{c}, @code{d}, @code{e} $B$H$9$k$H(B
146: $B$3$N9`$O(B @code{b*c^2*d^3*e^4} $B$rI=$9(B.
1.2 noro 147: \E
148: \BEG
149: and also can be input in such a form.
150: This example shows a term in 5 variables. If we assume the 5 variables
151: as @code{a}, @code{b}, @code{c}, @code{d}, and @code{e},
152: the term represents @code{b*c^2*d^3*e^4} in the ordinary expression.
153: \E
1.1 noro 154:
1.2 noro 155: \BJP
1.1 noro 156: @item $B9`=g=x(B (term order)
157: $BJ,;6I=8=B?9`<0$K$*$1$k9`$O(B, $B<!$N@-<A$rK~$?$9A4=g=x$K$h$j@0Ns$5$l$k(B.
1.2 noro 158: \E
159: \BEG
160: @item term order
161: Terms are ordered according to a total order with the following properties.
162: \E
1.1 noro 163:
164: @enumerate
165: @item
1.2 noro 166: \JP $BG$0U$N9`(B @code{t} $B$KBP$7(B @code{t} > 1
167: \EG For all @code{t} @code{t} > 1.
1.1 noro 168:
169: @item
1.2 noro 170: \JP @code{t}, @code{s}, @code{u} $B$r9`$H$9$k;~(B, @code{t} > @code{s} $B$J$i$P(B @code{tu} > @code{su}
171: \EG For all @code{t}, @code{s}, @code{u} @code{t} > @code{s} implies @code{tu} > @code{su}.
1.1 noro 172: @end enumerate
173:
1.2 noro 174: \BJP
1.1 noro 175: $B$3$N@-<A$rK~$?$9A4=g=x$r9`=g=x$H8F$V(B. $B$3$N=g=x$OJQ?t=g=x(B ($BJQ?t$N%j%9%H(B)
176: $B$H9`=g=x7?(B ($B?t(B, $B%j%9%H$^$?$O9TNs(B) $B$K$h$j;XDj$5$l$k(B.
1.2 noro 177: \E
178: \BEG
179: Such a total order is called a term ordering. A term ordering is specified
180: by a variable ordering (a list of variables) and a type of term ordering
181: (an integer, a list or a matrix).
182: \E
1.1 noro 183:
1.2 noro 184: \BJP
1.1 noro 185: @item $BC19`<0(B (monomial)
186: $B9`$H78?t$N@Q(B.
1.2 noro 187: \E
188: \BEG
189: @item monomial
190: The product of a term and a coefficient.
191: In an @b{Asir} session, it is displayed in the form like
192: \E
1.1 noro 193:
194: @example
195: 2*<<0,1,2,3,4>>
196: @end example
197:
1.2 noro 198: \JP $B$H$$$&7A$GI=<($5$l(B, $B$^$?(B, $B$3$N7A$GF~NO2DG=$G$"$k(B.
199: \EG and also can be input in such a form.
1.1 noro 200:
1.2 noro 201: \BJP
1.1 noro 202: @itemx $BF,C19`<0(B (head monomial)
203: @item $BF,9`(B (head term)
204: @itemx $BF,78?t(B (head coefficient)
205: $BJ,;6I=8=B?9`<0$K$*$1$k3FC19`<0$O(B, $B9`=g=x$K$h$j@0Ns$5$l$k(B. $B$3$N;~=g(B
206: $B=x:GBg$NC19`<0$rF,C19`<0(B, $B$=$l$K8=$l$k9`(B, $B78?t$r$=$l$>$lF,9`(B, $BF,78?t(B
207: $B$H8F$V(B.
1.2 noro 208: \E
209: \BEG
210: @itemx head monomial
211: @item head term
212: @itemx head coefficient
213:
214: Monomials in a distributed polynomial is sorted by a total order.
215: In such representation, we call the monomial that is maximum
216: with respect to the order the head monomial, and its term and coefficient
217: the head term and the head coefficient respectively.
218: \E
1.1 noro 219: @end table
220:
1.2 noro 221: \BJP
1.1 noro 222: @node $B%U%!%$%k$NFI$_9~$_(B,,, $B%0%l%V%J4pDl$N7W;;(B
223: @section $B%U%!%$%k$NFI$_9~$_(B
1.2 noro 224: \E
225: \BEG
226: @node Reading files,,, Groebner basis computation
227: @section Reading files
228: \E
1.1 noro 229:
230: @noindent
1.2 noro 231: \BJP
1.1 noro 232: $B%0%l%V%J4pDl$r7W;;$9$k$?$a$N4pK\E*$JH!?t$O(B @code{dp_gr_main()} $B$*$h$S(B
1.5 noro 233: @code{dp_gr_mod_main()}, @code{dp_gr_f_main()}
234: $B$J$k(B 3 $B$D$NAH$_9~$_H!?t$G$"$k$,(B, $BDL>o$O(B, $B%Q%i%a%?(B
1.1 noro 235: $B@_Dj$J$I$r9T$C$?$N$A$3$l$i$r8F$S=P$9%f!<%6H!?t$rMQ$$$k$N$,JXMx$G$"$k(B.
236: $B$3$l$i$N%f!<%6H!?t$O(B, $B%U%!%$%k(B @samp{gr} $B$r(B @code{load()} $B$K$h$jFI(B
237: $B$_9~$`$3$H$K$h$j;HMQ2DG=$H$J$k(B. @samp{gr} $B$O(B, @b{Asir} $B$NI8=`(B
1.5 noro 238: $B%i%$%V%i%j%G%#%l%/%H%j$KCV$+$l$F$$$k(B.
1.2 noro 239: \E
240: \BEG
1.5 noro 241: Facilities for computing Groebner bases are
242: @code{dp_gr_main()}, @code{dp_gr_mod_main()}and @code{dp_gr_f_main()}.
243: To call these functions,
244: it is necessary to set several parameters correctly and it is convenient
245: to use a set of interface functions provided in the library file
246: @samp{gr}.
1.2 noro 247: The facilities will be ready to use after you load the package by
248: @code{load()}. The package @samp{gr} is placed in the standard library
1.5 noro 249: directory of @b{Asir}.
1.2 noro 250: \E
1.1 noro 251:
252: @example
253: [0] load("gr")$
254: @end example
255:
1.2 noro 256: \BJP
1.1 noro 257: @node $B4pK\E*$JH!?t(B,,, $B%0%l%V%J4pDl$N7W;;(B
258: @section $B4pK\E*$JH!?t(B
1.2 noro 259: \E
260: \BEG
261: @node Fundamental functions,,, Groebner basis computation
262: @section Fundamental functions
263: \E
1.1 noro 264:
265: @noindent
1.2 noro 266: \BJP
1.1 noro 267: @samp{gr} $B$G$O?tB?$/$NH!?t$,Dj5A$5$l$F$$$k$,(B, $BD>@\(B
268: $B%0%l%V%J4pDl$r7W;;$9$k$?$a$N%H%C%W%l%Y%k$O<!$N(B 3 $B$D$G$"$k(B.
269: $B0J2<$G(B, @var{plist} $B$OB?9`<0$N%j%9%H(B, @var{vlist} $B$OJQ?t(B ($BITDj85(B) $B$N%j%9%H(B,
270: @var{order} $B$OJQ?t=g=x7?(B, @var{p} $B$O(B @code{2^27} $BL$K~$NAG?t$G$"$k(B.
1.2 noro 271: \E
272: \BEG
273: There are many functions and options defined in the package @samp{gr}.
274: Usually not so many of them are used. Top level functions for Groebner
275: basis computation are the following three functions.
276:
277: In the following description, @var{plist}, @var{vlist}, @var{order}
278: and @var{p} stand for a list of polynomials, a list of variables
279: (indeterminates), a type of term ordering and a prime less than
280: @code{2^27} respectively.
281: \E
1.1 noro 282:
283: @table @code
284: @item gr(@var{plist},@var{vlist},@var{order})
285:
1.2 noro 286: \BJP
1.1 noro 287: Gebauer-Moeller $B$K$h$k(B useless pair elimination criteria, sugar
288: strategy $B$*$h$S(B Traverso $B$K$h$k(B trace-lifting $B$rMQ$$$?(B Buchberger $B%"%k(B
289: $B%4%j%:%`$K$h$kM-M}?t78?t%0%l%V%J4pDl7W;;H!?t(B. $B0lHL$K$O$3$NH!?t$rMQ$$$k(B.
1.2 noro 290: \E
291: \BEG
292: Function that computes Groebner bases over the rationals. The
293: algorithm is Buchberger algorithm with useless pair elimination
294: criteria by Gebauer-Moeller, sugar strategy and trace-lifting by
295: Traverso. For ordinary computation, this function is used.
296: \E
1.1 noro 297:
298: @item hgr(@var{plist},@var{vlist},@var{order})
299:
1.2 noro 300: \BJP
1.1 noro 301: $BF~NOB?9`<0$r@F<!2=$7$?8e(B @code{gr()} $B$N%0%l%V%J4pDl8uJd@8@.It$K$h$j8u(B
302: $BJd@8@.$7(B, $BHs@F<!2=(B, interreduce $B$7$?$b$N$r(B @code{gr()} $B$N%0%l%V%J4pDl(B
303: $B%A%'%C%/It$G%A%'%C%/$9$k(B. 0 $B<!85%7%9%F%`(B ($B2r$N8D?t$,M-8B8D$NJ}Dx<07O(B)
304: $B$N>l9g(B, sugar strategy $B$,78?tKDD%$r0z$-5/$3$9>l9g$,$"$k(B. $B$3$N$h$&$J>l(B
305: $B9g(B, strategy $B$r@F<!2=$K$h$k(B strategy $B$KCV$-49$($k$3$H$K$h$j78?tKDD%$r(B
306: $BM^@)$9$k$3$H$,$G$-$k>l9g$,B?$$(B.
1.2 noro 307: \E
308: \BEG
309: After homogenizing the input polynomials a candidate of the \gr basis
310: is computed by trace-lifting. Then the candidate is dehomogenized and
311: checked whether it is indeed a Groebner basis of the input. Sugar
312: strategy often causes intermediate coefficient swells. It is
313: empirically known that the combination of homogenization and supresses
314: the swells for such cases.
315: \E
1.1 noro 316:
317: @item gr_mod(@var{plist},@var{vlist},@var{order},@var{p})
318:
1.2 noro 319: \BJP
1.1 noro 320: Gebauer-Moeller $B$K$h$k(B useless pair elimination criteria, sugar
321: strategy $B$*$h$S(B Buchberger $B%"%k%4%j%:%`$K$h$k(B GF(p) $B78?t%0%l%V%J4pDl7W(B
322: $B;;H!?t(B.
1.2 noro 323: \E
324: \BEG
325: Function that computes Groebner bases over GF(@var{p}). The same
326: algorithm as @code{gr()} is used.
327: \E
1.1 noro 328:
329: @end table
330:
1.2 noro 331: \BJP
1.1 noro 332: @node $B7W;;$*$h$SI=<($N@)8f(B,,, $B%0%l%V%J4pDl$N7W;;(B
333: @section $B7W;;$*$h$SI=<($N@)8f(B
1.2 noro 334: \E
335: \BEG
336: @node Controlling Groebner basis computations,,, Groebner basis computation
337: @section Controlling Groebner basis computations
338: \E
1.1 noro 339:
340: @noindent
1.2 noro 341: \BJP
1.1 noro 342: $B%0%l%V%J4pDl$N7W;;$K$*$$$F(B, $B$5$^$6$^$J%Q%i%a%?@_Dj$r9T$&$3$H$K$h$j7W;;(B,
343: $BI=<($r@)8f$9$k$3$H$,$G$-$k(B. $B$3$l$i$O(B, $BAH$_9~$_H!?t(B @code{dp_gr_flags()}
344: $B$K$h$j@_Dj;2>H$9$k$3$H$,$G$-$k(B. $BL50z?t$G(B @code{dp_gr_flags()} $B$r<B9T$9$k(B
345: $B$H(B, $B8=:_@_Dj$5$l$F$$$k%Q%i%a%?$,(B, $BL>A0$HCM$N%j%9%H$GJV$5$l$k(B.
1.2 noro 346: \E
347: \BEG
348: One can cotrol a Groebner basis computation by setting various parameters.
349: These parameters can be set and examined by a built-in function
350: @code{dp_gr_flags()}. Without argument it returns the current settings.
351: \E
1.1 noro 352:
353: @example
354: [100] dp_gr_flags();
1.5 noro 355: [Demand,0,NoSugar,0,NoCriB,0,NoGC,0,NoMC,0,NoRA,0,NoGCD,0,Top,0,
356: ShowMag,1,Print,1,Stat,0,Reverse,0,InterReduce,0,Multiple,0]
1.1 noro 357: [101]
358: @end example
359:
1.2 noro 360: \BJP
1.1 noro 361: $B0J2<$G(B, $B3F%Q%i%a%?$N0UL#$r@bL@$9$k(B. on $B$N>l9g$H$O(B, $B%Q%i%a%?$,(B 0 $B$G$J$$>l9g$r(B
362: $B$$$&(B. $B$3$l$i$N%Q%i%a%?$N=i4|CM$OA4$F(B 0 (off) $B$G$"$k(B.
1.2 noro 363: \E
364: \BEG
365: The return value is a list which contains the names of parameters and their
366: values. The meaning of the parameters are as follows. `on' means that the
367: parameter is not zero.
368: \E
1.1 noro 369:
370: @table @code
371: @item NoSugar
1.2 noro 372: \BJP
1.1 noro 373: on $B$N>l9g(B, sugar strategy $B$NBe$o$j$K(B Buchberger$B$N(B normal strategy $B$,MQ(B
374: $B$$$i$l$k(B.
1.2 noro 375: \E
376: \BEG
377: If `on', Buchberger's normal strategy is used instead of sugar strategy.
378: \E
1.1 noro 379:
380: @item NoCriB
1.2 noro 381: \JP on $B$N>l9g(B, $BITI,MWBP8!=P5,=`$N$&$A(B, $B5,=`(B B $B$rE,MQ$7$J$$(B.
382: \EG If `on', criterion B among the Gebauer-Moeller's criteria is not applied.
1.1 noro 383:
384: @item NoGC
1.2 noro 385: \JP on $B$N>l9g(B, $B7k2L$,%0%l%V%J4pDl$K$J$C$F$$$k$+$I$&$+$N%A%'%C%/$r9T$o$J$$(B.
386: \BEG
387: If `on', the check that a Groebner basis candidate is indeed a Groebner basis,
388: is not executed.
389: \E
1.1 noro 390:
391: @item NoMC
1.2 noro 392: \BJP
1.1 noro 393: on $B$N>l9g(B, $B7k2L$,F~NO%$%G%"%k$HF1Ey$N%$%G%"%k$G$"$k$+$I$&$+$N%A%'%C%/(B
394: $B$r9T$o$J$$(B.
1.2 noro 395: \E
396: \BEG
397: If `on', the check that the resulting polynomials generates the same ideal as
398: the ideal generated by the input, is not executed.
399: \E
1.1 noro 400:
401: @item NoRA
1.2 noro 402: \BJP
1.1 noro 403: on $B$N>l9g(B, $B7k2L$r(B reduced $B%0%l%V%J4pDl$K$9$k$?$a$N(B
404: interreduce $B$r9T$o$J$$(B.
1.2 noro 405: \E
406: \BEG
407: If `on', the interreduction, which makes the Groebner basis reduced, is not
408: executed.
409: \E
1.1 noro 410:
411: @item NoGCD
1.2 noro 412: \BJP
1.1 noro 413: on $B$N>l9g(B, $BM-M}<078?t$N%0%l%V%J4pDl7W;;$K$*$$$F(B, $B@8@.$5$l$?B?9`<0$N(B,
414: $B78?t$N(B content $B$r$H$i$J$$(B.
1.2 noro 415: \E
416: \BEG
417: If `on', content removals are not executed during a Groebner basis computation
418: over a rational function field.
419: \E
1.1 noro 420:
421: @item Top
1.2 noro 422: \JP on $B$N>l9g(B, normal form $B7W;;$K$*$$$FF,9`>C5n$N$_$r9T$&(B.
423: \EG If `on', Only the head term of the polynomial being reduced is reduced.
1.1 noro 424:
1.2 noro 425: @comment @item Interreduce
426: @comment \BJP
427: @comment on $B$N>l9g(B, $BB?9`<0$r@8@.$9$kKh$K(B, $B$=$l$^$G@8@.$5$l$?4pDl$r$=$NB?9`<0$K(B
428: @comment $B$h$k(B normal form $B$GCV$-49$($k(B.
429: @comment \E
430: @comment \BEG
431: @comment If `on', intermediate basis elements are reduced by using a newly generated
432: @comment basis element.
433: @comment \E
1.1 noro 434:
435: @item Reverse
1.2 noro 436: \BJP
1.1 noro 437: on $B$N>l9g(B, normal form $B7W;;$N:]$N(B reducer $B$r(B, $B?7$7$/@8@.$5$l$?$b$N$rM%(B
438: $B@h$7$FA*$V(B.
1.2 noro 439: \E
440: \BEG
441: If `on', the selection strategy of reducer in a normal form computation
442: is such that a newer reducer is used first.
443: \E
1.1 noro 444:
445: @item Print
1.2 noro 446: \JP on $B$N>l9g(B, $B%0%l%V%J4pDl7W;;$NESCf$K$*$1$k$5$^$6$^$J>pJs$rI=<($9$k(B.
447: \BEG
448: If `on', various informations during a Groebner basis computation is
449: displayed.
450: \E
1.1 noro 451:
1.7 ! noro 452: @item PrintShort
! 453: \JP on $B$G!"(BPrint $B$,(B off $B$N>l9g(B, $B%0%l%V%J4pDl7W;;$NESCf$N>pJs$rC;=L7A$GI=<($9$k(B.
! 454: \BEG
! 455: If `on' and Print is `off', short information during a Groebner basis computation is
! 456: displayed.
! 457: \E
! 458:
1.1 noro 459: @item Stat
1.2 noro 460: \BJP
1.1 noro 461: on $B$G(B @code{Print} $B$,(B off $B$J$i$P(B, @code{Print} $B$,(B on $B$N$H$-I=<($5(B
462: $B$l$k%G!<%?$NFb(B, $B=87W%G!<%?$N$_$,I=<($5$l$k(B.
1.2 noro 463: \E
464: \BEG
465: If `on', a summary of informations is shown after a Groebner basis
466: computation. Note that the summary is always shown if @code{Print} is `on'.
467: \E
1.1 noro 468:
469: @item ShowMag
1.2 noro 470: \BJP
1.1 noro 471: on $B$G(B @code{Print} $B$,(B on $B$J$i$P(B, $B@8@.$,@8@.$5$l$kKh$K(B, $B$=$NB?9`<0$N(B
472: $B78?t$N%S%C%HD9$NOB$rI=<($7(B, $B:G8e$K(B, $B$=$l$i$NOB$N:GBgCM$rI=<($9$k(B.
1.2 noro 473: \E
474: \BEG
475: If `on' and @code{Print} is `on', the sum of bit length of
476: coefficients of a generated basis element, which we call @var{magnitude},
477: is shown after every normal computation. After comleting the
478: computation the maximal value among the sums is shown.
479: \E
1.1 noro 480:
1.7 ! noro 481: @item Content
! 482: @itemx Multiple
1.2 noro 483: \BJP
1.7 ! noro 484: 0 $B$G$J$$M-M}?t$N;~(B, $BM-M}?t>e$N@55,7A7W;;$K$*$$$F(B, $B78?t$N%S%C%HD9$NOB$,(B
! 485: @code{Content} $BG\$K$J$k$4$H$K78?tA4BN$N(B GCD $B$,7W;;$5$l(B, $B$=$N(B GCD $B$G(B
! 486: $B3d$C$?B?9`<0$r4JLs$9$k(B. @code{Content} $B$,(B 1 $B$J$i$P(B, $B4JLs$9$k$4$H$K(B
! 487: GCD $B7W;;$,9T$o$l0lHL$K$O8zN($,0-$/$J$k$,(B, @code{Content} $B$r(B 2 $BDxEY(B
1.1 noro 488: $B$H$9$k$H(B, $B5pBg$J@0?t$,78?t$K8=$l$k>l9g(B, $B8zN($,NI$/$J$k>l9g$,$"$k(B.
1.7 ! noro 489: backward compatibility $B$N$?$a!"(B@code{Multiple} $B$G@0?tCM$r;XDj$G$-$k(B.
1.2 noro 490: \E
491: \BEG
1.7 ! noro 492: If a non-zero rational number, in a normal form computation
1.2 noro 493: over the rationals, the integer content of the polynomial being
1.7 ! noro 494: reduced is removed when its magnitude becomes @code{Content} times
1.2 noro 495: larger than a registered value, which is set to the magnitude of the
496: input polynomial. After each content removal the registered value is
1.7 ! noro 497: set to the magnitude of the resulting polynomial. @code{Content} is
1.2 noro 498: equal to 1, the simiplification is done after every normal form computation.
1.7 ! noro 499: It is empirically known that it is often efficient to set @code{Content} to 2
1.2 noro 500: for the case where large integers appear during the computation.
1.7 ! noro 501: An integer value can be set by the keyword @code{Multiple} for
! 502: backward compatibility.
1.2 noro 503: \E
1.1 noro 504:
505: @item Demand
1.2 noro 506:
507: \BJP
1.1 noro 508: $B@5Ev$J%G%#%l%/%H%jL>(B ($BJ8;zNs(B) $B$rCM$K;}$D$H$-(B, $B@8@.$5$l$?B?9`<0$O%a%b%j(B
509: $BCf$K$*$+$l$:(B, $B$=$N%G%#%l%/%H%jCf$K%P%$%J%j%G!<%?$H$7$FCV$+$l(B, $B$=$NB?9`(B
510: $B<0$rMQ$$$k(B normal form $B7W;;$N:](B, $B<+F0E*$K%a%b%jCf$K%m!<%I$5$l$k(B. $B3FB?(B
511: $B9`<0$O(B, $BFbIt$G$N%$%s%G%C%/%9$r%U%!%$%kL>$K;}$D%U%!%$%k$K3JG<$5$l$k(B.
512: $B$3$3$G;XDj$5$l$?%G%#%l%/%H%j$K=q$+$l$?%U%!%$%k$O<+F0E*$K$O>C5n$5$l$J$$(B
513: $B$?$a(B, $B%f!<%6$,@UG$$r;}$C$F>C5n$9$kI,MW$,$"$k(B.
1.2 noro 514: \E
515: \BEG
516: If the value (a character string) is a valid directory name, then
517: generated basis elements are put in the directory and are loaded on
518: demand during normal form computations. Each elements is saved in the
519: binary form and its name coincides with the index internally used in
520: the computation. These binary files are not removed automatically
521: and one should remove them by hand.
522: \E
1.1 noro 523: @end table
524:
525: @noindent
1.2 noro 526: \JP @code{Print} $B$,(B 0 $B$G$J$$>l9g<!$N$h$&$J%G!<%?$,I=<($5$l$k(B.
527: \EG If @code{Print} is `on', the following informations are shown.
1.1 noro 528:
529: @example
530: [93] gr(cyclic(4),[c0,c1,c2,c3],0)$
531: mod= 99999989, eval = []
532: (0)(0)<<0,2,0,0>>(2,3),nb=2,nab=5,rp=2,sugar=2,mag=4
533: (0)(0)<<0,1,2,0>>(1,2),nb=3,nab=6,rp=2,sugar=3,mag=4
534: (0)(0)<<0,1,1,2>>(0,1),nb=4,nab=7,rp=3,sugar=4,mag=6
535: .
536: (0)(0)<<0,0,3,2>>(5,6),nb=5,nab=8,rp=2,sugar=5,mag=4
537: (0)(0)<<0,1,0,4>>(4,6),nb=6,nab=9,rp=3,sugar=5,mag=4
538: (0)(0)<<0,0,2,4>>(6,8),nb=7,nab=10,rp=4,sugar=6,mag=6
539: ....gb done
540: reduceall
541: .......
542: membercheck
543: (0,0)(0,0)(0,0)(0,0)
544: gbcheck total 8 pairs
545: ........
1.5 noro 546: UP=(0,0)SP=(0,0)SPM=(0,0)NF=(0,0)NFM=(0.010002,0)ZNFM=(0.010002,0)
547: PZ=(0,0)NP=(0,0)MP=(0,0)RA=(0,0)MC=(0,0)GC=(0,0)T=40,B=0 M=8 F=6
548: D=12 ZR=5 NZR=6 Max_mag=6
1.1 noro 549: [94]
550: @end example
551:
552: @noindent
1.2 noro 553: \BJP
1.1 noro 554: $B:G=i$KI=<($5$l$k(B @code{mod}, @code{eval} $B$O(B, trace-lifting $B$GMQ$$$i$l$kK!(B
555: $B$G$"$k(B. @code{mod} $B$OAG?t(B, @code{eval} $B$OM-M}<078?t$N>l9g$KMQ$$$i$l$k(B
556: $B?t$N%j%9%H$G$"$k(B.
1.2 noro 557: \E
558: \BEG
559: In this example @code{mod} and @code{eval} indicate moduli used in
560: trace-lifting. @code{mod} is a prime and @code{eval} is a list of integers
561: used for evaluation when the ground field is a field of rational functions.
562: \E
1.1 noro 563:
564: @noindent
1.2 noro 565: \JP $B7W;;ESCf$GB?9`<0$,@8@.$5$l$kKh$K<!$N7A$N%G!<%?$,I=<($5$l$k(B.
566: \EG The following information is shown after every normal form computation.
1.1 noro 567:
568: @example
569: (TNF)(TCONT)HT(INDEX),nb=NB,nab=NAB,rp=RP,sugar=S,mag=M
570: @end example
571:
572: @noindent
1.2 noro 573: \JP $B$=$l$i$N0UL#$O<!$NDL$j(B.
574: \EG Meaning of each component is as follows.
1.1 noro 575:
576: @table @code
1.2 noro 577: \BJP
1.1 noro 578: @item TNF
1.2 noro 579:
1.1 noro 580: normal form $B7W;;;~4V(B ($BIC(B)
581:
582: @item TCONT
1.2 noro 583:
1.1 noro 584: content $B7W;;;~4V(B ($BIC(B)
585:
586: @item HT
1.2 noro 587:
1.1 noro 588: $B@8@.$5$l$?B?9`<0$NF,9`(B
589:
590: @item INDEX
1.2 noro 591:
1.1 noro 592: S-$BB?9`<0$r9=@.$9$kB?9`<0$N%$%s%G%C%/%9$N%Z%"(B
593:
594: @item NB
1.2 noro 595:
1.1 noro 596: $B8=:_$N(B, $B>iD9@-$r=|$$$?4pDl$N?t(B
597:
598: @item NAB
1.2 noro 599:
1.1 noro 600: $B8=:_$^$G$K@8@.$5$l$?4pDl$N?t(B
601:
602: @item RP
1.2 noro 603:
1.1 noro 604: $B;D$j$N%Z%"$N?t(B
605:
606: @item S
1.2 noro 607:
1.1 noro 608: $B@8@.$5$l$?B?9`<0$N(B sugar $B$NCM(B
609:
610: @item M
1.2 noro 611:
1.1 noro 612: $B@8@.$5$l$?B?9`<0$N78?t$N%S%C%HD9$NOB(B (@code{ShowMag} $B$,(B on $B$N;~$KI=<($5$l$k(B. )
1.2 noro 613: \E
614: \BEG
615: @item TNF
616:
617: CPU time for normal form computation (second)
618:
619: @item TCONT
620:
621: CPU time for content removal(second)
622:
623: @item HT
624:
625: Head term of the generated basis element
626:
627: @item INDEX
628:
629: Pair of indices which corresponds to the reduced S-polynomial
630:
631: @item NB
632:
633: Number of basis elements after removing redundancy
634:
635: @item NAB
636:
637: Number of all the basis elements
638:
639: @item RP
640:
641: Number of remaining pairs
642:
643: @item S
644:
645: Sugar of the generated basis element
646:
647: @item M
648:
649: Magnitude of the genrated basis element (shown if @code{ShowMag} is `on'.)
650: \E
1.1 noro 651: @end table
652:
653: @noindent
1.2 noro 654: \BJP
1.1 noro 655: $B:G8e$K(B, $B=87W%G!<%?$,I=<($5$l$k(B. $B0UL#$O<!$NDL$j(B.
656: ($B;~4V$NI=<($K$*$$$F(B, $B?t;z$,(B 2 $B$D$"$k$b$N$O(B, $B7W;;;~4V$H(B GC $B;~4V$N%Z%"$G$"$k(B.)
1.2 noro 657: \E
658: \BEG
659: The summary of the informations shown after a Groebner basis
660: computation is as follows. If a component shows timings and it
661: contains two numbers, they are a pair of time for computation and time
662: for garbage colection.
663: \E
1.1 noro 664:
665: @table @code
1.2 noro 666: \BJP
1.1 noro 667: @item UP
1.2 noro 668:
1.1 noro 669: $B%Z%"$N%j%9%H$NA`:n$K$+$+$C$?;~4V(B
670:
671: @item SP
1.2 noro 672:
1.1 noro 673: $BM-M}?t>e$N(B S-$BB?9`<07W;;;~4V(B
674:
675: @item SPM
1.2 noro 676:
1.1 noro 677: $BM-8BBN>e$N(B S-$BB?9`<07W;;;~4V(B
678:
679: @item NF
1.2 noro 680:
1.1 noro 681: $BM-M}?t>e$N(B normal form $B7W;;;~4V(B
682:
683: @item NFM
1.2 noro 684:
1.1 noro 685: $BM-8BBN>e$N(B normal form $B7W;;;~4V(B
686:
687: @item ZNFM
1.2 noro 688:
1.1 noro 689: @code{NFM} $B$NFb(B, 0 $B$X$N(B reduction $B$K$+$+$C$?;~4V(B
690:
691: @item PZ
1.2 noro 692:
1.1 noro 693: content $B7W;;;~4V(B
694:
695: @item NP
1.2 noro 696:
1.1 noro 697: $BM-M}?t78?tB?9`<0$N78?t$KBP$9$k>jM>1i;;$N7W;;;~4V(B
698:
699: @item MP
1.2 noro 700:
1.1 noro 701: S-$BB?9`<0$r@8@.$9$k%Z%"$NA*Br$K$+$+$C$?;~4V(B
702:
703: @item RA
1.2 noro 704:
1.1 noro 705: interreduce $B7W;;;~4V(B
706:
707: @item MC
1.2 noro 708:
1.1 noro 709: trace-lifting $B$K$*$1$k(B, $BF~NOB?9`<0$N%a%s%P%7%C%W7W;;;~4V(B
710:
711: @item GC
1.2 noro 712:
1.1 noro 713: $B7k2L$N%0%l%V%J4pDl8uJd$N%0%l%V%J4pDl%A%'%C%/;~4V(B
714:
715: @item T
1.2 noro 716:
1.1 noro 717: $B@8@.$5$l$?%Z%"$N?t(B
718:
719: @item B, M, F, D
1.2 noro 720:
1.1 noro 721: $B3F(B criterion $B$K$h$j=|$+$l$?%Z%"$N?t(B
722:
723: @item ZR
1.2 noro 724:
1.1 noro 725: 0 $B$K(B reduce $B$5$l$?%Z%"$N?t(B
726:
727: @item NZR
1.2 noro 728:
1.1 noro 729: 0 $B$G$J$$B?9`<0$K(B reduce $B$5$l$?%Z%"$N?t(B
730:
731: @item Max_mag
1.2 noro 732:
1.1 noro 733: $B@8@.$5$l$?B?9`<0$N(B, $B78?t$N%S%C%HD9$NOB$N:GBgCM(B
1.2 noro 734: \E
735: \BEG
736: @item UP
737:
738: Time to manipulate the list of critical pairs
739:
740: @item SP
741:
742: Time to compute S-polynomials over the rationals
743:
744: @item SPM
745:
746: Time to compute S-polynomials over a finite field
747:
748: @item NF
749:
750: Time to compute normal forms over the rationals
751:
752: @item NFM
753:
754: Time to compute normal forms over a finite field
755:
756: @item ZNFM
757:
758: Time for zero reductions in @code{NFM}
759:
760: @item PZ
761:
762: Time to remove integer contets
763:
764: @item NP
765:
766: Time to compute remainders for coefficients of polynomials with coeffieints
767: in the rationals
768:
769: @item MP
770:
771: Time to select pairs from which S-polynomials are computed
772:
773: @item RA
774:
775: Time to interreduce the Groebner basis candidate
776:
777: @item MC
1.1 noro 778:
1.2 noro 779: Time to check that each input polynomial is a member of the ideal
780: generated by the Groebner basis candidate.
781:
782: @item GC
783:
784: Time to check that the Groebner basis candidate is a Groebner basis
785:
786: @item T
787:
788: Number of critical pairs generated
789:
790: @item B, M, F, D
791:
792: Number of critical pairs removed by using each criterion
793:
794: @item ZR
795:
796: Number of S-polynomials reduced to 0
797:
798: @item NZR
799:
800: Number of S-polynomials reduced to non-zero results
801:
802: @item Max_mag
803:
804: Maximal magnitude among all the generated polynomials
805: \E
1.1 noro 806: @end table
807:
1.2 noro 808: \BJP
1.1 noro 809: @node $B9`=g=x$N@_Dj(B,,, $B%0%l%V%J4pDl$N7W;;(B
810: @section $B9`=g=x$N@_Dj(B
1.2 noro 811: \E
812: \BEG
813: @node Setting term orderings,,, Groebner basis computation
814: @section Setting term orderings
815: \E
1.1 noro 816:
817: @noindent
1.2 noro 818: \BJP
1.1 noro 819: $B9`$OFbIt$G$O(B, $B3FJQ?t$K4X$9$k;X?t$r@.J,$H$9$k@0?t%Y%/%H%k$H$7$FI=8=$5$l(B
820: $B$k(B. $BB?9`<0$rJ,;6I=8=B?9`<0$KJQ49$9$k:](B, $B3FJQ?t$,$I$N@.J,$KBP1~$9$k$+$r(B
821: $B;XDj$9$k$N$,(B, $BJQ?t%j%9%H$G$"$k(B. $B$5$i$K(B, $B$=$l$i@0?t%Y%/%H%k$NA4=g=x$r(B
822: $B;XDj$9$k$N$,9`=g=x$N7?$G$"$k(B. $B9`=g=x7?$O(B, $B?t(B, $B?t$N%j%9%H$"$k$$$O(B
823: $B9TNs$GI=8=$5$l$k(B.
1.2 noro 824: \E
825: \BEG
826: A term is internally represented as an integer vector whose components
827: are exponents with respect to variables. A variable list specifies the
828: correspondences between variables and components. A type of term ordering
829: specifies a total order for integer vectors. A type of term ordering is
830: represented by an integer, a list of integer or matrices.
831: \E
1.1 noro 832:
833: @noindent
1.2 noro 834: \JP $B4pK\E*$J9`=g=x7?$H$7$F<!$N(B 3 $B$D$,$"$k(B.
835: \EG There are following three fundamental types.
1.1 noro 836:
837: @table @code
1.2 noro 838: \JP @item 0 (DegRevLex; @b{$BA4<!?t5U<-=q<0=g=x(B})
839: \EG @item 0 (DegRevLex; @b{total degree reverse lexicographic ordering})
1.1 noro 840:
1.2 noro 841: \BJP
1.1 noro 842: $B0lHL$K(B, $B$3$N=g=x$K$h$k%0%l%V%J4pDl7W;;$,:G$b9bB.$G$"$k(B. $B$?$@$7(B,
843: $BJ}Dx<0$r2r$/$H$$$&L\E*$KMQ$$$k$3$H$O(B, $B0lHL$K$O$G$-$J$$(B. $B$3$N(B
844: $B=g=x$K$h$k%0%l%V%J4pDl$O(B, $B2r$N8D?t$N7W;;(B, $B%$%G%"%k$N%a%s%P%7%C%W$d(B,
845: $BB>$NJQ?t=g=x$X$N4pDlJQ49$N$?$a$N%=!<%9$H$7$FMQ$$$i$l$k(B.
1.2 noro 846: \E
847: \BEG
848: In general, computation by this ordering shows the fastest speed
849: in most Groebner basis computations.
850: However, for the purpose to solve polynomial equations, this type
851: of ordering is, in general, not so suitable.
852: The Groebner bases obtained by this ordering is used for computing
853: the number of solutions, solving ideal membership problem and seeds
854: for conversion to other Groebner bases under different ordering.
855: \E
1.1 noro 856:
1.2 noro 857: \JP @item 1 (DegLex; @b{$BA4<!?t<-=q<0=g=x(B})
858: \EG @item 1 (DegLex; @b{total degree lexicographic ordering})
1.1 noro 859:
1.2 noro 860: \BJP
1.1 noro 861: $B$3$N=g=x$b(B, $B<-=q<0=g=x$KHf$Y$F9bB.$K%0%l%V%J4pDl$r5a$a$k$3$H$,$G$-$k$,(B,
862: @code{DegRevLex} $B$HF1MMD>@\$=$N7k2L$rMQ$$$k$3$H$O:$Fq$G$"$k(B. $B$7$+$7(B,
863: $B<-=q<0=g=x$N%0%l%V%J4pDl$r5a$a$k:]$K(B, $B@F<!2=8e$K$3$N=g=x$G%0%l%V%J4pDl(B
864: $B$r5a$a$F$$$k(B.
1.2 noro 865: \E
866: \BEG
867: By this type term ordering, Groebner bases are obtained fairly faster
868: than Lex (lexicographic) ordering, too.
869: Alike the @code{DegRevLex} ordering, the result, in general, cannot directly
870: be used for solving polynomial equations.
871: It is used, however, in such a way
872: that a Groebner basis is computed in this ordering after homogenization
873: to obtain the final lexicographic Groebner basis.
874: \E
1.1 noro 875:
1.2 noro 876: \JP @item 2 (Lex; @b{$B<-=q<0=g=x(B})
877: \EG @item 2 (Lex; @b{lexicographic ordering})
1.1 noro 878:
1.2 noro 879: \BJP
1.1 noro 880: $B$3$N=g=x$K$h$k%0%l%V%J4pDl$O(B, $BJ}Dx<0$r2r$/>l9g$K:GE,$N7A$N4pDl$rM?$($k$,(B
881: $B7W;;;~4V$,$+$+$j2a$.$k$N$,FqE@$G$"$k(B. $BFC$K(B, $B2r$,M-8B8D$N>l9g(B, $B7k2L$N(B
882: $B78?t$,6K$a$FD9Bg$JB?G\D9?t$K$J$k>l9g$,B?$$(B. $B$3$N>l9g(B, @code{gr()},
883: @code{hgr()} $B$K$h$k7W;;$,6K$a$FM-8z$K$J$k>l9g$,B?$$(B.
1.2 noro 884: \E
885: \BEG
886: Groebner bases computed by this ordering give the most convenient
887: Groebner bases for solving the polynomial equations.
888: The only and serious shortcoming is the enormously long computation
889: time.
890: It is often observed that the number coefficients of the result becomes
891: very very long integers, especially if the ideal is 0-dimensional.
892: For such a case, it is empirically true for many cases
893: that i.e., computation by
894: @code{gr()} and/or @code{hgr()} may be quite effective.
895: \E
1.1 noro 896: @end table
897:
898: @noindent
1.2 noro 899: \BJP
1.1 noro 900: $B$3$l$i$rAH$_9g$o$;$F%j%9%H$G;XDj$9$k$3$H$K$h$j(B, $BMM!9$J>C5n=g=x$,;XDj$G$-$k(B.
901: $B$3$l$O(B,
1.2 noro 902: \E
903: \BEG
904: By combining these fundamental orderingl into a list, one can make
905: various term ordering called elimination orderings.
906: \E
1.1 noro 907:
908: @code{[[O1,L1],[O2,L2],...]}
909:
910: @noindent
1.2 noro 911: \BJP
1.1 noro 912: $B$G;XDj$5$l$k(B. @code{Oi} $B$O(B 0, 1, 2 $B$N$$$:$l$+$G(B, @code{Li} $B$OJQ?t$N8D(B
913: $B?t$rI=$9(B. $B$3$N;XDj$O(B, $BJQ?t$r@hF,$+$i(B @code{L1}, @code{L2} , ...$B8D(B
914: $B$:$D$NAH$KJ,$1(B, $B$=$l$>$l$NJQ?t$K4X$7(B, $B=g$K(B @code{O1}, @code{O2},
915: ...$B$N9`=g=x7?$GBg>.$,7hDj$9$k$^$GHf3S$9$k$3$H$r0UL#$9$k(B. $B$3$N7?$N(B
916: $B=g=x$O0lHL$K>C5n=g=x$H8F$P$l$k(B.
1.2 noro 917: \E
918: \BEG
919: In this example @code{Oi} indicates 0, 1 or 2 and @code{Li} indicates
920: the number of variables subject to the correspoinding orderings.
921: This specification means the following.
922:
923: The variable list is separated into sub lists from left to right where
924: the @code{i}-th list contains @code{Li} members and it corresponds to
925: the ordering of type @code{Oi}. The result of a comparison is equal
926: to that for the leftmost different sub components. This type of ordering
927: is called an elimination ordering.
928: \E
1.1 noro 929:
930: @noindent
1.2 noro 931: \BJP
1.1 noro 932: $B$5$i$K(B, $B9TNs$K$h$j9`=g=x$r;XDj$9$k$3$H$,$G$-$k(B. $B0lHL$K(B, @code{n} $B9T(B
933: @code{m} $BNs$N<B?t9TNs(B @code{M} $B$,<!$N@-<A$r;}$D$H$9$k(B.
1.2 noro 934: \E
935: \BEG
936: Furthermore one can specify a term ordering by a matix.
937: Suppose that a real @code{n}, @code{m} matrix @code{M} has the
938: following properties.
939: \E
1.1 noro 940:
941: @enumerate
942: @item
1.2 noro 943: \JP $BD9$5(B @code{m} $B$N@0?t%Y%/%H%k(B @code{v} $B$KBP$7(B @code{Mv=0} $B$H(B @code{v=0} $B$OF1CM(B.
944: \BEG
945: For all integer verctors @code{v} of length @code{m} @code{Mv=0} is equivalent
946: to @code{v=0}.
947: \E
1.1 noro 948:
949: @item
1.2 noro 950: \BJP
1.1 noro 951: $BHsIi@.J,$r;}$DD9$5(B @code{m} $B$N(B 0 $B$G$J$$@0?t%Y%/%H%k(B @code{v} $B$KBP$7(B,
952: @code{Mv} $B$N(B 0 $B$G$J$$:G=i$N@.J,$OHsIi(B.
1.2 noro 953: \E
954: \BEG
955: For all non-negative integer vectors @code{v} the first non-zero component
956: of @code{Mv} is non-negative.
957: \E
1.1 noro 958: @end enumerate
959:
960: @noindent
1.2 noro 961: \BJP
1.1 noro 962: $B$3$N;~(B, 2 $B$D$N%Y%/%H%k(B @code{t}, @code{s} $B$KBP$7(B,
963: @code{t>s} $B$r(B, @code{M(t-s)} $B$N(B 0 $B$G$J$$:G=i$N@.J,$,HsIi(B,
964: $B$GDj5A$9$k$3$H$K$h$j9`=g=x$,Dj5A$G$-$k(B.
1.2 noro 965: \E
966: \BEG
967: Then we can define a term ordering such that, for two vectors
968: @code{t}, @code{s}, @code{t>s} means that the first non-zero component
969: of @code{M(t-s)} is non-negative.
970: \E
1.1 noro 971:
972: @noindent
1.2 noro 973: \BJP
1.1 noro 974: $B9`=g=x7?$O(B, @code{gr()} $B$J$I$N0z?t$H$7$F;XDj$5$l$kB>(B, $BAH$_9~$_H!?t(B
975: @code{dp_ord()} $B$G;XDj$5$l(B, $B$5$^$6$^$JH!?t$N<B9T$N:]$K;2>H$5$l$k(B.
1.2 noro 976: \E
977: \BEG
978: Types of term orderings are used as arguments of functions such as
979: @code{gr()}. It is also set internally by @code{dp_ord()} and is used
980: during executions of various functions.
981: \E
1.1 noro 982:
983: @noindent
1.2 noro 984: \BJP
1.1 noro 985: $B$3$l$i$N=g=x$N6qBNE*$JDj5A$*$h$S%0%l%V%J4pDl$K4X$9$k99$K>\$7$$2r@b$O(B
986: @code{[Becker,Weispfenning]} $B$J$I$r;2>H$N$3$H(B.
1.2 noro 987: \E
988: \BEG
989: For concrete definitions of term ordering and more information
990: about Groebner basis, refer to, for example, the book
991: @code{[Becker,Weispfenning]}.
992: \E
1.1 noro 993:
994: @noindent
1.2 noro 995: \JP $B9`=g=x7?$N@_Dj$NB>$K(B, $BJQ?t$N=g=x<+BN$b7W;;;~4V$KBg$-$J1F6A$rM?$($k(B.
996: \BEG
997: Note that the variable ordering have strong effects on the computation
998: time as well as the choice of types of term orderings.
999: \E
1.1 noro 1000:
1001: @example
1002: [90] B=[x^10-t,x^8-z,x^31-x^6-x-y]$
1003: [91] gr(B,[x,y,z,t],2);
1004: [x^2-2*y^7+(-41*t^2-13*t-1)*y^2+(2*t^17-12*t^14+42*t^12+30*t^11-168*t^9
1005: -40*t^8+70*t^7+252*t^6+30*t^5-140*t^4-168*t^3+2*t^2-12*t+16)*z^2*y
1006: +(-12*t^16+72*t^13-28*t^11-180*t^10+112*t^8+240*t^7+28*t^6-127*t^5
1007: -167*t^4-55*t^3+30*t^2+58*t-15)*z^4,
1.5 noro 1008: (y+t^2*z^2)*x+y^7+(20*t^2+6*t+1)*y^2+(-t^17+6*t^14-21*t^12-15*t^11
1009: +84*t^9+20*t^8-35*t^7-126*t^6-15*t^5+70*t^4+84*t^3-t^2+5*t-9)*z^2*y
1010: +(6*t^16-36*t^13+14*t^11+90*t^10-56*t^8-120*t^7-14*t^6+64*t^5+84*t^4
1011: +27*t^3-16*t^2-30*t+7)*z^4,
1012: (t^3-1)*x-y^6+(-6*t^13+24*t^10-20*t^8-36*t^7+40*t^5+24*t^4-6*t^3-20*t^2
1013: -6*t-1)*y+(t^17-6*t^14+9*t^12+15*t^11-36*t^9-20*t^8-5*t^7+54*t^6+15*t^5
1014: +10*t^4-36*t^3-11*t^2-5*t+9)*z^2,
1.1 noro 1015: -y^8-8*t*y^3+16*z^2*y^2+(-8*t^16+48*t^13-56*t^11-120*t^10+224*t^8+160*t^7
1.5 noro 1016: -56*t^6-336*t^5-112*t^4+112*t^3+224*t^2+24*t-56)*z^4*y+(t^24-8*t^21
1017: +20*t^19+28*t^18-120*t^16-56*t^15+14*t^14+300*t^13+70*t^12-56*t^11
1018: -400*t^10-84*t^9+84*t^8+268*t^7+84*t^6-56*t^5-63*t^4-36*t^3+46*t^2
1019: -12*t+1)*z,2*t*y^5+z*y^2+(-2*t^11+8*t^8-20*t^6-12*t^5+40*t^3+8*t^2
1020: -10*t-20)*z^3*y+8*t^14-32*t^11+48*t^8-t^7-32*t^5-6*t^4+9*t^2-t,
1.1 noro 1021: -z*y^3+(t^7-2*t^4+3*t^2+t)*y+(-2*t^6+4*t^3+2*t-2)*z^2,
1.5 noro 1022: 2*t^2*y^3+z^2*y^2+(-2*t^5+4*t^2-6)*z^4*y
1023: +(4*t^8-t^7-8*t^5+2*t^4-4*t^3+5*t^2-t)*z,
1.1 noro 1024: z^3*y^2+2*t^3*y+(-t^7+2*t^4+t^2-t)*z^2,
1025: -t*z*y^2-2*z^3*y+t^8-2*t^5-t^3+t^2,
1.5 noro 1026: -t^3*y^2-2*t^2*z^2*y+(t^6-2*t^3-t+1)*z^4,z^5-t^4]
1.1 noro 1027: [93] gr(B,[t,z,y,x],2);
1028: [x^10-t,x^8-z,x^31-x^6-x-y]
1029: @end example
1030:
1031: @noindent
1.2 noro 1032: \BJP
1.1 noro 1033: $BJQ?t=g=x(B @code{[x,y,z,t]} $B$K$*$1$k%0%l%V%J4pDl$O(B, $B4pDl$N?t$bB?$/(B, $B$=$l$>$l$N(B
1034: $B<0$bBg$-$$(B. $B$7$+$7(B, $B=g=x(B @code{[t,z,y,x]} $B$K$b$H$G$O(B, @code{B} $B$,$9$G$K(B
1035: $B%0%l%V%J4pDl$H$J$C$F$$$k(B. $BBg;(GD$K$$$($P(B, $B<-=q<0=g=x$G%0%l%V%J4pDl$r5a$a$k(B
1036: $B$3$H$O(B, $B:8B&$N(B ($B=g=x$N9b$$(B) $BJQ?t$r(B, $B1&B&$N(B ($B=g=x$NDc$$(B) $BJQ?t$G=q$-I=$9(B
1037: $B$3$H$G$"$j(B, $B$3$NNc$N>l9g$O(B, @code{t}, @code{z}, @code{y} $B$,4{$K(B
1038: @code{x} $B$GI=$5$l$F$$$k$3$H$+$i$3$N$h$&$J6KC<$J7k2L$H$J$C$?$o$1$G$"$k(B.
1039: $B<B:]$K8=$l$k7W;;$K$*$$$F$O(B, $B$3$N$h$&$KA*$V$Y$-JQ?t=g=x$,L@$i$+$G$"$k(B
1040: $B$3$H$O>/$J$/(B, $B;n9T:x8m$,I,MW$J>l9g$b$"$k(B.
1.2 noro 1041: \E
1042: \BEG
1043: As you see in the above example, the Groebner base under variable
1044: ordering @code{[x,y,z,t]} has a lot of bases and each base itself is
1045: large. Under variable ordering @code{[t,z,y,x]}, however, @code{B} itself
1046: is already the Groebner basis.
1047: Roughly speaking, to obtain a Groebner base under the lexicographic
1048: ordering is to express the variables on the left (having higher order)
1049: in terms of variables on the right (having lower order).
1050: In the example, variables @code{t}, @code{z}, and @code{y} are already
1051: expressed by variable @code{x}, and the above explanation justifies
1052: such a drastic experimental results.
1053: In practice, however, optimum ordering for variables may not known
1054: beforehand, and some heuristic trial may be inevitable.
1055: \E
1.1 noro 1056:
1.2 noro 1057: \BJP
1.1 noro 1058: @node $BM-M}<0$r78?t$H$9$k%0%l%V%J4pDl7W;;(B,,, $B%0%l%V%J4pDl$N7W;;(B
1059: @section $BM-M}<0$r78?t$H$9$k%0%l%V%J4pDl7W;;(B
1.2 noro 1060: \E
1061: \BEG
1062: @node Groebner basis computation with rational function coefficients,,, Groebner basis computation
1063: @section Groebner basis computation with rational function coefficients
1064: \E
1.1 noro 1065:
1066: @noindent
1.2 noro 1067: \BJP
1.1 noro 1068: @code{gr()} $B$J$I$N%H%C%W%l%Y%kH!?t$O(B, $B$$$:$l$b(B, $BF~NOB?9`<0%j%9%H$K(B
1069: $B8=$l$kJQ?t(B ($BITDj85(B) $B$H(B, $BJQ?t%j%9%H$K8=$l$kJQ?t$rHf3S$7$F(B, $BJQ?t%j%9%H$K(B
1070: $B$J$$JQ?t$,F~NOB?9`<0$K8=$l$F$$$k>l9g$K$O(B, $B<+F0E*$K(B, $B$=$NJQ?t$r(B, $B78?t(B
1071: $BBN$N85$H$7$F07$&(B.
1.2 noro 1072: \E
1073: \BEG
1074: Such variables that appear within the input polynomials but
1075: not appearing in the input variable list are automatically treated
1076: as elements in the coefficient field
1077: by top level functions, such as @code{gr()}.
1078: \E
1.1 noro 1079:
1080: @example
1081: [64] gr([a*x+b*y-c,d*x+e*y-f],[x,y],2);
1082: [(-e*a+d*b)*x-f*b+e*c,(-e*a+d*b)*y+f*a-d*c]
1083: @end example
1084:
1085: @noindent
1.2 noro 1086: \BJP
1.1 noro 1087: $B$3$NNc$G$O(B, @code{a}, @code{b}, @code{c}, @code{d} $B$,78?tBN$N85$H$7$F(B
1088: $B07$o$l$k(B. $B$9$J$o$A(B, $BM-M}H!?tBN(B
1089: @b{F} = @b{Q}(@code{a},@code{b},@code{c},@code{d}) $B>e$N(B 2 $BJQ?tB?9`<04D(B
1090: @b{F}[@code{x},@code{y}] $B$K$*$1$k%0%l%V%J4pDl$r5a$a$k$3$H$K$J$k(B.
1091: $BCm0U$9$Y$-$3$H$O(B,
1092: $B78?t$,BN$H$7$F07$o$l$F$$$k$3$H$G$"$k(B. $B$9$J$o$A(B, $B78?t$N4V$KB?9`<0(B
1093: $B$H$7$F$N6&DL0x;R$,$"$C$?>l9g$K$O(B, $B7k2L$+$i$=$N0x;R$O=|$+$l$F$$$k(B
1094: $B$?$a(B, $BM-M}?tBN>e$NB?9`<04D>e$NLdBj$H$7$F9M$($?>l9g$N7k2L$H$O0lHL(B
1095: $B$K$O0[$J$k(B. $B$^$?(B, $B<g$H$7$F7W;;8zN(>e$NLdBj$N$?$a(B, $BJ,;6I=8=B?9`<0(B
1096: $B$N78?t$H$7$F<B:]$K5v$5$l$k$N$OB?9`<0$^$G$G$"$k(B. $B$9$J$o$A(B, $BJ,Jl$r(B
1097: $B;}$DM-M}<0$OJ,;6I=8=B?9`<0$N78?t$H$7$F$O5v$5$l$J$$(B.
1.2 noro 1098: \E
1099: \BEG
1100: In this example, variables @code{a}, @code{b}, @code{c}, and @code{d}
1101: are treated as elements in the coefficient field.
1102: In this case, a Groebner basis is computed
1103: on a bi-variate polynomial ring
1104: @b{F}[@code{x},@code{y}]
1105: over rational function field
1106: @b{F} = @b{Q}(@code{a},@code{b},@code{c},@code{d}).
1107: Notice that coefficients are considered as a member in a field.
1108: As a consequence, polynomial factors common to the coefficients
1109: are removed so that the result, in general, is different from
1110: the result that would be obtained when the problem is considered
1111: as a computation of Groebner basis over a polynomial ring
1112: with rational function coefficients.
1113: And note that coefficients of a distributed polynomial are limited
1114: to numbers and polynomials because of efficiency.
1115: \E
1.1 noro 1116:
1.2 noro 1117: \BJP
1.1 noro 1118: @node $B4pDlJQ49(B,,, $B%0%l%V%J4pDl$N7W;;(B
1119: @section $B4pDlJQ49(B
1.2 noro 1120: \E
1121: \BEG
1122: @node Change of ordering,,, Groebner basis computation
1123: @section Change of orderng
1124: \E
1.1 noro 1125:
1126: @noindent
1.2 noro 1127: \BJP
1.1 noro 1128: $B<-=q<0=g=x$N%0%l%V%J4pDl$r5a$a$k>l9g(B, $BD>@\(B @code{gr()} $B$J$I$r5/F0$9$k(B
1129: $B$h$j(B, $B0lC6B>$N=g=x(B ($BNc$($PA4<!?t5U<-=q<0=g=x(B) $B$N%0%l%V%J4pDl$r7W;;$7$F(B,
1130: $B$=$l$rF~NO$H$7$F<-=q<0=g=x$N%0%l%V%J4pDl$r7W;;$9$kJ}$,8zN($,$h$$>l9g(B
1131: $B$,$"$k(B. $B$^$?(B, $BF~NO$,2?$i$+$N=g=x$G$N%0%l%V%J4pDl$K$J$C$F$$$k>l9g(B, $B4pDl(B
1132: $BJQ49$H8F$P$l$kJ}K!$K$h$j(B, Buchberger $B%"%k%4%j%:%`$K$h$i$:$K8zN(NI$/(B
1133: $B<-=q<0=g=x$N%0%l%V%J4pDl$,7W;;$G$-$k>l9g$,$"$k(B. $B$3$N$h$&$JL\E*$N$?$a$N(B
1134: $BH!?t$,(B, $B%f!<%6Dj5AH!?t$H$7$F(B @samp{gr} $B$K$$$/$D$+Dj5A$5$l$F$$$k(B.
1135: $B0J2<$N(B 2 $B$D$NH!?t$O(B, $BJQ?t=g=x(B @var{vlist1}, $B9`=g=x7?(B @var{order} $B$G(B
1136: $B4{$K%0%l%V%J4pDl$H$J$C$F$$$kB?9`<0%j%9%H(B @var{gbase} $B$r(B, $BJQ?t=g=x(B
1137: @var{vlist2} $B$K$*$1$k<-=q<0=g=x$N%0%l%V%J4pDl$KJQ49$9$kH!?t$G$"$k(B.
1.2 noro 1138: \E
1139: \BEG
1140: When we compute a lex order Groebner basis, it is often efficient to
1141: compute it via Groebner basis with respect to another order such as
1142: degree reverse lex order, rather than to compute it directory by
1143: @code{gr()} etc. If we know that an input is a Groebner basis with
1144: respect to an order, we can apply special methods called change of
1145: ordering for a Groebner basis computation with respect to another
1146: order, without using Buchberger algorithm. The following two functions
1147: are ones for change of ordering such that they convert a Groebner
1148: basis @var{gbase} with respect to the variable order @var{vlist1} and
1149: the order type @var{order} into a lex Groebner basis with respect
1150: to the variable order @var{vlist2}.
1151: \E
1.1 noro 1152:
1153: @table @code
1154: @item tolex(@var{gbase},@var{vlist1},@var{order},@var{vlist2})
1155:
1.2 noro 1156: \BJP
1.1 noro 1157: $B$3$NH!?t$O(B, @var{gbase} $B$,M-M}?tBN>e$N%7%9%F%`$N>l9g$K$N$_;HMQ2DG=$G$"$k(B.
1158: $B$3$NH!?t$O(B, $B<-=q<0=g=x$N%0%l%V%J4pDl$r(B, $BM-8BBN>e$G7W;;$5$l$?%0%l%V%J4pDl(B
1159: $B$r?w7?$H$7$F(B, $BL$Dj78?tK!$*$h$S(B Hensel $B9=@.$K$h$j5a$a$k$b$N$G$"$k(B.
1.2 noro 1160: \E
1161: \BEG
1162: This function can be used only when @var{gbase} is an ideal over the
1163: rationals. The input @var{gbase} must be a Groebner basis with respect
1164: to the variable order @var{vlist1} and the order type @var{order}. Moreover
1165: the ideal generated by @var{gbase} must be zero-dimensional.
1166: This computes the lex Groebner basis of @var{gbase}
1167: by using the modular change of ordering algorithm. The algorithm first
1168: computes the lex Groebner basis over a finite field. Then each element
1169: in the lex Groebner basis over the rationals is computed with undetermined
1170: coefficient method and linear equation solving by Hensel lifting.
1171: \E
1.1 noro 1172:
1173: @item tolex_tl(@var{gbase},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1174:
1.2 noro 1175: \BJP
1.1 noro 1176: $B$3$NH!?t$O(B, $B<-=q<0=g=x$N%0%l%V%J4pDl$r(B Buchberger $B%"%k%4%j%:%`$K$h$j5a(B
1177: $B$a$k$b$N$G$"$k$,(B, $BF~NO$,$"$k=g=x$K$*$1$k%0%l%V%J4pDl$G$"$k>l9g$N(B
1178: trace-lifting$B$K$*$1$k%0%l%V%J4pDl8uJd$NF,9`(B, $BF,78?t$N@-<A$rMxMQ$7$F(B,
1179: $B:G=*E*$J%0%l%V%J4pDl%A%'%C%/(B, $B%$%G%"%k%a%s%P%7%C%W%A%'%C%/$r>JN,$7$F$$(B
1180: $B$k$?$a(B, $BC1$K(BBuchberger $B%"%k%4%j%:%`$r7+$jJV$9$h$j8zN($h$/7W;;$G$-$k(B.
1181: $B99$K(B, $BF~NO$,(B 0 $B<!85%7%9%F%`$N>l9g(B, $B<+F0E*$K$b$&(B 1 $B$D$NCf4VE*$J9`=g=x$r(B
1182: $B7PM3$7$F<-=q<0=g=x$N%0%l%V%J4pDl$r7W;;$9$k(B. $BB?$/$N>l9g(B, $B$3$NJ}K!$O(B,
1183: $BD>@\<-=q<0=g=x$N7W;;$r9T$&$h$j8zN($,$h$$(B. ($B$b$A$m$sNc30$"$j(B. )
1184: $B0z?t(B @var{homo} $B$,(B 0 $B$G$J$$;~(B, @code{hgr()} $B$HF1MM$K@F<!2=$r7PM3$7$F(B
1185: $B7W;;$r9T$&(B.
1.2 noro 1186: \E
1187: \BEG
1188: This function computes the lex Groebner basis of @var{gbase}. The
1189: input @var{gbase} must be a Groebner basis with respect to the
1190: variable order @var{vlist1} and the order type @var{order}.
1191: Buchberger algorithm with trace lifting is used to compute the lex
1192: Groebner basis, however the Groebner basis check and the ideal
1193: membership check can be omitted by using several properties derived
1194: from the fact that the input is a Groebner basis. So it is more
1195: efficient than simple repetition of Buchberger algorithm. If the input
1196: is zero-dimensional, this function inserts automatically a computation
1197: of Groebner basis with respect to an elimination order, which makes
1198: the whole computation more efficient for many cases. If @var{homo} is
1199: not equal to 0, homogenization is used in each step.
1200: \E
1.1 noro 1201: @end table
1202:
1203: @noindent
1.2 noro 1204: \BJP
1.1 noro 1205: $B$=$NB>(B, 0 $B<!85%7%9%F%`$KBP$7(B, $BM?$($i$l$?B?9`<0$N:G>.B?9`<0$r5a$a$k(B
1206: $BH!?t(B, 0 $B<!85%7%9%F%`$N2r$r(B, $B$h$j%3%s%Q%/%H$KI=8=$9$k$?$a$NH!?t$J$I$,(B
1207: @samp{gr} $B$GDj5A$5$l$F$$$k(B. $B$3$l$i$K$D$$$F$O8D!9$NH!?t$N@bL@$r;2>H$N$3$H(B.
1.2 noro 1208: \E
1209: \BEG
1210: For zero-dimensional systems, there are several fuctions to
1211: compute the minimal polynomial of a polynomial and or a more compact
1212: representation for zeros of the system. They are all defined in @samp{gr}.
1213: Refer to the sections for each functions.
1214: \E
1.1 noro 1215:
1.2 noro 1216: \BJP
1.6 noro 1217: @node Weyl $BBe?t(B,,, $B%0%l%V%J4pDl$N7W;;(B
1218: @section Weyl $BBe?t(B
1219: \E
1220: \BEG
1221: @node Weyl algebra,,, Groebner basis computation
1222: @section Weyl algebra
1223: \E
1224:
1225: @noindent
1226:
1227: \BJP
1228: $B$3$l$^$G$O(B, $BDL>o$N2D49$JB?9`<04D$K$*$1$k%0%l%V%J4pDl7W;;$K$D$$$F(B
1229: $B=R$Y$F$-$?$,(B, $B%0%l%V%J4pDl$NM}O@$O(B, $B$"$k>r7o$rK~$?$9Hs2D49$J(B
1230: $B4D$K$b3HD%$G$-$k(B. $B$3$N$h$&$J4D$NCf$G(B, $B1~MQ>e$b=EMW$J(B,
1231: Weyl $BBe?t(B, $B$9$J$o$AB?9`<04D>e$NHyJ,:nMQAG4D$N1i;;$*$h$S(B
1232: $B%0%l%V%J4pDl7W;;$,(B Risa/Asir $B$K<BAu$5$l$F$$$k(B.
1233:
1234: $BBN(B @code{K} $B>e$N(B @code{n} $B<!85(B Weyl $BBe?t(B
1235: @code{D=K<x1,@dots{},xn,D1,@dots{},Dn>} $B$O(B
1236: \E
1237:
1238: \BEG
1239: So far we have explained Groebner basis computation in
1240: commutative polynomial rings. However Groebner basis can be
1241: considered in more general non-commutative rings.
1242: Weyl algebra is one of such rings and
1243: Risa/Asir implements fundamental operations
1244: in Weyl algebra and Groebner basis computation in Weyl algebra.
1245:
1246: The @code{n} dimensional Weyl algebra over a field @code{K},
1247: @code{D=K<x1,@dots{},xn,D1,@dots{},Dn>} is a non-commutative
1248: algebra which has the following fundamental relations:
1249: \E
1250:
1251: @code{xi*xj-xj*xi=0}, @code{Di*Dj-Dj*Di=0}, @code{Di*xj-xj*Di=0} (@code{i!=j}),
1252: @code{Di*xi-xi*Di=1}
1253:
1254: \BJP
1255: $B$H$$$&4pK\4X78$r;}$D4D$G$"$k(B. @code{D} $B$O(B $BB?9`<04D(B @code{K[x1,@dots{},xn]} $B$r78?t(B
1256: $B$H$9$kHyJ,:nMQAG4D$G(B, @code{Di} $B$O(B @code{xi} $B$K$h$kHyJ,$rI=$9(B. $B8r494X78$K$h$j(B,
1257: @code{D} $B$N85$O(B, @code{x1^i1*@dots{}*xn^in*D1^j1*@dots{}*Dn^jn} $B$J$kC19`(B
1258: $B<0$N(B @code{K} $B@~7A7k9g$H$7$F=q$-I=$9$3$H$,$G$-$k(B.
1259: Risa/Asir $B$K$*$$$F$O(B, $B$3$NC19`<0$r(B, $B2D49$JB?9`<0$HF1MM$K(B
1260: @code{<<i1,@dots{},in,j1,@dots{},jn>>} $B$GI=$9(B. $B$9$J$o$A(B, @code{D} $B$N85$b(B
1261: $BJ,;6I=8=B?9`<0$H$7$FI=$5$l$k(B. $B2C8:;;$O(B, $B2D49$N>l9g$HF1MM$K(B, @code{+}, @code{-}
1262: $B$K$h$j(B
1263: $B<B9T$G$-$k$,(B, $B>h;;$O(B, $BHs2D49@-$r9MN8$7$F(B @code{dp_weyl_mul()} $B$H$$$&4X?t(B
1264: $B$K$h$j<B9T$9$k(B.
1265: \E
1266:
1267: \BEG
1268: @code{D} is the ring of differential operators whose coefficients
1269: are polynomials in @code{K[x1,@dots{},xn]} and
1270: @code{Di} denotes the differentiation with respect to @code{xi}.
1271: According to the commutation relation,
1272: elements of @code{D} can be represented as a @code{K}-linear combination
1273: of monomials @code{x1^i1*@dots{}*xn^in*D1^j1*@dots{}*Dn^jn}.
1274: In Risa/Asir, this type of monomial is represented
1275: by @code{<<i1,@dots{},in,j1,@dots{},jn>>} as in the case of commutative
1276: polynomial.
1277: That is, elements of @code{D} are represented by distributed polynomials.
1278: Addition and subtraction can be done by @code{+}, @code{-},
1279: but multiplication is done by calling @code{dp_weyl_mul()} because of
1280: the non-commutativity of @code{D}.
1281: \E
1282:
1283: @example
1284: [0] A=<<1,2,2,1>>;
1285: (1)*<<1,2,2,1>>
1286: [1] B=<<2,1,1,2>>;
1287: (1)*<<2,1,1,2>>
1288: [2] A*B;
1289: (1)*<<3,3,3,3>>
1290: [3] dp_weyl_mul(A,B);
1291: (1)*<<3,3,3,3>>+(1)*<<3,2,3,2>>+(4)*<<2,3,2,3>>+(4)*<<2,2,2,2>>
1292: +(2)*<<1,3,1,3>>+(2)*<<1,2,1,2>>
1293: @end example
1294:
1295: \BJP
1296: $B%0%l%V%J4pDl7W;;$K$D$$$F$b(B, Weyl $BBe?t@lMQ$N4X?t$H$7$F(B,
1297: $B<!$N4X?t$,MQ0U$7$F$"$k(B.
1298: \E
1299: \BEG
1300: The following functions are avilable for Groebner basis computation
1301: in Weyl algebra:
1302: \E
1303: @code{dp_weyl_gr_main()},
1304: @code{dp_weyl_gr_mod_main()},
1305: @code{dp_weyl_gr_f_main()},
1306: @code{dp_weyl_f4_main()},
1307: @code{dp_weyl_f4_mod_main()}.
1308: \BJP
1309: $B$^$?(B, $B1~MQ$H$7$F(B, global b $B4X?t$N7W;;$,<BAu$5$l$F$$$k(B.
1310: \E
1311: \BEG
1312: Computation of the global b function is implemented as an application.
1313: \E
1314:
1315: \BJP
1.1 noro 1316: @node $B%0%l%V%J4pDl$K4X$9$kH!?t(B,,, $B%0%l%V%J4pDl$N7W;;(B
1317: @section $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1.2 noro 1318: \E
1319: \BEG
1320: @node Functions for Groebner basis computation,,, Groebner basis computation
1321: @section Functions for Groebner basis computation
1322: \E
1.1 noro 1323:
1324: @menu
1325: * gr hgr gr_mod::
1326: * lex_hensel lex_tl tolex tolex_d tolex_tl::
1327: * lex_hensel_gsl tolex_gsl tolex_gsl_d::
1328: * gr_minipoly minipoly::
1329: * tolexm minipolym::
1.6 noro 1330: * dp_gr_main dp_gr_mod_main dp_gr_f_main dp_weyl_gr_main dp_weyl_gr_mod_main dp_weyl_gr_f_main::
1331: * dp_f4_main dp_f4_mod_main dp_weyl_f4_main dp_weyl_f4_mod_main::
1.1 noro 1332: * dp_gr_flags dp_gr_print::
1333: * dp_ord::
1334: * dp_ptod::
1335: * dp_dtop::
1336: * dp_mod dp_rat::
1337: * dp_homo dp_dehomo::
1338: * dp_ptozp dp_prim::
1339: * dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod::
1340: * dp_hm dp_ht dp_hc dp_rest::
1341: * dp_td dp_sugar::
1342: * dp_lcm::
1343: * dp_redble::
1344: * dp_subd::
1345: * dp_mbase::
1346: * dp_mag::
1347: * dp_red dp_red_mod::
1348: * dp_sp dp_sp_mod::
1349: * p_nf p_nf_mod p_true_nf p_true_nf_mod ::
1350: * p_terms::
1351: * gb_comp::
1352: * katsura hkatsura cyclic hcyclic::
1353: * dp_vtoe dp_etov::
1354: * lex_hensel_gsl tolex_gsl tolex_gsl_d::
1.3 noro 1355: * primadec primedec::
1.5 noro 1356: * primedec_mod::
1.6 noro 1357: * bfunction generic_bfct::
1.1 noro 1358: @end menu
1359:
1.2 noro 1360: \JP @node gr hgr gr_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1361: \EG @node gr hgr gr_mod,,, Functions for Groebner basis computation
1.1 noro 1362: @subsection @code{gr}, @code{hgr}, @code{gr_mod}, @code{dgr}
1363: @findex gr
1364: @findex hgr
1365: @findex gr_mod
1366: @findex dgr
1367:
1368: @table @t
1369: @item gr(@var{plist},@var{vlist},@var{order})
1370: @itemx hgr(@var{plist},@var{vlist},@var{order})
1371: @itemx gr_mod(@var{plist},@var{vlist},@var{order},@var{p})
1372: @itemx dgr(@var{plist},@var{vlist},@var{order},@var{procs})
1.2 noro 1373: \JP :: $B%0%l%V%J4pDl$N7W;;(B
1374: \EG :: Groebner basis computation
1.1 noro 1375: @end table
1376:
1377: @table @var
1378: @item return
1.2 noro 1379: \JP $B%j%9%H(B
1380: \EG list
1.4 noro 1381: @item plist vlist procs
1.2 noro 1382: \JP $B%j%9%H(B
1383: \EG list
1.1 noro 1384: @item order
1.2 noro 1385: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
1386: \EG number, list or matrix
1.1 noro 1387: @item p
1.2 noro 1388: \JP 2^27 $BL$K~$NAG?t(B
1389: \EG prime less than 2^27
1.1 noro 1390: @end table
1391:
1392: @itemize @bullet
1.2 noro 1393: \BJP
1.1 noro 1394: @item
1395: $BI8=`%i%$%V%i%j$N(B @samp{gr} $B$GDj5A$5$l$F$$$k(B.
1396: @item
1397: $B$$$:$l$b(B, $BB?9`<0%j%9%H(B @var{plist} $B$N(B, $BJQ?t=g=x(B @var{vlist}, $B9`=g=x7?(B
1398: @var{order} $B$K4X$9$k%0%l%V%J4pDl$r5a$a$k(B. @code{gr()}, @code{hgr()}
1399: $B$O(B $BM-M}?t78?t(B, @code{gr_mod()} $B$O(B GF(@var{p}) $B78?t$H$7$F7W;;$9$k(B.
1400: @item
1401: @var{vlist} $B$OITDj85$N%j%9%H(B. @var{vlist} $B$K8=$l$J$$ITDj85$O(B,
1402: $B78?tBN$KB0$9$k$H8+$J$5$l$k(B.
1403: @item
1404: @code{gr()}, trace-lifting ($B%b%8%e%i1i;;$rMQ$$$?9bB.2=(B) $B$*$h$S(B sugar
1405: strategy $B$K$h$k7W;;(B, @code{hgr()} $B$O(B trace-lifting $B$*$h$S(B
1406: $B@F<!2=$K$h$k(B $B6:@5$5$l$?(B sugar strategy $B$K$h$k7W;;$r9T$&(B.
1407: @item
1408: @code{dgr()} $B$O(B, @code{gr()}, @code{dgr()} $B$r(B
1409: $B;R%W%m%;%9%j%9%H(B @var{procs} $B$N(B 2 $B$D$N%W%m%;%9$K$h$jF1;~$K7W;;$5$;(B,
1410: $B@h$K7k2L$rJV$7$?J}$N7k2L$rJV$9(B. $B7k2L$OF10l$G$"$k$,(B, $B$I$A$i$NJ}K!$,(B
1411: $B9bB.$+0lHL$K$OITL@$N$?$a(B, $B<B:]$N7P2a;~4V$rC;=L$9$k$N$KM-8z$G$"$k(B.
1412: @item
1413: @code{dgr()} $B$GI=<($5$l$k;~4V$O(B, $B$3$NH!?t$,<B9T$5$l$F$$$k%W%m%;%9$G$N(B
1414: CPU $B;~4V$G$"$j(B, $B$3$NH!?t$N>l9g$O$[$H$s$IDL?.$N$?$a$N;~4V$G$"$k(B.
1.2 noro 1415: \E
1416: \BEG
1417: @item
1418: These functions are defined in @samp{gr} in the standard library
1419: directory.
1420: @item
1421: They compute a Groebner basis of a polynomial list @var{plist} with
1422: respect to the variable order @var{vlist} and the order type @var{order}.
1423: @code{gr()} and @code{hgr()} compute a Groebner basis over the rationals
1424: and @code{gr_mod} computes over GF(@var{p}).
1425: @item
1426: Variables not included in @var{vlist} are regarded as
1427: included in the ground field.
1428: @item
1429: @code{gr()} uses trace-lifting (an improvement by modular computation)
1430: and sugar strategy.
1431: @code{hgr()} uses trace-lifting and a cured sugar strategy
1432: by using homogenization.
1433: @item
1434: @code{dgr()} executes @code{gr()}, @code{dgr()} simultaneously on
1435: two process in a child process list @var{procs} and returns
1436: the result obtained first. The results returned from both the process
1437: should be equal, but it is not known in advance which method is faster.
1438: Therefore this function is useful to reduce the actual elapsed time.
1439: @item
1440: The CPU time shown after an exection of @code{dgr()} indicates
1441: that of the master process, and most of the time corresponds to the time
1442: for communication.
1443: \E
1.1 noro 1444: @end itemize
1445:
1446: @example
1447: [0] load("gr")$
1448: [64] load("cyclic")$
1449: [74] G=gr(cyclic(5),[c0,c1,c2,c3,c4],2);
1450: [c4^15+122*c4^10-122*c4^5-1,...]
1451: [75] GM=gr_mod(cyclic(5),[c0,c1,c2,c3,c4],2,31991)$
1452: 24628*c4^15+29453*c4^10+2538*c4^5+7363
1453: [76] (G[0]*24628-GM[0])%31991;
1454: 0
1455: @end example
1456:
1457: @table @t
1.2 noro 1458: \JP @item $B;2>H(B
1459: \EG @item References
1.6 noro 1460: @fref{dp_gr_main dp_gr_mod_main dp_gr_f_main dp_weyl_gr_main dp_weyl_gr_mod_main dp_weyl_gr_f_main},
1.1 noro 1461: @fref{dp_ord}.
1462: @end table
1463:
1.2 noro 1464: \JP @node lex_hensel lex_tl tolex tolex_d tolex_tl,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1465: \EG @node lex_hensel lex_tl tolex tolex_d tolex_tl,,, Functions for Groebner basis computation
1.1 noro 1466: @subsection @code{lex_hensel}, @code{lex_tl}, @code{tolex}, @code{tolex_d}, @code{tolex_tl}
1467: @findex lex_hensel
1468: @findex lex_tl
1469: @findex tolex
1470: @findex tolex_d
1471: @findex tolex_tl
1472:
1473: @table @t
1474: @item lex_hensel(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1475: @itemx lex_tl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1.2 noro 1476: \JP :: $B4pDlJQ49$K$h$k<-=q<0=g=x%0%l%V%J4pDl$N7W;;(B
1477: \EG:: Groebner basis computation with respect to a lex order by change of ordering
1.1 noro 1478: @item tolex(@var{plist},@var{vlist1},@var{order},@var{vlist2})
1479: @itemx tolex_d(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{procs})
1480: @itemx tolex_tl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1.2 noro 1481: \JP :: $B%0%l%V%J4pDl$rF~NO$H$9$k(B, $B4pDlJQ49$K$h$k<-=q<0=g=x%0%l%V%J4pDl$N7W;;(B
1482: \EG :: Groebner basis computation with respect to a lex order by change of ordering, starting from a Groebner basis
1.1 noro 1483: @end table
1484:
1485: @table @var
1486: @item return
1.2 noro 1487: \JP $B%j%9%H(B
1488: \EG list
1.4 noro 1489: @item plist vlist1 vlist2 procs
1.2 noro 1490: \JP $B%j%9%H(B
1491: \EG list
1.1 noro 1492: @item order
1.2 noro 1493: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
1494: \EG number, list or matrix
1.1 noro 1495: @item homo
1.2 noro 1496: \JP $B%U%i%0(B
1497: \EG flag
1.1 noro 1498: @end table
1499:
1500: @itemize @bullet
1.2 noro 1501: \BJP
1.1 noro 1502: @item
1503: $BI8=`%i%$%V%i%j$N(B @samp{gr} $B$GDj5A$5$l$F$$$k(B.
1504: @item
1505: @code{lex_hensel()}, @code{lex_tl()} $B$O(B,
1506: $BB?9`<0%j%9%H(B @var{plist} $B$N(B, $BJQ?t=g=x(B @var{vlist1}, $B9`=g=x7?(B
1507: @var{order} $B$K4X$9$k%0%l%V%J4pDl$r5a$a(B, $B$=$l$r(B, $BJQ?t=g=x(B @var{vlist2}
1508: $B$N<-=q<0=g=x%0%l%V%J4pDl$KJQ49$9$k(B.
1509: @item
1510: @code{tolex()}, @code{tolex_tl()} $B$O(B,
1511: $BJQ?t=g=x(B @var{vlist1}, $B9`=g=x7?(B @var{order} $B$K4X$9$k%0%l%V%J4pDl$G$"$k(B
1512: $BB?9`<0%j%9%H(B @var{plist} $B$rJQ?t=g=x(B @var{vlist2} $B$N<-=q<0=g=x%0%l%V%J(B
1513: $B4pDl$KJQ49$9$k(B.
1514: @code{tolex_d()} $B$O(B, @code{tolex()} $B$K$*$1$k(B, $B3F4pDl$N7W;;$r(B, $B;R%W%m%;%9(B
1515: $B%j%9%H(B @var{procs} $B$N3F%W%m%;%9$KJ,;67W;;$5$;$k(B.
1516: @item
1517: @code{lex_hensel()}, @code{lex_tl()} $B$K$*$$$F$O(B, $B<-=q<0=g=x%0%l%V%J4pDl$N(B
1518: $B7W;;$O<!$N$h$&$K9T$o$l$k(B. (@code{[Noro,Yokoyama]} $B;2>H(B.)
1519: @enumerate
1520: @item
1521: @var{vlist1}, @var{order} $B$K4X$9$k%0%l%V%J4pDl(B @var{G0} $B$r7W;;$9$k(B.
1522: (@code{lex_hensel()} $B$N$_(B. )
1523: @item
1524: @var{G0} $B$N3F85$N(B @var{vlist2} $B$K4X$9$k<-=q<0=g=x$K$*$1$kF,78?t$r3d$i$J$$(B
1525: $B$h$&$JAG?t(B @var{p} $B$rA*$S(B, GF(@var{p}) $B>e$G$N<-=q<0=g=x%0%l%V%J4pDl(B
1526: @var{Gp} $B$r7W;;$9$k(B.
1527: @item
1528: @var{Gp} $B$K8=$l$k$9$Y$F$N9`$N(B, @var{G0} $B$K4X$9$k@55,7A(B @var{NF} $B$r7W;;$9$k(B.
1529: @item
1530: @var{Gp} $B$N3F85(B @var{f} $B$K$D$-(B, @var{f} $B$N78?t$rL$Dj78?t$G(B,
1531: @var{f} $B$N3F9`$rBP1~$9$k(B @var{NF} $B$N85$GCV$-49$((B, $B3F9`$N78?t$r(B 0 $B$HCV$$$?(B,
1532: $BL$Dj78?t$K4X$9$k@~7AJ}Dx<07O(B @var{Lf} $B$r:n$k(B.
1533: @item
1534: @var{Lf} $B$,(B, $BK!(B @var{p} $B$G0l0U2r$r;}$D$3$H$rMQ$$$F(B @var{Lf} $B$N2r$r(B
1535: $BK!(B @var{p}$B$N2r$+$i(B Hensel $B9=@.$K$h$j5a$a$k(B.
1536: @item
1537: $B$9$Y$F$N(B @var{Gp} $B$N85$K$D$-@~7AJ}Dx<0$,2r$1$?$i$=$N2rA4BN$,5a$a$k(B
1538: $B<-=q<0=g=x$G$N%0%l%V%J4pDl(B. $B$b$7$I$l$+$N@~7AJ}Dx<0$N5a2r$K<:GT$7$?$i(B,
1539: @var{p} $B$r$H$jD>$7$F$d$jD>$9(B.
1540: @end enumerate
1541:
1542: @item
1543: @code{lex_tl()}, @code{tolex_tl()} $B$K$*$$$F$O(B, $B<-=q<0=g=x%0%l%V%J4pDl$N(B
1544: $B7W;;$O<!$N$h$&$K9T$o$l$k(B.
1545:
1546: @enumerate
1547: @item
1548: @var{vlist1}, @var{order} $B$K4X$9$k%0%l%V%J4pDl(B @var{G0} $B$r7W;;$9$k(B.
1549: (@code{lex_hensel()} $B$N$_(B. )
1550: @item
1551: @var{G0} $B$,(B 0 $B<!85%7%9%F%`$G$J$$$H$-(B, @var{G0} $B$rF~NO$H$7$F(B,
1552: @var{G0} $B$N3F85$N(B @var{vlist2} $B$K4X$9$k<-=q<0=g=x$K$*$1$kF,78?t$r3d$i$J$$(B
1553: $B$h$&$JAG?t(B @var{p} $B$rA*$S(B, @var{p} $B$rMQ$$$?(B trace-lifting $B$K$h$j<-=q<0(B
1554: $B=g=x$N%0%l%V%J4pDl8uJd$r5a$a(B, $B$b$75a$^$C$?$J$i%A%'%C%/$J$7$K$=$l$,5a$a$k(B
1555: $B%0%l%V%J4pDl$H$J$k(B. $B$b$7<:GT$7$?$i(B, @var{p} $B$r$H$jD>$7$F$d$jD>$9(B.
1556: @item
1557: @var{G0} $B$,(B 0 $B<!85%7%9%F%`$N$H$-(B, @var{G0} $B$rF~NO$H$7$F(B,
1558: $B$^$:(B, @var{vlist2} $B$N:G8e$NJQ?t0J30$r>C5n$9$k>C5n=g=x$K$h$j(B
1559: $B%0%l%V%J4pDl(B @var{G1} $B$r7W;;$7(B, $B$=$l$+$i<-=q<0=g=x$N%0%l%V%J4pDl$r(B
1560: $B7W;;$9$k(B. $B$=$N:](B, $B3F%9%F%C%W$G$O(B, $BF~NO$N3F85$N(B, $B5a$a$k=g=x$K$*$1$k(B
1561: $BF,78?t$r3d$i$J$$AG?t$rMQ$$$?(B trace-lifting $B$G%0%l%V%J4pDl8uJd$r5a$a(B,
1562: $B$b$75a$^$C$?$i%A%'%C%/$J$7$K$=$l$,$=$N=g=x$G$N%0%l%V%J4pDl$H$J$k(B.
1563: @end enumerate
1564:
1565: @item
1566: $BM-M}<078?t$N7W;;$O(B, @code{lex_tl()}, @code{tolex_tl()} $B$N$_<u$1IU$1$k(B.
1567: @item
1568: @code{homo} $B$,(B 0 $B$G$J$$>l9g(B, $BFbIt$G5/F0$5$l$k(B Buchberger $B%"%k%4%j%:%`$K(B
1569: $B$*$$$F(B, $B@F<!2=$,9T$o$l$k(B.
1570: @item
1571: @code{tolex_d()} $B$GI=<($5$l$k;~4V$O(B, $B$3$NH!?t$,<B9T$5$l$F$$$k%W%m%;%9$K(B
1572: $B$*$$$F9T$o$l$?7W;;$KBP1~$7$F$$$F(B, $B;R%W%m%;%9$K$*$1$k;~4V$O4^$^$l$J$$(B.
1.2 noro 1573: \E
1574: \BEG
1575: @item
1576: These functions are defined in @samp{gr} in the standard library
1577: directory.
1578: @item
1579: @code{lex_hensel()} and @code{lex_tl()} first compute a Groebner basis
1580: with respect to the variable order @var{vlist1} and the order type @var{order}.
1581: Then the Groebner basis is converted into a lex order Groebner basis
1582: with respect to the varable order @var{vlist2}.
1583: @item
1584: @code{tolex()} and @code{tolex_tl()} convert a Groebner basis @var{plist}
1585: with respect to the variable order @var{vlist1} and the order type @var{order}
1586: into a lex order Groebner basis
1587: with respect to the varable order @var{vlist2}.
1588: @code{tolex_d()} does computations of basis elements in @code{tolex()}
1589: in parallel on the processes in a child process list @var{procs}.
1590: @item
1591: In @code{lex_hensel()} and @code{tolex_hensel()} a lex order Groebner basis
1592: is computed as follows.(Refer to @code{[Noro,Yokoyama]}.)
1593: @enumerate
1594: @item
1595: Compute a Groebner basis @var{G0} with respect to @var{vlist1} and @var{order}.
1596: (Only in @code{lex_hensel()}. )
1597: @item
1598: Choose a prime which does not divide head coefficients of elements in @var{G0}
1599: with respect to @var{vlist1} and @var{order}. Then compute a lex order
1600: Groebner basis @var{Gp} over GF(@var{p}) with respect to @var{vlist2}.
1601: @item
1602: Compute @var{NF}, the set of all the normal forms with respect to
1603: @var{G0} of terms appearing in @var{Gp}.
1604: @item
1605: For each element @var{f} in @var{Gp}, replace coefficients and terms in @var{f}
1606: with undetermined coefficients and the corresponding polynomials in @var{NF}
1607: respectively, and generate a system of liear equation @var{Lf} by equating
1608: the coefficients of terms in the replaced polynomial with 0.
1609: @item
1610: Solve @var{Lf} by Hensel lifting, starting from the unique mod @var{p}
1611: solution.
1612: @item
1613: If all the linear equations generated from the elements in @var{Gp}
1614: could be solved, then the set of solutions corresponds to a lex order
1615: Groebner basis. Otherwise redo the whole process with another @var{p}.
1616: @end enumerate
1617:
1618: @item
1619: In @code{lex_tl()} and @code{tolex_tl()} a lex order Groebner basis
1620: is computed as follows.(Refer to @code{[Noro,Yokoyama]}.)
1621:
1622: @enumerate
1623: @item
1624: Compute a Groebner basis @var{G0} with respect to @var{vlist1} and @var{order}.
1625: (Only in @code{lex_tl()}. )
1626: @item
1627: If @var{G0} is not zero-dimensional, choose a prime which does not divide
1628: head coefficients of elements in @var{G0} with respect to @var{vlist1} and
1629: @var{order}. Then compute a candidate of a lex order Groebner basis
1630: via trace lifting with @var{p}. If it succeeds the candidate is indeed
1631: a lex order Groebner basis without any check. Otherwise redo the whole
1632: process with another @var{p}.
1633: @item
1634:
1635: If @var{G0} is zero-dimensional, starting from @var{G0},
1636: compute a Groebner basis @var{G1} with respect to an elimination order
1637: to eliminate variables other than the last varibale in @var{vlist2}.
1638: Then compute a lex order Groebner basis stating from @var{G1}. These
1639: computations are done by trace lifting and the selection of a mudulus
1640: @var{p} is the same as in non zero-dimensional cases.
1641: @end enumerate
1642:
1643: @item
1644: Computations with rational function coefficients can be done only by
1645: @code{lex_tl()} and @code{tolex_tl()}.
1646: @item
1647: If @code{homo} is not equal to 0, homogenization is used in Buchberger
1648: algorithm.
1649: @item
1650: The CPU time shown after an execution of @code{tolex_d()} indicates
1651: that of the master process, and it does not include the time in child
1652: processes.
1653: \E
1.1 noro 1654: @end itemize
1655:
1656: @example
1657: [78] K=katsura(5)$
1658: 30msec + gc : 20msec
1659: [79] V=[u5,u4,u3,u2,u1,u0]$
1660: 0msec
1661: [80] G0=hgr(K,V,2)$
1662: 91.558sec + gc : 15.583sec
1663: [81] G1=lex_hensel(K,V,0,V,0)$
1664: 49.049sec + gc : 9.961sec
1665: [82] G2=lex_tl(K,V,0,V,1)$
1666: 31.186sec + gc : 3.500sec
1667: [83] gb_comp(G0,G1);
1668: 1
1669: 10msec
1670: [84] gb_comp(G0,G2);
1671: 1
1672: @end example
1673:
1674: @table @t
1.2 noro 1675: \JP @item $B;2>H(B
1676: \EG @item References
1.6 noro 1677: @fref{dp_gr_main dp_gr_mod_main dp_gr_f_main dp_weyl_gr_main dp_weyl_gr_mod_main dp_weyl_gr_f_main},
1.2 noro 1678: \JP @fref{dp_ord}, @fref{$BJ,;67W;;(B}
1679: \EG @fref{dp_ord}, @fref{Distributed computation}
1.1 noro 1680: @end table
1681:
1.2 noro 1682: \JP @node lex_hensel_gsl tolex_gsl tolex_gsl_d,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1683: \EG @node lex_hensel_gsl tolex_gsl tolex_gsl_d,,, Functions for Groebner basis computation
1.1 noro 1684: @subsection @code{lex_hensel_gsl}, @code{tolex_gsl}, @code{tolex_gsl_d}
1685: @findex lex_hensel_gsl
1686: @findex tolex_gsl
1687: @findex tolex_gsl_d
1688:
1689: @table @t
1690: @item lex_hensel_gsl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1.2 noro 1691: \JP :: GSL $B7A<0$N%$%G%"%k4pDl$N7W;;(B
1692: \EG ::Computation of an GSL form ideal basis
1.1 noro 1693: @item tolex_gsl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1694: @itemx tolex_gsl_d(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo},@var{procs})
1.2 noro 1695: \JP :: $B%0%l%V%J4pDl$rF~NO$H$9$k(B, GSL $B7A<0$N%$%G%"%k4pDl$N7W;;(B
1696: \EG :: Computation of an GSL form ideal basis stating from a Groebner basis
1.1 noro 1697: @end table
1698:
1699: @table @var
1700: @item return
1.2 noro 1701: \JP $B%j%9%H(B
1702: \EG list
1.4 noro 1703: @item plist vlist1 vlist2 procs
1.2 noro 1704: \JP $B%j%9%H(B
1705: \EG list
1.1 noro 1706: @item order
1.2 noro 1707: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
1708: \EG number, list or matrix
1.1 noro 1709: @item homo
1.2 noro 1710: \JP $B%U%i%0(B
1711: \EG flag
1.1 noro 1712: @end table
1713:
1714: @itemize @bullet
1.2 noro 1715: \BJP
1.1 noro 1716: @item
1717: @code{lex_hensel_gsl()} $B$O(B @code{lex_hensel()} $B$N(B, @code{tolex_gsl()} $B$O(B
1718: @code{tolex()} $B$NJQ<o$G(B, $B7k2L$N$_$,0[$J$k(B.
1719: @code{tolex_gsl_d()} $B$O(B, $B4pDl7W;;$r(B, @code{procs} $B$G;XDj$5$l$k;R%W%m%;%9$K(B
1720: $BJ,;67W;;$5$;$k(B.
1721: @item
1722: $BF~NO$,(B 0 $B<!85%7%9%F%`$G(B, $B$=$N<-=q<0=g=x%0%l%V%J4pDl$,(B
1723: @code{[f0,x1-f1,...,xn-fn]} (@code{f0},...,@code{fn} $B$O(B
1724: @code{x0} $B$N(B 1 $BJQ?tB?9`<0(B) $B$J$k7A(B ($B$3$l$r(B SL $B7A<0$H8F$V(B) $B$r;}$D>l9g(B,
1725: @code{[[x1,g1,d1],...,[xn,gn,dn],[x0,f0,f0']]} $B$J$k%j%9%H(B ($B$3$l$r(B GSL $B7A<0$H8F$V(B)
1726: $B$rJV$9(B.
1.2 noro 1727: $B$3$3$G(B, @code{gi} $B$O(B, @code{di*f0'*fi-gi} $B$,(B @code{f0} $B$G3d$j@Z$l$k$h$&$J(B
1.1 noro 1728: @code{x0} $B$N(B1 $BJQ?tB?9`<0$G(B,
1729: $B2r$O(B @code{f0(x0)=0} $B$J$k(B @code{x0} $B$KBP$7(B, @code{[x1=g1/(d1*f0'),...,xn=gn/(dn*f0')]}
1730: $B$H$J$k(B. $B<-=q<0=g=x%0%l%V%J4pDl$,>e$N$h$&$J7A$G$J$$>l9g(B, @code{tolex()} $B$K(B
1731: $B$h$kDL>o$N%0%l%V%J4pDl$rJV$9(B.
1732: @item
1733: GSL $B7A<0$K$h$jI=$5$l$k4pDl$O%0%l%V%J4pDl$G$O$J$$$,(B, $B0lHL$K78?t$,(B SL $B7A<0(B
1734: $B$N%0%l%V%J4pDl$h$jHs>o$K>.$5$$$?$a7W;;$bB.$/(B, $B2r$b5a$a$d$9$$(B.
1735: @code{tolex_gsl_d()} $B$GI=<($5$l$k;~4V$O(B, $B$3$NH!?t$,<B9T$5$l$F$$$k%W%m%;%9$K(B
1736: $B$*$$$F9T$o$l$?7W;;$KBP1~$7$F$$$F(B, $B;R%W%m%;%9$K$*$1$k;~4V$O4^$^$l$J$$(B.
1.2 noro 1737: \E
1738: \BEG
1739: @item
1740: @code{lex_hensel_gsl()} and @code{lex_hensel()} are variants of
1741: @code{tolex_gsl()} and @code{tolex()} respectively. The results are
1742: Groebner basis or a kind of ideal basis, called GSL form.
1743: @code{tolex_gsl_d()} does basis computations in parallel on child
1744: processes specified in @code{procs}.
1745:
1746: @item
1747: If the input is zero-dimensional and a lex order Groebner basis has
1748: the form @code{[f0,x1-f1,...,xn-fn]} (@code{f0},...,@code{fn} are
1749: univariate polynomials of @code{x0}; SL form), then this these
1750: functions return a list such as
1751: @code{[[x1,g1,d1],...,[xn,gn,dn],[x0,f0,f0']]} (GSL form). In this list
1752: @code{gi} is a univariate polynomial of @code{x0} such that
1753: @code{di*f0'*fi-gi} divides @code{f0} and the roots of the input ideal is
1754: @code{[x1=g1/(d1*f0'),...,xn=gn/(dn*f0')]} for @code{x0}
1755: such that @code{f0(x0)=0}.
1756: If the lex order Groebner basis does not have the above form,
1757: these functions return
1758: a lex order Groebner basis computed by @code{tolex()}.
1759: @item
1760: Though an ideal basis represented as GSL form is not a Groebner basis
1761: we can expect that the coefficients are much smaller than those in a Groebner
1762: basis and that the computation is efficient.
1763: The CPU time shown after an execution of @code{tolex_gsl_d()} indicates
1764: that of the master process, and it does not include the time in child
1765: processes.
1766: \E
1.1 noro 1767: @end itemize
1768:
1769: @example
1770: [103] K=katsura(5)$
1771: [104] V=[u5,u4,u3,u2,u1,u0]$
1772: [105] G0=gr(K,V,0)$
1773: [106] GSL=tolex_gsl(G0,V,0,V)$
1774: [107] GSL[0];
1775: [u1,8635837421130477667200000000*u0^31-...]
1776: [108] GSL[1];
1777: [u2,10352277157007342793600000000*u0^31-...]
1778: [109] GSL[5];
1.5 noro 1779: [u0,11771021876193064124640000000*u0^32-...,
1780: 376672700038178051988480000000*u0^31-...]
1.1 noro 1781: @end example
1782:
1783: @table @t
1.2 noro 1784: \JP @item $B;2>H(B
1785: \EG @item References
1.1 noro 1786: @fref{lex_hensel lex_tl tolex tolex_d tolex_tl},
1.2 noro 1787: \JP @fref{$BJ,;67W;;(B}
1788: \EG @fref{Distributed computation}
1.1 noro 1789: @end table
1790:
1.2 noro 1791: \JP @node gr_minipoly minipoly,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1792: \EG @node gr_minipoly minipoly,,, Functions for Groebner basis computation
1.1 noro 1793: @subsection @code{gr_minipoly}, @code{minipoly}
1794: @findex gr_minipoly
1795: @findex minipoly
1796:
1797: @table @t
1798: @item gr_minipoly(@var{plist},@var{vlist},@var{order},@var{poly},@var{v},@var{homo})
1.2 noro 1799: \JP :: $BB?9`<0$N(B, $B%$%G%"%k$rK!$H$7$?:G>.B?9`<0$N7W;;(B
1800: \EG :: Computation of the minimal polynomial of a polynomial modulo an ideal
1.1 noro 1801: @item minipoly(@var{plist},@var{vlist},@var{order},@var{poly},@var{v})
1.2 noro 1802: \JP :: $B%0%l%V%J4pDl$rF~NO$H$9$k(B, $BB?9`<0$N:G>.B?9`<0$N7W;;(B
1803: \EG :: Computation of the minimal polynomial of a polynomial modulo an ideal
1.1 noro 1804: @end table
1805:
1806: @table @var
1807: @item return
1.2 noro 1808: \JP $BB?9`<0(B
1809: \EG polynomial
1.4 noro 1810: @item plist vlist
1.2 noro 1811: \JP $B%j%9%H(B
1812: \EG list
1.1 noro 1813: @item order
1.2 noro 1814: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
1815: \EG number, list or matrix
1.1 noro 1816: @item poly
1.2 noro 1817: \JP $BB?9`<0(B
1818: \EG polynomial
1.1 noro 1819: @item v
1.2 noro 1820: \JP $BITDj85(B
1821: \EG indeterminate
1.1 noro 1822: @item homo
1.2 noro 1823: \JP $B%U%i%0(B
1824: \EG flag
1.1 noro 1825: @end table
1826:
1827: @itemize @bullet
1.2 noro 1828: \BJP
1.1 noro 1829: @item
1830: @code{gr_minipoly()} $B$O%0%l%V%J4pDl$N7W;;$+$i9T$$(B, @code{minipoly()} $B$O(B
1831: $BF~NO$r%0%l%V%J4pDl$H$_$J$9(B.
1832: @item
1833: $B%$%G%"%k(B I $B$,BN(B K $B>e$NB?9`<04D(B K[X] $B$N(B 0 $B<!85%$%G%"%k$N;~(B,
1834: K[@var{v}] $B$N85(B f(@var{v}) $B$K(B f(@var{p}) mod I $B$rBP1~$5$;$k(B
1835: $B4D=`F17?$N3K$O(B 0 $B$G$J$$B?9`<0$K$h$j@8@.$5$l$k(B. $B$3$N@8@.85$r(B @var{p}
1836: $B$N(B, $BK!(B @var{I} $B$G$N:G>.B?9`<0$H8F$V(B.
1837: @item
1838: @code{gr_minipoly()}, @code{minipoly()} $B$O(B, $BB?9`<0(B @var{p} $B$N:G>.B?9`<0(B
1839: $B$r5a$a(B, @var{v} $B$rJQ?t$H$9$kB?9`<0$H$7$FJV$9(B.
1840: @item
1841: $B:G>.B?9`<0$O(B, $B%0%l%V%J4pDl$N(B 1 $B$D$N85$H$7$F7W;;$9$k$3$H$b$G$-$k$,(B,
1842: $B:G>.B?9`<0$N$_$r5a$a$?$$>l9g(B, @code{minipoly()}, @code{gr_minipoly()} $B$O(B
1843: $B%0%l%V%J4pDl$rMQ$$$kJ}K!$KHf$Y$F8zN($,$h$$(B.
1844: @item
1845: @code{gr_minipoly()} $B$K;XDj$9$k9`=g=x$H$7$F$O(B, $BDL>oA4<!?t5U<-=q<0=g=x$r(B
1846: $BMQ$$$k(B.
1.2 noro 1847: \E
1848: \BEG
1849: @item
1850: @code{gr_minipoly()} begins by computing a Groebner basis.
1851: @code{minipoly()} regards an input as a Groebner basis with respect to
1852: the variable order @var{vlist} and the order type @var{order}.
1853: @item
1854: Let K be a field. If an ideal @var{I} in K[X] is zero-dimensional, then, for
1855: a polynomial @var{p} in K[X], the kernel of a homomorphism from
1856: K[@var{v}] to K[X]/@var{I} which maps f(@var{v}) to f(@var{p}) mod @var{I}
1857: is generated by a polynomial. The generator is called the minimal polynomial
1858: of @var{p} modulo @var{I}.
1859: @item
1860: @code{gr_minipoly()} and @code{minipoly()} computes the minimal polynomial
1861: of a polynomial @var{p} and returns it as a polynomial of @var{v}.
1862: @item
1863: The minimal polynomial can be computed as an element of a Groebner basis.
1864: But if we are only interested in the minimal polynomial,
1865: @code{minipoly()} and @code{gr_minipoly()} can compute it more efficiently
1866: than methods using Groebner basis computation.
1867: @item
1868: It is recommended to use a degree reverse lex order as a term order
1869: for @code{gr_minipoly()}.
1870: \E
1.1 noro 1871: @end itemize
1872:
1873: @example
1874: [117] G=tolex(G0,V,0,V)$
1875: 43.818sec + gc : 11.202sec
1876: [118] GSL=tolex_gsl(G0,V,0,V)$
1877: 17.123sec + gc : 2.590sec
1878: [119] MP=minipoly(G0,V,0,u0,z)$
1879: 4.370sec + gc : 780msec
1880: @end example
1881:
1882: @table @t
1.2 noro 1883: \JP @item $B;2>H(B
1884: \EG @item References
1.1 noro 1885: @fref{lex_hensel lex_tl tolex tolex_d tolex_tl}.
1886: @end table
1887:
1.2 noro 1888: \JP @node tolexm minipolym,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1889: \EG @node tolexm minipolym,,, Functions for Groebner basis computation
1.1 noro 1890: @subsection @code{tolexm}, @code{minipolym}
1891: @findex tolexm
1892: @findex minipolym
1893:
1894: @table @t
1895: @item tolexm(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{mod})
1.2 noro 1896: \JP :: $BK!(B @var{mod} $B$G$N4pDlJQ49$K$h$k%0%l%V%J4pDl7W;;(B
1897: \EG :: Groebner basis computation modulo @var{mod} by change of ordering.
1.1 noro 1898: @item minipolym(@var{plist},@var{vlist1},@var{order},@var{poly},@var{v},@var{mod})
1.2 noro 1899: \JP :: $BK!(B @var{mod} $B$G$N%0%l%V%J4pDl$K$h$kB?9`<0$N:G>.B?9`<0$N7W;;(B
1900: \EG :: Minimal polynomial computation modulo @var{mod} the same method as
1.1 noro 1901: @end table
1902:
1903: @table @var
1904: @item return
1.2 noro 1905: \JP @code{tolexm()} : $B%j%9%H(B, @code{minipolym()} : $BB?9`<0(B
1906: \EG @code{tolexm()} : list, @code{minipolym()} : polynomial
1.4 noro 1907: @item plist vlist1 vlist2
1.2 noro 1908: \JP $B%j%9%H(B
1909: \EG list
1.1 noro 1910: @item order
1.2 noro 1911: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
1912: \EG number, list or matrix
1.1 noro 1913: @item mod
1.2 noro 1914: \JP $BAG?t(B
1915: \EG prime
1.1 noro 1916: @end table
1917:
1918: @itemize @bullet
1.2 noro 1919: \BJP
1.1 noro 1920: @item
1921: $BF~NO(B @var{plist} $B$O$$$:$l$b(B $BJQ?t=g=x(B @var{vlist1}, $B9`=g=x7?(B @var{order},
1922: $BK!(B @var{mod} $B$K$*$1$k%0%l%V%J4pDl$G$J$1$l$P$J$i$J$$(B.
1923: @item
1924: @code{minipolym()} $B$O(B @code{minipoly} $B$KBP1~$9$k7W;;$rK!(B @var{mod}$B$G9T$&(B.
1925: @item
1926: @code{tolexm()} $B$O(B FGLM $BK!$K$h$k4pDlJQ49$K$h$j(B @var{vlist2},
1927: $B<-=q<0=g=x$K$h$k%0%l%V%J4pDl$r7W;;$9$k(B.
1.2 noro 1928: \E
1929: \BEG
1930: @item
1931: An input @var{plist} must be a Groebner basis modulo @var{mod}
1932: with respect to the variable order @var{vlist1} and the order type @var{order}.
1933: @item
1934: @code{minipolym()} executes the same computation as in @code{minipoly}.
1935: @item
1936: @code{tolexm()} computes a lex order Groebner basis modulo @var{mod}
1937: with respect to the variable order @var{vlist2}, by using FGLM algorithm.
1938: \E
1.1 noro 1939: @end itemize
1940:
1941: @example
1942: [197] tolexm(G0,V,0,V,31991);
1943: [8271*u0^31+10435*u0^30+816*u0^29+26809*u0^28+...,...]
1944: [198] minipolym(G0,V,0,u0,z,31991);
1945: z^32+11405*z^31+20868*z^30+21602*z^29+...
1946: @end example
1947:
1948: @table @t
1.2 noro 1949: \JP @item $B;2>H(B
1950: \EG @item References
1.1 noro 1951: @fref{lex_hensel lex_tl tolex tolex_d tolex_tl},
1952: @fref{gr_minipoly minipoly}.
1953: @end table
1954:
1.6 noro 1955: \JP @node dp_gr_main dp_gr_mod_main dp_gr_f_main dp_weyl_gr_main dp_weyl_gr_mod_main dp_weyl_gr_f_main,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1956: \EG @node dp_gr_main dp_gr_mod_main dp_gr_f_main dp_weyl_gr_main dp_weyl_gr_mod_main dp_weyl_gr_f_main,,, Functions for Groebner basis computation
1957: @subsection @code{dp_gr_main}, @code{dp_gr_mod_main}, @code{dp_gr_f_main}, @code{dp_weyl_gr_main}, @code{dp_weyl_gr_mod_main}, @code{dp_weyl_gr_f_main}
1.1 noro 1958: @findex dp_gr_main
1959: @findex dp_gr_mod_main
1.5 noro 1960: @findex dp_gr_f_main
1.6 noro 1961: @findex dp_weyl_gr_main
1962: @findex dp_weyl_gr_mod_main
1963: @findex dp_weyl_gr_f_main
1.1 noro 1964:
1965: @table @t
1966: @item dp_gr_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order})
1967: @itemx dp_gr_mod_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order})
1.5 noro 1968: @itemx dp_gr_f_main(@var{plist},@var{vlist},@var{homo},@var{order})
1.6 noro 1969: @itemx dp_weyl_gr_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order})
1970: @itemx dp_weyl_gr_mod_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order})
1971: @itemx dp_weyl_gr_f_main(@var{plist},@var{vlist},@var{homo},@var{order})
1.2 noro 1972: \JP :: $B%0%l%V%J4pDl$N7W;;(B ($BAH$_9~$_H!?t(B)
1973: \EG :: Groebner basis computation (built-in functions)
1.1 noro 1974: @end table
1975:
1976: @table @var
1977: @item return
1.2 noro 1978: \JP $B%j%9%H(B
1979: \EG list
1.4 noro 1980: @item plist vlist
1.2 noro 1981: \JP $B%j%9%H(B
1982: \EG list
1.1 noro 1983: @item order
1.2 noro 1984: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
1985: \EG number, list or matrix
1.1 noro 1986: @item homo
1.2 noro 1987: \JP $B%U%i%0(B
1988: \EG flag
1.1 noro 1989: @item modular
1.2 noro 1990: \JP $B%U%i%0$^$?$OAG?t(B
1991: \EG flag or prime
1.1 noro 1992: @end table
1993:
1994: @itemize @bullet
1.2 noro 1995: \BJP
1.1 noro 1996: @item
1997: $B$3$l$i$NH!?t$O(B, $B%0%l%V%J4pDl7W;;$N4pK\E*AH$_9~$_H!?t$G$"$j(B, @code{gr()},
1998: @code{hgr()}, @code{gr_mod()} $B$J$I$O$9$Y$F$3$l$i$NH!?t$r8F$S=P$7$F7W;;(B
1.6 noro 1999: $B$r9T$C$F$$$k(B. $B4X?tL>$K(B weyl $B$,F~$C$F$$$k$b$N$O(B, Weyl $BBe?t>e$N7W;;(B
2000: $B$N$?$a$N4X?t$G$"$k(B.
1.1 noro 2001: @item
1.6 noro 2002: @code{dp_gr_f_main()}, @code{dp_weyl_f_main()} $B$O(B, $B<o!9$NM-8BBN>e$N%0%l%V%J4pDl$r7W;;$9$k(B
1.5 noro 2003: $B>l9g$KMQ$$$k(B. $BF~NO$O(B, $B$"$i$+$8$a(B, @code{simp_ff()} $B$J$I$G(B,
2004: $B9M$($kM-8BBN>e$K<M1F$5$l$F$$$kI,MW$,$"$k(B.
2005: @item
1.1 noro 2006: $B%U%i%0(B @var{homo} $B$,(B 0 $B$G$J$$;~(B, $BF~NO$r@F<!2=$7$F$+$i(B Buchberger $B%"%k%4%j%:%`(B
2007: $B$r<B9T$9$k(B.
2008: @item
2009: @code{dp_gr_mod_main()} $B$KBP$7$F$O(B, @var{modular} $B$O(B, GF(@var{modular}) $B>e(B
2010: $B$G$N7W;;$r0UL#$9$k(B.
2011: @code{dp_gr_main()} $B$KBP$7$F$O(B, @var{modular} $B$O<!$N$h$&$J0UL#$r;}$D(B.
2012: @enumerate
2013: @item
2014: @var{modular} $B$,(B 1 $B$N;~(B, trace-lifting $B$K$h$k7W;;$r9T$&(B. $BAG?t$O(B
2015: @code{lprime(0)} $B$+$i=g$K@.8y$9$k$^$G(B @code{lprime()} $B$r8F$S=P$7$F@8@.$9$k(B.
2016: @item
2017: @var{modular} $B$,(B 2 $B0J>e$N<+A3?t$N;~(B, $B$=$NCM$rAG?t$H$_$J$7$F(B trace-lifting
2018: $B$r9T$&(B. $B$=$NAG?t$G<:GT$7$?>l9g(B, 0 $B$rJV$9(B.
2019: @item
2020: @var{modular} $B$,Ii$N>l9g(B,
2021: @var{-modular} $B$KBP$7$F>e=R$N5,B'$,E,MQ$5$l$k$,(B, trace-lifting $B$N:G=*(B
2022: $BCJ3,$N%0%l%V%J4pDl%A%'%C%/$H%$%G%"%k%a%s%P%7%C%W%A%'%C%/$,>JN,$5$l$k(B.
2023: @end enumerate
2024:
2025: @item
2026: @code{gr(P,V,O)} $B$O(B @code{dp_gr_main(P,V,0,1,O)}, @code{hgr(P,V,O)} $B$O(B
2027: @code{dp_gr_main(P,V,1,1,O)}, @code{gr_mod(P,V,O,M)} $B$O(B
2028: @code{dp_gr_mod_main(P,V,0,M,O)} $B$r$=$l$>$l<B9T$9$k(B.
2029: @item
2030: @var{homo}, @var{modular} $B$NB>$K(B, @code{dp_gr_flags()} $B$G@_Dj$5$l$k(B
2031: $B$5$^$6$^$J%U%i%0$K$h$j7W;;$,@)8f$5$l$k(B.
1.2 noro 2032: \E
2033: \BEG
2034: @item
2035: These functions are fundamental built-in functions for Groebner basis
2036: computation and @code{gr()},@code{hgr()} and @code{gr_mod()}
1.6 noro 2037: are all interfaces to these functions. Functions whose names
2038: contain weyl are those for computation in Weyl algebra.
1.2 noro 2039: @item
1.6 noro 2040: @code{dp_gr_f_main()} and @code{dp_weyl_gr_f_main()}
2041: are functions for Groebner basis computation
1.5 noro 2042: over various finite fields. Coefficients of input polynomials
2043: must be converted to elements of a finite field
2044: currently specified by @code{setmod_ff()}.
2045: @item
1.2 noro 2046: If @var{homo} is not equal to 0, homogenization is applied before entering
2047: Buchberger algorithm
2048: @item
2049: For @code{dp_gr_mod_main()}, @var{modular} means a computation over
2050: GF(@var{modular}).
2051: For @code{dp_gr_main()}, @var{modular} has the following mean.
2052: @enumerate
2053: @item
2054: If @var{modular} is 1 , trace lifting is used. Primes for trace lifting
2055: are generated by @code{lprime()}, starting from @code{lprime(0)}, until
2056: the computation succeeds.
2057: @item
2058: If @var{modular} is an integer greater than 1, the integer is regarded as a
2059: prime and trace lifting is executed by using the prime. If the computation
2060: fails then 0 is returned.
2061: @item
2062: If @var{modular} is negative, the above rule is applied for @var{-modular}
2063: but the Groebner basis check and ideal-membership check are omitted in
2064: the last stage of trace lifting.
2065: @end enumerate
2066:
2067: @item
2068: @code{gr(P,V,O)}, @code{hgr(P,V,O)} and @code{gr_mod(P,V,O,M)} execute
2069: @code{dp_gr_main(P,V,0,1,O)}, @code{dp_gr_main(P,V,1,1,O)}
2070: and @code{dp_gr_mod_main(P,V,0,M,O)} respectively.
2071: @item
2072: Actual computation is controlled by various parameters set by
2073: @code{dp_gr_flags()}, other then by @var{homo} and @var{modular}.
2074: \E
1.1 noro 2075: @end itemize
2076:
2077: @table @t
1.2 noro 2078: \JP @item $B;2>H(B
2079: \EG @item References
1.1 noro 2080: @fref{dp_ord},
2081: @fref{dp_gr_flags dp_gr_print},
2082: @fref{gr hgr gr_mod},
1.5 noro 2083: @fref{setmod_ff},
1.2 noro 2084: \JP @fref{$B7W;;$*$h$SI=<($N@)8f(B}.
2085: \EG @fref{Controlling Groebner basis computations}
1.1 noro 2086: @end table
2087:
1.6 noro 2088: \JP @node dp_f4_main dp_f4_mod_main dp_weyl_f4_main dp_weyl_f4_mod_main,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2089: \EG @node dp_f4_main dp_f4_mod_main dp_weyl_f4_main dp_weyl_f4_mod_main,,, Functions for Groebner basis computation
2090: @subsection @code{dp_f4_main}, @code{dp_f4_mod_main}, @code{dp_weyl_f4_main}, @code{dp_weyl_f4_mod_main}
1.1 noro 2091: @findex dp_f4_main
2092: @findex dp_f4_mod_main
1.6 noro 2093: @findex dp_weyl_f4_main
2094: @findex dp_weyl_f4_mod_main
1.1 noro 2095:
2096: @table @t
2097: @item dp_f4_main(@var{plist},@var{vlist},@var{order})
2098: @itemx dp_f4_mod_main(@var{plist},@var{vlist},@var{order})
1.6 noro 2099: @itemx dp_weyl_f4_main(@var{plist},@var{vlist},@var{order})
2100: @itemx dp_weyl_f4_mod_main(@var{plist},@var{vlist},@var{order})
1.2 noro 2101: \JP :: F4 $B%"%k%4%j%:%`$K$h$k%0%l%V%J4pDl$N7W;;(B ($BAH$_9~$_H!?t(B)
2102: \EG :: Groebner basis computation by F4 algorithm (built-in functions)
1.1 noro 2103: @end table
2104:
2105: @table @var
2106: @item return
1.2 noro 2107: \JP $B%j%9%H(B
2108: \EG list
1.4 noro 2109: @item plist vlist
1.2 noro 2110: \JP $B%j%9%H(B
2111: \EG list
1.1 noro 2112: @item order
1.2 noro 2113: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
2114: \EG number, list or matrix
1.1 noro 2115: @end table
2116:
2117: @itemize @bullet
1.2 noro 2118: \BJP
1.1 noro 2119: @item
2120: F4 $B%"%k%4%j%:%`$K$h$j%0%l%V%J4pDl$N7W;;$r9T$&(B.
2121: @item
2122: F4 $B%"%k%4%j%:%`$O(B, J.C. Faugere $B$K$h$jDs>'$5$l$??7@$Be%0%l%V%J4pDl(B
2123: $B;;K!$G$"$j(B, $BK\<BAu$O(B, $BCf9q>jM>DjM}$K$h$k@~7AJ}Dx<05a2r$rMQ$$$?(B
2124: $B;n83E*$J<BAu$G$"$k(B.
2125: @item
1.6 noro 2126: $B@F<!2=$N0z?t$,$J$$$3$H$r=|$1$P(B, $B0z?t$*$h$SF0:n$O$=$l$>$l(B
2127: @code{dp_gr_main()}, @code{dp_gr_mod_main()},
2128: @code{dp_weyl_gr_main()}, @code{dp_weyl_gr_mod_main()}
1.1 noro 2129: $B$HF1MM$G$"$k(B.
1.2 noro 2130: \E
2131: \BEG
2132: @item
2133: These functions compute Groebner bases by F4 algorithm.
2134: @item
2135: F4 is a new generation algorithm for Groebner basis computation
2136: invented by J.C. Faugere. The current implementation of @code{dp_f4_main()}
2137: uses Chinese Remainder theorem and not highly optimized.
2138: @item
2139: Arguments and actions are the same as those of
1.6 noro 2140: @code{dp_gr_main()}, @code{dp_gr_mod_main()},
2141: @code{dp_weyl_gr_main()}, @code{dp_weyl_gr_mod_main()},
2142: except for lack of the argument for controlling homogenization.
1.2 noro 2143: \E
1.1 noro 2144: @end itemize
2145:
2146: @table @t
1.2 noro 2147: \JP @item $B;2>H(B
2148: \EG @item References
1.1 noro 2149: @fref{dp_ord},
2150: @fref{dp_gr_flags dp_gr_print},
2151: @fref{gr hgr gr_mod},
1.2 noro 2152: \JP @fref{$B7W;;$*$h$SI=<($N@)8f(B}.
2153: \EG @fref{Controlling Groebner basis computations}
1.1 noro 2154: @end table
2155:
1.2 noro 2156: \JP @node dp_gr_flags dp_gr_print,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2157: \EG @node dp_gr_flags dp_gr_print,,, Functions for Groebner basis computation
1.1 noro 2158: @subsection @code{dp_gr_flags}, @code{dp_gr_print}
2159: @findex dp_gr_flags
2160: @findex dp_gr_print
2161:
2162: @table @t
2163: @item dp_gr_flags([@var{list}])
1.7 ! noro 2164: @itemx dp_gr_print([@var{i}])
1.2 noro 2165: \JP :: $B7W;;$*$h$SI=<(MQ%Q%i%a%?$N@_Dj(B, $B;2>H(B
2166: \BEG :: Set and show various parameters for cotrolling computations
2167: and showing informations.
2168: \E
1.1 noro 2169: @end table
2170:
2171: @table @var
2172: @item return
1.2 noro 2173: \JP $B@_DjCM(B
2174: \EG value currently set
1.1 noro 2175: @item list
1.2 noro 2176: \JP $B%j%9%H(B
2177: \EG list
1.7 ! noro 2178: @item i
! 2179: \JP $B@0?t(B
! 2180: \EG integer
1.1 noro 2181: @end table
2182:
2183: @itemize @bullet
1.2 noro 2184: \BJP
1.1 noro 2185: @item
1.5 noro 2186: @code{dp_gr_main()}, @code{dp_gr_mod_main()}, @code{dp_gr_f_main()} $B<B9T;~$K$*$1$k$5$^$6$^(B
1.1 noro 2187: $B$J%Q%i%a%?$r@_Dj(B, $B;2>H$9$k(B.
2188: @item
2189: $B0z?t$,$J$$>l9g(B, $B8=:_$N@_Dj$,JV$5$l$k(B.
2190: @item
2191: $B0z?t$O(B, @code{["Print",1,"NoSugar",1,...]} $B$J$k7A$N%j%9%H$G(B, $B:8$+$i=g$K(B
2192: $B@_Dj$5$l$k(B. $B%Q%i%a%?L>$OJ8;zNs$GM?$($kI,MW$,$"$k(B.
2193: @item
1.7 ! noro 2194: @code{dp_gr_print()} $B$O(B, $BFC$K%Q%i%a%?(B @code{Print}, @code{PrintShort} $B$NCM$rD>@\@_Dj(B, $B;2>H(B
! 2195: $B$G$-$k(B. $B@_Dj$5$l$kCM$O<!$NDL$j$G$"$k!#(B
! 2196: @table @var
! 2197: @item i=0
! 2198: @code{Print=0}, @code{PrintShort=0}
! 2199: @item i=1
! 2200: @code{Print=1}, @code{PrintShort=0}
! 2201: @item i=2
! 2202: @code{Print=0}, @code{PrintShort=1}
! 2203: @end table
! 2204: $B$3$l$O(B, @code{dp_gr_main()} $B$J$I$r%5%V%k!<%A%s$H$7$FMQ$$$k%f!<%6(B
! 2205: $BH!?t$K$*$$$F(B, $B$=$N%5%V%k!<%A%s$,Cf4V>pJs$NI=<((B
1.1 noro 2206: $B$r9T$&:]$K(B, $B?WB.$K%U%i%0$r8+$k$3$H$,$G$-$k$h$&$KMQ0U$5$l$F$$$k(B.
1.2 noro 2207: \E
2208: \BEG
2209: @item
2210: @code{dp_gr_flags()} sets and shows various parameters for Groebner basis
2211: computation.
2212: @item
2213: If no argument is specified the current settings are returned.
2214: @item
2215: Arguments must be specified as a list such as
2216: @code{["Print",1,"NoSugar",1,...]}. Names of parameters must be character
2217: strings.
2218: @item
2219: @code{dp_gr_print()} is used to set and show the value of a parameter
1.7 ! noro 2220: @code{Print} and @code{PrintShort}.
! 2221: @table @var
! 2222: @item i=0
! 2223: @code{Print=0}, @code{PrintShort=0}
! 2224: @item i=1
! 2225: @code{Print=1}, @code{PrintShort=0}
! 2226: @item i=2
! 2227: @code{Print=0}, @code{PrintShort=1}
! 2228: @end table
! 2229: This functions is prepared to get quickly the value
! 2230: when a user defined function calling @code{dp_gr_main()} etc.
1.2 noro 2231: uses the value as a flag for showing intermediate informations.
2232: \E
1.1 noro 2233: @end itemize
2234:
2235: @table @t
1.2 noro 2236: \JP @item $B;2>H(B
2237: \EG @item References
2238: \JP @fref{$B7W;;$*$h$SI=<($N@)8f(B}
2239: \EG @fref{Controlling Groebner basis computations}
1.1 noro 2240: @end table
2241:
1.2 noro 2242: \JP @node dp_ord,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2243: \EG @node dp_ord,,, Functions for Groebner basis computation
1.1 noro 2244: @subsection @code{dp_ord}
2245: @findex dp_ord
2246:
2247: @table @t
2248: @item dp_ord([@var{order}])
1.2 noro 2249: \JP :: $BJQ?t=g=x7?$N@_Dj(B, $B;2>H(B
2250: \EG :: Set and show the ordering type.
1.1 noro 2251: @end table
2252:
2253: @table @var
2254: @item return
1.2 noro 2255: \JP $BJQ?t=g=x7?(B ($B?t(B, $B%j%9%H$^$?$O9TNs(B)
2256: \EG ordering type (number, list or matrix)
1.1 noro 2257: @item order
1.2 noro 2258: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
2259: \EG number, list or matrix
1.1 noro 2260: @end table
2261:
2262: @itemize @bullet
1.2 noro 2263: \BJP
1.1 noro 2264: @item
2265: $B0z?t$,$"$k;~(B, $BJQ?t=g=x7?$r(B @var{order} $B$K@_Dj$9$k(B. $B0z?t$,$J$$;~(B,
2266: $B8=:_@_Dj$5$l$F$$$kJQ?t=g=x7?$rJV$9(B.
2267:
2268: @item
2269: $BJ,;6I=8=B?9`<0$K4X$9$kH!?t(B, $B1i;;$O0z?t$H$7$FJQ?t=g=x7?$r$H$k$b$N$H$H$i$J$$$b$N(B
2270: $B$,$"$j(B, $B$H$i$J$$$b$N$K4X$7$F$O(B, $B$=$N;~E@$G@_Dj$5$l$F$$$kCM$rMQ$$$F7W;;$,(B
2271: $B9T$o$l$k(B.
2272:
2273: @item
2274: @code{gr()} $B$J$I(B, $B0z?t$H$7$FJQ?t=g=x7?$r$H$k$b$N$O(B, $BFbIt$G(B @code{dp_ord()}
2275: $B$r8F$S=P$7(B, $BJQ?t=g=x7?$r@_Dj$9$k(B. $B$3$N@_Dj$O(B, $B7W;;=*N;8e$b@8$-;D$k(B.
2276:
2277: @item
2278: $BJ,;6I=8=B?9`<0$N;MB'1i;;$b(B, $B@_Dj$5$l$F$$$kCM$rMQ$$$F7W;;$5$l$k(B. $B=>$C$F(B,
2279: $B$=$NB?9`<0$,@8@.$5$l$?;~E@$K$*$1$kJQ?t=g=x7?$,(B, $B;MB'1i;;;~$K@5$7$/@_Dj(B
2280: $B$5$l$F$$$J$1$l$P$J$i$J$$(B. $B$^$?(B, $B1i;;BP>]$H$J$kB?9`<0$O(B, $BF10l$NJQ?t=g=x(B
2281: $B7?$K4p$E$$$F@8@.$5$l$?$b$N$G$J$1$l$P$J$i$J$$(B.
2282:
2283: @item
2284: $B%H%C%W%l%Y%kH!?t0J30$NH!?t$rD>@\8F$S=P$9>l9g$K$O(B, $B$3$NH!?t$K$h$j(B
2285: $BJQ?t=g=x7?$r@5$7$/@_Dj$7$J$1$l$P$J$i$J$$(B.
1.2 noro 2286: \E
2287: \BEG
2288: @item
2289: If an argument is specified, the function
2290: sets the current ordering type to @var{order}.
2291: If no argument is specified, the function returns the ordering
2292: type currently set.
2293:
2294: @item
2295: There are two types of functions concerning distributed polynomial,
2296: functions which take a ordering type and those which don't take it.
2297: The latter ones use the current setting.
2298:
2299: @item
2300: Functions such as @code{gr()}, which need a ordering type as an argument,
2301: call @code{dp_ord()} internally during the execution.
2302: The setting remains after the execution.
2303:
2304: Fundamental arithmetics for distributed polynomial also use the current
2305: setting. Therefore, when such arithmetics for distributed polynomials
2306: are done, the current setting must coincide with the ordering type
2307: which was used upon the creation of the polynomials. It is assumed
2308: that such polynomials were generated under the same ordering type.
2309:
2310: @item
2311: Type of term ordering must be correctly set by this function
2312: when functions other than top level functions are called directly.
2313: \E
1.1 noro 2314: @end itemize
2315:
2316: @example
2317: [19] dp_ord(0)$
2318: [20] <<1,2,3>>+<<3,1,1>>;
2319: (1)*<<1,2,3>>+(1)*<<3,1,1>>
2320: [21] dp_ord(2)$
2321: [22] <<1,2,3>>+<<3,1,1>>;
2322: (1)*<<3,1,1>>+(1)*<<1,2,3>>
2323: @end example
2324:
2325: @table @t
1.2 noro 2326: \JP @item $B;2>H(B
2327: \EG @item References
2328: \JP @fref{$B9`=g=x$N@_Dj(B}
2329: \EG @fref{Setting term orderings}
1.1 noro 2330: @end table
2331:
1.2 noro 2332: \JP @node dp_ptod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2333: \EG @node dp_ptod,,, Functions for Groebner basis computation
1.1 noro 2334: @subsection @code{dp_ptod}
2335: @findex dp_ptod
2336:
2337: @table @t
2338: @item dp_ptod(@var{poly},@var{vlist})
1.2 noro 2339: \JP :: $BB?9`<0$rJ,;6I=8=B?9`<0$KJQ49$9$k(B.
2340: \EG :: Converts an ordinary polynomial into a distributed polynomial.
1.1 noro 2341: @end table
2342:
2343: @table @var
2344: @item return
1.2 noro 2345: \JP $BJ,;6I=8=B?9`<0(B
2346: \EG distributed polynomial
1.1 noro 2347: @item poly
1.2 noro 2348: \JP $BB?9`<0(B
2349: \EG polynomial
1.1 noro 2350: @item vlist
1.2 noro 2351: \JP $B%j%9%H(B
2352: \EG list
1.1 noro 2353: @end table
2354:
2355: @itemize @bullet
1.2 noro 2356: \BJP
1.1 noro 2357: @item
2358: $BJQ?t=g=x(B @var{vlist} $B$*$h$S8=:_$NJQ?t=g=x7?$K=>$C$FJ,;6I=8=B?9`<0$KJQ49$9$k(B.
2359: @item
2360: @var{vlist} $B$K4^$^$l$J$$ITDj85$O(B, $B78?tBN$KB0$9$k$H$7$FJQ49$5$l$k(B.
1.2 noro 2361: \E
2362: \BEG
2363: @item
2364: According to the variable ordering @var{vlist} and current
2365: type of term ordering, this function converts an ordinary
2366: polynomial into a distributed polynomial.
2367: @item
2368: Indeterminates not included in @var{vlist} are regarded to belong to
2369: the coefficient field.
2370: \E
1.1 noro 2371: @end itemize
2372:
2373: @example
2374: [50] dp_ord(0);
2375: 1
2376: [51] dp_ptod((x+y+z)^2,[x,y,z]);
2377: (1)*<<2,0,0>>+(2)*<<1,1,0>>+(1)*<<0,2,0>>+(2)*<<1,0,1>>+(2)*<<0,1,1>>
2378: +(1)*<<0,0,2>>
2379: [52] dp_ptod((x+y+z)^2,[x,y]);
1.5 noro 2380: (1)*<<2,0>>+(2)*<<1,1>>+(1)*<<0,2>>+(2*z)*<<1,0>>+(2*z)*<<0,1>>
2381: +(z^2)*<<0,0>>
1.1 noro 2382: @end example
2383:
2384: @table @t
1.2 noro 2385: \JP @item $B;2>H(B
2386: \EG @item References
1.1 noro 2387: @fref{dp_dtop},
2388: @fref{dp_ord}.
2389: @end table
2390:
1.2 noro 2391: \JP @node dp_dtop,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2392: \EG @node dp_dtop,,, Functions for Groebner basis computation
1.1 noro 2393: @subsection @code{dp_dtop}
2394: @findex dp_dtop
2395:
2396: @table @t
2397: @item dp_dtop(@var{dpoly},@var{vlist})
1.2 noro 2398: \JP :: $BJ,;6I=8=B?9`<0$rB?9`<0$KJQ49$9$k(B.
2399: \EG :: Converts a distributed polynomial into an ordinary polynomial.
1.1 noro 2400: @end table
2401:
2402: @table @var
2403: @item return
1.2 noro 2404: \JP $BB?9`<0(B
2405: \EG polynomial
1.1 noro 2406: @item dpoly
1.2 noro 2407: \JP $BJ,;6I=8=B?9`<0(B
2408: \EG distributed polynomial
1.1 noro 2409: @item vlist
1.2 noro 2410: \JP $B%j%9%H(B
2411: \EG list
1.1 noro 2412: @end table
2413:
2414: @itemize @bullet
1.2 noro 2415: \BJP
1.1 noro 2416: @item
2417: $BJ,;6I=8=B?9`<0$r(B, $BM?$($i$l$?ITDj85%j%9%H$rMQ$$$FB?9`<0$KJQ49$9$k(B.
2418: @item
2419: $BITDj85%j%9%H$O(B, $BD9$5J,;6I=8=B?9`<0$NJQ?t$N8D?t$H0lCW$7$F$$$l$P2?$G$b$h$$(B.
1.2 noro 2420: \E
2421: \BEG
2422: @item
2423: This function converts a distributed polynomial into an ordinary polynomial
2424: according to a list of indeterminates @var{vlist}.
2425: @item
2426: @var{vlist} is such a list that its length coincides with the number of
2427: variables of @var{dpoly}.
2428: \E
1.1 noro 2429: @end itemize
2430:
2431: @example
2432: [53] T=dp_ptod((x+y+z)^2,[x,y]);
1.5 noro 2433: (1)*<<2,0>>+(2)*<<1,1>>+(1)*<<0,2>>+(2*z)*<<1,0>>+(2*z)*<<0,1>>
2434: +(z^2)*<<0,0>>
1.1 noro 2435: [54] P=dp_dtop(T,[a,b]);
2436: z^2+(2*a+2*b)*z+a^2+2*b*a+b^2
2437: @end example
2438:
1.2 noro 2439: \JP @node dp_mod dp_rat,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2440: \EG @node dp_mod dp_rat,,, Functions for Groebner basis computation
1.1 noro 2441: @subsection @code{dp_mod}, @code{dp_rat}
2442: @findex dp_mod
2443: @findex dp_rat
2444:
2445: @table @t
2446: @item dp_mod(@var{p},@var{mod},@var{subst})
1.2 noro 2447: \JP :: $BM-M}?t78?tJ,;6I=8=B?9`<0$NM-8BBN78?t$X$NJQ49(B
2448: \EG :: Converts a disributed polynomial into one with coefficients in a finite field.
1.1 noro 2449: @item dp_rat(@var{p})
1.2 noro 2450: \JP :: $BM-8BBN78?tJ,;6I=8=B?9`<0$NM-M}?t78?t$X$NJQ49(B
2451: \BEG
2452: :: Converts a distributed polynomial with coefficients in a finite field into
2453: one with coefficients in the rationals.
2454: \E
1.1 noro 2455: @end table
2456:
2457: @table @var
2458: @item return
1.2 noro 2459: \JP $BJ,;6I=8=B?9`<0(B
2460: \EG distributed polynomial
1.1 noro 2461: @item p
1.2 noro 2462: \JP $BJ,;6I=8=B?9`<0(B
2463: \EG distributed polynomial
1.1 noro 2464: @item mod
1.2 noro 2465: \JP $BAG?t(B
2466: \EG prime
1.1 noro 2467: @item subst
1.2 noro 2468: \JP $B%j%9%H(B
2469: \EG list
1.1 noro 2470: @end table
2471:
2472: @itemize @bullet
1.2 noro 2473: \BJP
1.1 noro 2474: @item
2475: @code{dp_nf_mod()}, @code{dp_true_nf_mod()} $B$O(B, $BF~NO$H$7$FM-8BBN78?t$N(B
2476: $BJ,;6I=8=B?9`<0$rI,MW$H$9$k(B. $B$3$N$h$&$J>l9g(B, @code{dp_mod()} $B$K$h$j(B
2477: $BM-M}?t78?tJ,;6I=8=B?9`<0$rJQ49$7$FMQ$$$k$3$H$,$G$-$k(B. $B$^$?(B, $BF@$i$l$?(B
2478: $B7k2L$O(B, $BM-8BBN78?tB?9`<0$H$O1i;;$G$-$k$,(B, $BM-M}?t78?tB?9`<0$H$O1i;;$G$-$J$$(B
2479: $B$?$a(B, @code{dp_rat()} $B$K$h$jJQ49$9$kI,MW$,$"$k(B.
2480: @item
2481: $BM-8BBN78?t$N1i;;$K$*$$$F$O(B, $B$"$i$+$8$a(B @code{setmod()} $B$K$h$jM-8BBN$N85$N(B
2482: $B8D?t$r;XDj$7$F$*$/I,MW$,$"$k(B.
2483: @item
2484: @var{subst} $B$O(B, $B78?t$,M-M}<0$N>l9g(B, $B$=$NM-M}<0$NJQ?t$K$"$i$+$8$a?t$rBeF~(B
2485: $B$7$?8eM-8BBN78?t$KJQ49$9$k$H$$$&A`:n$r9T$&:]$N(B, $BBeF~CM$r;XDj$9$k$b$N$G(B,
2486: @code{[[@var{var},@var{value}],...]} $B$N7A$N%j%9%H$G$"$k(B.
1.2 noro 2487: \E
2488: \BEG
2489: @item
2490: @code{dp_nf_mod()} and @code{dp_true_nf_mod()} require
2491: distributed polynomials with coefficients in a finite field as arguments.
2492: @code{dp_mod()} is used to convert distributed polynomials with rational
2493: number coefficients into appropriate ones.
2494: Polynomials with coefficients in a finite field
2495: cannot be used as inputs of operations with polynomials
2496: with rational number coefficients. @code{dp_rat()} is used for such cases.
2497: @item
2498: The ground finite field must be set in advance by using @code{setmod()}.
2499: @item
2500: @var{subst} is such a list as @code{[[@var{var},@var{value}],...]}.
2501: This is valid when the ground field of the input polynomial is a
2502: rational function field. @var{var}'s are variables in the ground field and
2503: the list means that @var{value} is substituted for @var{var} before
2504: converting the coefficients into elements of a finite field.
2505: \E
1.1 noro 2506: @end itemize
2507:
2508: @example
2509: @end example
2510:
2511: @table @t
1.2 noro 2512: \JP @item $B;2>H(B
2513: \EG @item References
1.1 noro 2514: @fref{dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod},
2515: @fref{subst psubst},
2516: @fref{setmod}.
2517: @end table
2518:
1.2 noro 2519: \JP @node dp_homo dp_dehomo,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2520: \EG @node dp_homo dp_dehomo,,, Functions for Groebner basis computation
1.1 noro 2521: @subsection @code{dp_homo}, @code{dp_dehomo}
2522: @findex dp_homo
2523: @findex dp_dehomo
2524:
2525: @table @t
2526: @item dp_homo(@var{dpoly})
1.2 noro 2527: \JP :: $BJ,;6I=8=B?9`<0$N@F<!2=(B
2528: \EG :: Homogenize a distributed polynomial
1.1 noro 2529: @item dp_dehomo(@var{dpoly})
1.2 noro 2530: \JP :: $B@F<!J,;6I=8=B?9`<0$NHs@F<!2=(B
2531: \EG :: Dehomogenize a homogenious distributed polynomial
1.1 noro 2532: @end table
2533:
2534: @table @var
2535: @item return
1.2 noro 2536: \JP $BJ,;6I=8=B?9`<0(B
2537: \EG distributed polynomial
1.1 noro 2538: @item dpoly
1.2 noro 2539: \JP $BJ,;6I=8=B?9`<0(B
2540: \EG distributed polynomial
1.1 noro 2541: @end table
2542:
2543: @itemize @bullet
1.2 noro 2544: \BJP
1.1 noro 2545: @item
2546: @code{dp_homo()} $B$O(B, @var{dpoly} $B$N(B $B3F9`(B @var{t} $B$K$D$$$F(B, $B;X?t%Y%/%H%k$ND9$5$r(B
2547: 1 $B?-$P$7(B, $B:G8e$N@.J,$NCM$r(B @var{d}-@code{deg(@var{t})}
2548: (@var{d} $B$O(B @var{dpoly} $B$NA4<!?t(B) $B$H$7$?J,;6I=8=B?9`<0$rJV$9(B.
2549: @item
2550: @code{dp_dehomo()} $B$O(B, @var{dpoly} $B$N3F9`$K$D$$$F(B, $B;X?t%Y%/%H%k$N:G8e$N@.J,(B
2551: $B$r<h$j=|$$$?J,;6B?9`<0$rJV$9(B.
2552: @item
2553: $B$$$:$l$b(B, $B@8@.$5$l$?B?9`<0$rMQ$$$?1i;;$r9T$&>l9g(B, $B$=$l$i$KE,9g$9$k9`=g=x$r(B
2554: $B@5$7$/@_Dj$9$kI,MW$,$"$k(B.
2555: @item
2556: @code{hgr()} $B$J$I$K$*$$$F(B, $BFbItE*$KMQ$$$i$l$F$$$k(B.
1.2 noro 2557: \E
2558: \BEG
2559: @item
2560: @code{dp_homo()} makes a copy of @var{dpoly}, extends
2561: the length of the exponent vector of each term @var{t} in the copy by 1,
2562: and sets the value of the newly appended
2563: component to @var{d}-@code{deg(@var{t})}, where @var{d} is the total
2564: degree of @var{dpoly}.
2565: @item
2566: @code{dp_dehomo()} make a copy of @var{dpoly} and removes the last component
2567: of each terms in the copy.
2568: @item
2569: Appropriate term orderings must be set when the results are used as inputs
2570: of some operations.
2571: @item
2572: These are used internally in @code{hgr()} etc.
2573: \E
1.1 noro 2574: @end itemize
2575:
2576: @example
2577: [202] X=<<1,2,3>>+3*<<1,2,1>>;
2578: (1)*<<1,2,3>>+(3)*<<1,2,1>>
2579: [203] dp_homo(X);
2580: (1)*<<1,2,3,0>>+(3)*<<1,2,1,2>>
2581: [204] dp_dehomo(@@);
2582: (1)*<<1,2,3>>+(3)*<<1,2,1>>
2583: @end example
2584:
2585: @table @t
1.2 noro 2586: \JP @item $B;2>H(B
2587: \EG @item References
1.1 noro 2588: @fref{gr hgr gr_mod}.
2589: @end table
2590:
1.2 noro 2591: \JP @node dp_ptozp dp_prim,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2592: \EG @node dp_ptozp dp_prim,,, Functions for Groebner basis computation
1.1 noro 2593: @subsection @code{dp_ptozp}, @code{dp_prim}
2594: @findex dp_ptozp
2595: @findex dp_prim
2596:
2597: @table @t
2598: @item dp_ptozp(@var{dpoly})
1.2 noro 2599: \JP :: $BDj?tG\$7$F78?t$r@0?t78?t$+$D78?t$N@0?t(B GCD $B$r(B 1 $B$K$9$k(B.
2600: \BEG
2601: :: Converts a distributed polynomial @var{poly} with rational coefficients
2602: into an integral distributed polynomial such that GCD of all its coefficients
2603: is 1.
2604: \E
1.1 noro 2605: @itemx dp_prim(@var{dpoly})
1.2 noro 2606: \JP :: $BM-M}<0G\$7$F78?t$r@0?t78?tB?9`<078?t$+$D78?t$NB?9`<0(B GCD $B$r(B 1 $B$K$9$k(B.
2607: \BEG
2608: :: Converts a distributed polynomial @var{poly} with rational function
2609: coefficients into an integral distributed polynomial such that polynomial
2610: GCD of all its coefficients is 1.
2611: \E
1.1 noro 2612: @end table
2613:
2614: @table @var
2615: @item return
1.2 noro 2616: \JP $BJ,;6I=8=B?9`<0(B
2617: \EG distributed polynomial
1.1 noro 2618: @item dpoly
1.2 noro 2619: \JP $BJ,;6I=8=B?9`<0(B
2620: \EG distributed polynomial
1.1 noro 2621: @end table
2622:
2623: @itemize @bullet
1.2 noro 2624: \BJP
1.1 noro 2625: @item
2626: @code{dp_ptozp()} $B$O(B, @code{ptozp()} $B$KAjEv$9$kA`:n$rJ,;6I=8=B?9`<0$K(B
2627: $BBP$7$F9T$&(B. $B78?t$,B?9`<0$r4^$`>l9g(B, $B78?t$K4^$^$l$kB?9`<06&DL0x;R$O(B
2628: $B<h$j=|$+$J$$(B.
2629: @item
2630: @code{dp_prim()} $B$O(B, $B78?t$,B?9`<0$r4^$`>l9g(B, $B78?t$K4^$^$l$kB?9`<06&DL0x;R(B
2631: $B$r<h$j=|$/(B.
1.2 noro 2632: \E
2633: \BEG
2634: @item
2635: @code{dp_ptozp()} executes the same operation as @code{ptozp()} for
2636: a distributed polynomial. If the coefficients include polynomials,
2637: polynomial contents included in the coefficients are not removed.
2638: @item
2639: @code{dp_prim()} removes polynomial contents.
2640: \E
1.1 noro 2641: @end itemize
2642:
2643: @example
2644: [208] X=dp_ptod(3*(x-y)*(y-z)*(z-x),[x]);
2645: (-3*y+3*z)*<<2>>+(3*y^2-3*z^2)*<<1>>+(-3*z*y^2+3*z^2*y)*<<0>>
2646: [209] dp_ptozp(X);
2647: (-y+z)*<<2>>+(y^2-z^2)*<<1>>+(-z*y^2+z^2*y)*<<0>>
2648: [210] dp_prim(X);
2649: (1)*<<2>>+(-y-z)*<<1>>+(z*y)*<<0>>
2650: @end example
2651:
2652: @table @t
1.2 noro 2653: \JP @item $B;2>H(B
2654: \EG @item References
1.1 noro 2655: @fref{ptozp}.
2656: @end table
2657:
1.2 noro 2658: \JP @node dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2659: \EG @node dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod,,, Functions for Groebner basis computation
1.1 noro 2660: @subsection @code{dp_nf}, @code{dp_nf_mod}, @code{dp_true_nf}, @code{dp_true_nf_mod}
2661: @findex dp_nf
2662: @findex dp_true_nf
2663: @findex dp_nf_mod
2664: @findex dp_true_nf_mod
2665:
2666: @table @t
2667: @item dp_nf(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce})
2668: @item dp_nf_mod(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce},@var{mod})
1.2 noro 2669: \JP :: $BJ,;6I=8=B?9`<0$N@55,7A$r5a$a$k(B. ($B7k2L$ODj?tG\$5$l$F$$$k2DG=@-$"$j(B)
1.1 noro 2670:
1.2 noro 2671: \BEG
2672: :: Computes the normal form of a distributed polynomial.
2673: (The result may be multiplied by a constant in the ground field.)
2674: \E
1.1 noro 2675: @item dp_true_nf(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce})
2676: @item dp_true_nf_mod(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce},@var{mod})
1.2 noro 2677: \JP :: $BJ,;6I=8=B?9`<0$N@55,7A$r5a$a$k(B. ($B??$N7k2L$r(B @code{[$BJ,;R(B, $BJ,Jl(B]} $B$N7A$GJV$9(B)
2678: \BEG
2679: :: Computes the normal form of a distributed polynomial. (The true result
2680: is returned in such a list as @code{[numerator, denominator]})
2681: \E
1.1 noro 2682: @end table
2683:
2684: @table @var
2685: @item return
1.2 noro 2686: \JP @code{dp_nf()} : $BJ,;6I=8=B?9`<0(B, @code{dp_true_nf()} : $B%j%9%H(B
2687: \EG @code{dp_nf()} : distributed polynomial, @code{dp_true_nf()} : list
1.1 noro 2688: @item indexlist
1.2 noro 2689: \JP $B%j%9%H(B
2690: \EG list
1.1 noro 2691: @item dpoly
1.2 noro 2692: \JP $BJ,;6I=8=B?9`<0(B
2693: \EG distributed polynomial
1.1 noro 2694: @item dpolyarray
1.2 noro 2695: \JP $BG[Ns(B
2696: \EG array of distributed polynomial
1.1 noro 2697: @item fullreduce
1.2 noro 2698: \JP $B%U%i%0(B
2699: \EG flag
1.1 noro 2700: @item mod
1.2 noro 2701: \JP $BAG?t(B
2702: \EG prime
1.1 noro 2703: @end table
2704:
2705: @itemize @bullet
1.2 noro 2706: \BJP
1.1 noro 2707: @item
2708: $BJ,;6I=8=B?9`<0(B @var{dpoly} $B$N@55,7A$r5a$a$k(B.
2709: @item
2710: @code{dp_nf_mod()}, @code{dp_true_nf_mod()} $B$NF~NO$O(B, @code{dp_mod()} $B$J$I(B
2711: $B$K$h$j(B, $BM-8BBN>e$NJ,;6I=8=B?9`<0$K$J$C$F$$$J$1$l$P$J$i$J$$(B.
2712: @item
2713: $B7k2L$KM-M}?t(B, $BM-M}<0$,4^$^$l$k$N$rHr$1$k$?$a(B, @code{dp_nf()} $B$O(B
2714: $B??$NCM$NDj?tG\$NCM$rJV$9(B. $BM-M}<078?t$N>l9g$N(B @code{dp_nf_mod()} $B$bF1MM(B
2715: $B$G$"$k$,(B, $B78?tBN$,M-8BBN$N>l9g(B @code{dp_nf_mod()} $B$O??$NCM$rJV$9(B.
2716: @item
2717: @code{dp_true_nf()}, @code{dp_true_nf_mod()} $B$O(B,
2718: @code{[@var{nm},@var{dn}]} $B$J$k7A$N%j%9%H$rJV$9(B.
2719: $B$?$@$7(B, @var{nm} $B$O78?t$KJ,?t(B, $BM-M}<0$r4^$^$J$$J,;6I=8=B?9`<0(B, @var{dn} $B$O(B
2720: $B?t$^$?$OB?9`<0$G(B @var{nm}/@var{dn} $B$,??$NCM$H$J$k(B.
2721: @item
2722: @var{dpolyarray} $B$OJ,;6I=8=B?9`<0$rMWAG$H$9$k%Y%/%H%k(B,
2723: @var{indexlist} $B$O@55,2=7W;;$KMQ$$$k(B @var{dpolyarray} $B$NMWAG$N%$%s%G%C%/%9(B
2724: $B$N%j%9%H(B.
2725: @item
2726: @var{fullreduce} $B$,(B 0 $B$G$J$$$H$-A4$F$N9`$KBP$7$F4JLs$r9T$&(B. @var{fullreduce}
2727: $B$,(B 0 $B$N$H$-F,9`$N$_$KBP$7$F4JLs$r9T$&(B.
2728: @item
2729: @var{indexlist} $B$G;XDj$5$l$?B?9`<0$O(B, $BA0$NJ}$N$b$N$,M%@hE*$K;H$o$l$k(B.
2730: @item
2731: $B0lHL$K$O(B @var{indexlist} $B$NM?$(J}$K$h$jH!?t$NCM$O0[$J$k2DG=@-$,$"$k$,(B,
2732: $B%0%l%V%J4pDl$KBP$7$F$O0l0UE*$KDj$^$k(B.
2733: @item
2734: $BJ,;6I=8=$G$J$$8GDj$5$l$?B?9`<0=89g$K$h$k@55,7A$rB??t5a$a$kI,MW$,$"$k>l9g(B
2735: $B$KJXMx$G$"$k(B. $BC10l$N1i;;$K4X$7$F$O(B, @code{p_nf}, @code{p_true_nf} $B$r(B
2736: $BMQ$$$k$H$h$$(B.
1.2 noro 2737: \E
2738: \BEG
2739: @item
2740: Computes the normal form of a distributed polynomial.
2741: @item
2742: @code{dp_nf_mod()} and @code{dp_true_nf_mod()} require
2743: distributed polynomials with coefficients in a finite field as arguments.
2744: @item
2745: The result of @code{dp_nf()} may be multiplied by a constant in the
2746: ground field in order to make the result integral. The same is true
2747: for @code{dp_nf_mod()}, but it returns the true normal form if
2748: the ground field is a finite field.
2749: @item
2750: @code{dp_true_nf()} and @code{dp_true_nf_mod()} return
2751: such a list as @code{[@var{nm},@var{dn}]}.
2752: Here @var{nm} is a distributed polynomial whose coefficients are integral
2753: in the ground field, @var{dn} is an integral element in the ground
2754: field and @var{nm}/@var{dn} is the true normal form.
2755: @item
2756: @var{dpolyarray} is a vector whose components are distributed polynomials
2757: and @var{indexlist} is a list of indices which is used for the normal form
2758: computation.
2759: @item
2760: When argument @var{fullreduce} has non-zero value,
2761: all terms are reduced. When it has value 0,
2762: only the head term is reduced.
2763: @item
2764: As for the polynomials specified by @var{indexlist}, one specified by
2765: an index placed at the preceding position has priority to be selected.
2766: @item
2767: In general, the result of the function may be different depending on
2768: @var{indexlist}. However, the result is unique for Groebner bases.
2769: @item
2770: These functions are useful when a fixed non-distributed polynomial set
2771: is used as a set of reducers to compute normal forms of many polynomials.
2772: For single computation @code{p_nf} and @code{p_true_nf} are sufficient.
2773: \E
1.1 noro 2774: @end itemize
2775:
2776: @example
2777: [0] load("gr")$
2778: [64] load("katsura")$
2779: [69] K=katsura(4)$
2780: [70] dp_ord(2)$
2781: [71] V=[u0,u1,u2,u3,u4]$
2782: [72] DP1=newvect(length(K),map(dp_ptod,K,V))$
2783: [73] G=gr(K,V,2)$
2784: [74] DP2=newvect(length(G),map(dp_ptod,G,V))$
2785: [75] T=dp_ptod((u0-u1+u2-u3+u4)^2,V)$
2786: [76] dp_dtop(dp_nf([0,1,2,3,4],T,DP1,1),V);
1.5 noro 2787: u4^2+(6*u3+2*u2+6*u1-2)*u4+9*u3^2+(6*u2+18*u1-6)*u3+u2^2
2788: +(6*u1-2)*u2+9*u1^2-6*u1+1
1.1 noro 2789: [77] dp_dtop(dp_nf([4,3,2,1,0],T,DP1,1),V);
2790: -5*u4^2+(-4*u3-4*u2-4*u1)*u4-u3^2-3*u3-u2^2+(2*u1-1)*u2-2*u1^2-3*u1+1
2791: [78] dp_dtop(dp_nf([0,1,2,3,4],T,DP2,1),V);
1.5 noro 2792: -11380879768451657780886122972730785203470970010204714556333530492210
2793: 456775930005716505560062087150928400876150217079820311439477560587583
2794: 488*u4^15+...
1.1 noro 2795: [79] dp_dtop(dp_nf([4,3,2,1,0],T,DP2,1),V);
1.5 noro 2796: -11380879768451657780886122972730785203470970010204714556333530492210
2797: 456775930005716505560062087150928400876150217079820311439477560587583
2798: 488*u4^15+...
1.1 noro 2799: [80] @@78==@@79;
2800: 1
2801: @end example
2802:
2803: @table @t
1.2 noro 2804: \JP @item $B;2>H(B
2805: \EG @item References
1.1 noro 2806: @fref{dp_dtop},
2807: @fref{dp_ord},
2808: @fref{dp_mod dp_rat},
2809: @fref{p_nf p_nf_mod p_true_nf p_true_nf_mod}.
2810: @end table
2811:
1.2 noro 2812: \JP @node dp_hm dp_ht dp_hc dp_rest,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2813: \EG @node dp_hm dp_ht dp_hc dp_rest,,, Functions for Groebner basis computation
1.1 noro 2814: @subsection @code{dp_hm}, @code{dp_ht}, @code{dp_hc}, @code{dp_rest}
2815: @findex dp_hm
2816: @findex dp_ht
2817: @findex dp_hc
2818: @findex dp_rest
2819:
2820: @table @t
2821: @item dp_hm(@var{dpoly})
1.2 noro 2822: \JP :: $BF,C19`<0$r<h$j=P$9(B.
2823: \EG :: Gets the head monomial.
1.1 noro 2824: @item dp_ht(@var{dpoly})
1.2 noro 2825: \JP :: $BF,9`$r<h$j=P$9(B.
2826: \EG :: Gets the head term.
1.1 noro 2827: @item dp_hc(@var{dpoly})
1.2 noro 2828: \JP :: $BF,78?t$r<h$j=P$9(B.
2829: \EG :: Gets the head coefficient.
1.1 noro 2830: @item dp_rest(@var{dpoly})
1.2 noro 2831: \JP :: $BF,C19`<0$r<h$j=|$$$?;D$j$rJV$9(B.
2832: \EG :: Gets the remainder of the polynomial where the head monomial is removed.
1.1 noro 2833: @end table
2834:
2835: @table @var
1.2 noro 2836: \BJP
1.1 noro 2837: @item return
2838: @code{dp_hm()}, @code{dp_ht()}, @code{dp_rest()} : $BJ,;6I=8=B?9`<0(B,
2839: @code{dp_hc()} : $B?t$^$?$OB?9`<0(B
2840: @item dpoly
2841: $BJ,;6I=8=B?9`<0(B
1.2 noro 2842: \E
2843: \BEG
2844: @item return
2845: @code{dp_hm()}, @code{dp_ht()}, @code{dp_rest()} : distributed polynomial
2846: @code{dp_hc()} : number or polynomial
2847: @item dpoly
2848: distributed polynomial
2849: \E
1.1 noro 2850: @end table
2851:
2852: @itemize @bullet
1.2 noro 2853: \BJP
1.1 noro 2854: @item
2855: $B$3$l$i$O(B, $BJ,;6I=8=B?9`<0$N3FItJ,$r<h$j=P$9$?$a$NH!?t$G$"$k(B.
2856: @item
2857: $BJ,;6I=8=B?9`<0(B @var{p} $B$KBP$7<!$,@.$jN)$D(B.
1.2 noro 2858: \E
2859: \BEG
2860: @item
2861: These are used to get various parts of a distributed polynomial.
2862: @item
2863: The next equations hold for a distributed polynomial @var{p}.
2864: \E
1.1 noro 2865: @table @code
2866: @item @var{p} = dp_hm(@var{p}) + dp_rest(@var{p})
2867: @item dp_hm(@var{p}) = dp_hc(@var{p}) dp_ht(@var{p})
2868: @end table
2869: @end itemize
2870:
2871: @example
2872: [87] dp_ord(0)$
2873: [88] X=ptozp((a46^2+7/10*a46+7/48)*u3^4-50/27*a46^2-35/27*a46-49/216)$
2874: [89] T=dp_ptod(X,[u3,u4,a46])$
2875: [90] dp_hm(T);
2876: (2160)*<<4,0,2>>
2877: [91] dp_ht(T);
2878: (1)*<<4,0,2>>
2879: [92] dp_hc(T);
2880: 2160
2881: [93] dp_rest(T);
2882: (1512)*<<4,0,1>>+(315)*<<4,0,0>>+(-4000)*<<0,0,2>>+(-2800)*<<0,0,1>>
2883: +(-490)*<<0,0,0>>
2884: @end example
2885:
1.2 noro 2886: \JP @node dp_td dp_sugar,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2887: \EG @node dp_td dp_sugar,,, Functions for Groebner basis computation
1.1 noro 2888: @subsection @code{dp_td}, @code{dp_sugar}
2889: @findex dp_td
2890: @findex dp_sugar
2891:
2892: @table @t
2893: @item dp_td(@var{dpoly})
1.2 noro 2894: \JP :: $BF,9`$NA4<!?t$rJV$9(B.
2895: \EG :: Gets the total degree of the head term.
1.1 noro 2896: @item dp_sugar(@var{dpoly})
1.2 noro 2897: \JP :: $BB?9`<0$N(B @code{sugar} $B$rJV$9(B.
2898: \EG :: Gets the @code{sugar} of a polynomial.
1.1 noro 2899: @end table
2900:
2901: @table @var
2902: @item return
1.2 noro 2903: \JP $B<+A3?t(B
2904: \EG non-negative integer
1.1 noro 2905: @item dpoly
1.2 noro 2906: \JP $BJ,;6I=8=B?9`<0(B
2907: \EG distributed polynomial
1.1 noro 2908: @item onoff
1.2 noro 2909: \JP $B%U%i%0(B
2910: \EG flag
1.1 noro 2911: @end table
2912:
2913: @itemize @bullet
1.2 noro 2914: \BJP
1.1 noro 2915: @item
2916: @code{dp_td()} $B$O(B, $BF,9`$NA4<!?t(B, $B$9$J$o$A3FJQ?t$N;X?t$NOB$rJV$9(B.
2917: @item
2918: $BJ,;6I=8=B?9`<0$,@8@.$5$l$k$H(B, @code{sugar} $B$H8F$P$l$k$"$k@0?t$,IUM?(B
2919: $B$5$l$k(B. $B$3$NCM$O(B $B2>A[E*$K@F<!2=$7$F7W;;$7$?>l9g$K7k2L$,;}$DA4<!?t$NCM$H$J$k(B.
2920: @item
2921: @code{sugar} $B$O(B, $B%0%l%V%J4pDl7W;;$K$*$1$k@55,2=BP$NA*Br$N%9%H%i%F%8$r(B
2922: $B7hDj$9$k$?$a$N=EMW$J;X?K$H$J$k(B.
1.2 noro 2923: \E
2924: \BEG
2925: @item
2926: Function @code{dp_td()} returns the total degree of the head term,
2927: i.e., the sum of all exponent of variables in that term.
2928: @item
2929: Upon creation of a distributed polynomial, an integer called @code{sugar}
2930: is associated. This value is
2931: the total degree of the virtually homogenized one of the original
2932: polynomial.
2933: @item
2934: The quantity @code{sugar} is an important guide to determine the
2935: selection strategy of critical pairs in Groebner basis computation.
2936: \E
1.1 noro 2937: @end itemize
2938:
2939: @example
2940: [74] dp_ord(0)$
2941: [75] X=<<1,2>>+<<0,1>>$
2942: [76] Y=<<1,2>>+<<1,0>>$
2943: [77] Z=X-Y;
2944: (-1)*<<1,0>>+(1)*<<0,1>>
2945: [78] dp_sugar(T);
2946: 3
2947: @end example
2948:
1.2 noro 2949: \JP @node dp_lcm,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2950: \EG @node dp_lcm,,, Functions for Groebner basis computation
1.1 noro 2951: @subsection @code{dp_lcm}
2952: @findex dp_lcm
2953:
2954: @table @t
2955: @item dp_lcm(@var{dpoly1},@var{dpoly2})
1.2 noro 2956: \JP :: $B:G>.8xG\9`$rJV$9(B.
2957: \EG :: Returns the least common multiple of the head terms of the given two polynomials.
1.1 noro 2958: @end table
2959:
2960: @table @var
2961: @item return
1.2 noro 2962: \JP $BJ,;6I=8=B?9`<0(B
2963: \EG distributed polynomial
1.4 noro 2964: @item dpoly1 dpoly2
1.2 noro 2965: \JP $BJ,;6I=8=B?9`<0(B
2966: \EG distributed polynomial
1.1 noro 2967: @end table
2968:
2969: @itemize @bullet
1.2 noro 2970: \BJP
1.1 noro 2971: @item
2972: $B$=$l$>$l$N0z?t$NF,9`$N:G>.8xG\9`$rJV$9(B. $B78?t$O(B 1 $B$G$"$k(B.
1.2 noro 2973: \E
2974: \BEG
2975: @item
2976: Returns the least common multiple of the head terms of the given
2977: two polynomials, where coefficient is always set to 1.
2978: \E
1.1 noro 2979: @end itemize
2980:
2981: @example
2982: [100] dp_lcm(<<1,2,3,4,5>>,<<5,4,3,2,1>>);
2983: (1)*<<5,4,3,4,5>>
2984: @end example
2985:
2986: @table @t
1.2 noro 2987: \JP @item $B;2>H(B
2988: \EG @item References
1.1 noro 2989: @fref{p_nf p_nf_mod p_true_nf p_true_nf_mod}.
2990: @end table
2991:
1.2 noro 2992: \JP @node dp_redble,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2993: \EG @node dp_redble,,, Functions for Groebner basis computation
1.1 noro 2994: @subsection @code{dp_redble}
2995: @findex dp_redble
2996:
2997: @table @t
2998: @item dp_redble(@var{dpoly1},@var{dpoly2})
1.2 noro 2999: \JP :: $BF,9`$I$&$7$,@0=|2DG=$+$I$&$+D4$Y$k(B.
3000: \EG :: Checks whether one head term is divisible by the other head term.
1.1 noro 3001: @end table
3002:
3003: @table @var
3004: @item return
1.2 noro 3005: \JP $B@0?t(B
3006: \EG integer
1.4 noro 3007: @item dpoly1 dpoly2
1.2 noro 3008: \JP $BJ,;6I=8=B?9`<0(B
3009: \EG distributed polynomial
1.1 noro 3010: @end table
3011:
3012: @itemize @bullet
1.2 noro 3013: \BJP
1.1 noro 3014: @item
3015: @var{dpoly1} $B$NF,9`$,(B @var{dpoly2} $B$NF,9`$G3d$j@Z$l$l$P(B 1, $B3d$j@Z$l$J$1$l$P(B
3016: 0 $B$rJV$9(B.
3017: @item
3018: $BB?9`<0$N4JLs$r9T$&:](B, $B$I$N9`$r4JLs$G$-$k$+$rC5$9$N$KMQ$$$k(B.
1.2 noro 3019: \E
3020: \BEG
3021: @item
3022: Returns 1 if the head term of @var{dpoly2} divides the head term of
3023: @var{dpoly1}; otherwise 0.
3024: @item
3025: Used for finding candidate terms at reduction of polynomials.
3026: \E
1.1 noro 3027: @end itemize
3028:
3029: @example
3030: [148] C;
3031: (1)*<<1,1,1,0,0>>+(1)*<<0,1,1,1,0>>+(1)*<<1,1,0,0,1>>+(1)*<<1,0,0,1,1>>
3032: [149] T;
3033: (3)*<<2,1,0,0,0>>+(3)*<<1,2,0,0,0>>+(1)*<<0,3,0,0,0>>+(6)*<<1,1,1,0,0>>
3034: [150] for ( ; T; T = dp_rest(T)) print(dp_redble(T,C));
3035: 0
3036: 0
3037: 0
3038: 1
3039: @end example
3040:
3041: @table @t
1.2 noro 3042: \JP @item $B;2>H(B
3043: \EG @item References
1.1 noro 3044: @fref{dp_red dp_red_mod}.
3045: @end table
3046:
1.2 noro 3047: \JP @node dp_subd,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3048: \EG @node dp_subd,,, Functions for Groebner basis computation
1.1 noro 3049: @subsection @code{dp_subd}
3050: @findex dp_subd
3051:
3052: @table @t
3053: @item dp_subd(@var{dpoly1},@var{dpoly2})
1.2 noro 3054: \JP :: $BF,9`$N>&C19`<0$rJV$9(B.
3055: \EG :: Returns the quotient monomial of the head terms.
1.1 noro 3056: @end table
3057:
3058: @table @var
3059: @item return
1.2 noro 3060: \JP $BJ,;6I=8=B?9`<0(B
3061: \EG distributed polynomial
1.4 noro 3062: @item dpoly1 dpoly2
1.2 noro 3063: \JP $BJ,;6I=8=B?9`<0(B
3064: \EG distributed polynomial
1.1 noro 3065: @end table
3066:
3067: @itemize @bullet
1.2 noro 3068: \BJP
1.1 noro 3069: @item
3070: @code{dp_ht(@var{dpoly1})/dp_ht(@var{dpoly2})} $B$r5a$a$k(B. $B7k2L$N78?t$O(B 1
3071: $B$G$"$k(B.
3072: @item
3073: $B3d$j@Z$l$k$3$H$,$"$i$+$8$a$o$+$C$F$$$kI,MW$,$"$k(B.
1.2 noro 3074: \E
3075: \BEG
3076: @item
3077: Gets @code{dp_ht(@var{dpoly1})/dp_ht(@var{dpoly2})}.
3078: The coefficient of the result is always set to 1.
3079: @item
3080: Divisibility assumed.
3081: \E
1.1 noro 3082: @end itemize
3083:
3084: @example
3085: [162] dp_subd(<<1,2,3,4,5>>,<<1,1,2,3,4>>);
3086: (1)*<<0,1,1,1,1>>
3087: @end example
3088:
3089: @table @t
1.2 noro 3090: \JP @item $B;2>H(B
3091: \EG @item References
1.1 noro 3092: @fref{dp_red dp_red_mod}.
3093: @end table
3094:
1.2 noro 3095: \JP @node dp_vtoe dp_etov,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3096: \EG @node dp_vtoe dp_etov,,, Functions for Groebner basis computation
1.1 noro 3097: @subsection @code{dp_vtoe}, @code{dp_etov}
3098: @findex dp_vtoe
3099: @findex dp_etov
3100:
3101: @table @t
3102: @item dp_vtoe(@var{vect})
1.2 noro 3103: \JP :: $B;X?t%Y%/%H%k$r9`$KJQ49(B
3104: \EG :: Converts an exponent vector into a term.
1.1 noro 3105: @item dp_etov(@var{dpoly})
1.2 noro 3106: \JP :: $BF,9`$r;X?t%Y%/%H%k$KJQ49(B
3107: \EG :: Convert the head term of a distributed polynomial into an exponent vector.
1.1 noro 3108: @end table
3109:
3110: @table @var
3111: @item return
1.2 noro 3112: \JP @code{dp_vtoe} : $BJ,;6I=8=B?9`<0(B, @code{dp_etov} : $B%Y%/%H%k(B
3113: \EG @code{dp_vtoe} : distributed polynomial, @code{dp_etov} : vector
1.1 noro 3114: @item vect
1.2 noro 3115: \JP $B%Y%/%H%k(B
3116: \EG vector
1.1 noro 3117: @item dpoly
1.2 noro 3118: \JP $BJ,;6I=8=B?9`<0(B
3119: \EG distributed polynomial
1.1 noro 3120: @end table
3121:
3122: @itemize @bullet
1.2 noro 3123: \BJP
1.1 noro 3124: @item
3125: @code{dp_vtoe()} $B$O(B, $B%Y%/%H%k(B @var{vect} $B$r;X?t%Y%/%H%k$H$9$k9`$r@8@.$9$k(B.
3126: @item
3127: @code{dp_etov()} $B$O(B, $BJ,;6I=8=B?9`<0(B @code{dpoly} $B$NF,9`$N;X?t%Y%/%H%k$r(B
3128: $B%Y%/%H%k$KJQ49$9$k(B.
1.2 noro 3129: \E
3130: \BEG
3131: @item
3132: @code{dp_vtoe()} generates a term whose exponent vector is @var{vect}.
3133: @item
3134: @code{dp_etov()} generates a vector which is the exponent vector of the
3135: head term of @code{dpoly}.
3136: \E
1.1 noro 3137: @end itemize
3138:
3139: @example
3140: [211] X=<<1,2,3>>;
3141: (1)*<<1,2,3>>
3142: [212] V=dp_etov(X);
3143: [ 1 2 3 ]
3144: [213] V[2]++$
3145: [214] Y=dp_vtoe(V);
3146: (1)*<<1,2,4>>
3147: @end example
3148:
1.2 noro 3149: \JP @node dp_mbase,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3150: \EG @node dp_mbase,,, Functions for Groebner basis computation
1.1 noro 3151: @subsection @code{dp_mbase}
3152: @findex dp_mbase
3153:
3154: @table @t
3155: @item dp_mbase(@var{dplist})
1.2 noro 3156: \JP :: monomial $B4pDl$N7W;;(B
3157: \EG :: Computes the monomial basis
1.1 noro 3158: @end table
3159:
3160: @table @var
3161: @item return
1.2 noro 3162: \JP $BJ,;6I=8=B?9`<0$N%j%9%H(B
3163: \EG list of distributed polynomial
1.1 noro 3164: @item dplist
1.2 noro 3165: \JP $BJ,;6I=8=B?9`<0$N%j%9%H(B
3166: \EG list of distributed polynomial
1.1 noro 3167: @end table
3168:
3169: @itemize @bullet
1.2 noro 3170: \BJP
1.1 noro 3171: @item
3172: $B$"$k=g=x$G%0%l%V%J4pDl$H$J$C$F$$$kB?9`<0=89g$N(B, $B$=$N=g=x$K4X$9$kJ,;6I=8=(B
3173: $B$G$"$k(B @var{dplist} $B$K$D$$$F(B,
3174: @var{dplist} $B$,(B K[X] $BCf$G@8@.$9$k%$%G%"%k(B I $B$,(B 0 $B<!85$N;~(B,
3175: K $B>eM-8B<!85@~7A6u4V$G$"$k(B K[X]/I $B$N(B monomial $B$K$h$k4pDl$r5a$a$k(B.
3176: @item
3177: $BF@$i$l$?4pDl$N8D?t$,(B, K[X]/I $B$N(B K-$B@~7A6u4V$H$7$F$N<!85$KEy$7$$(B.
1.2 noro 3178: \E
3179: \BEG
3180: @item
3181: Assuming that @var{dplist} is a list of distributed polynomials which
3182: is a Groebner basis with respect to the current ordering type and
3183: that the ideal @var{I} generated by @var{dplist} in K[X] is zero-dimensional,
3184: this function computes the monomial basis of a finite dimenstional K-vector
3185: space K[X]/I.
3186: @item
3187: The number of elements in the monomial basis is equal to the
3188: K-dimenstion of K[X]/I.
3189: \E
1.1 noro 3190: @end itemize
3191:
3192: @example
3193: [215] K=katsura(5)$
3194: [216] V=[u5,u4,u3,u2,u1,u0]$
3195: [217] G0=gr(K,V,0)$
3196: [218] H=map(dp_ptod,G0,V)$
3197: [219] map(dp_ptod,dp_mbase(H),V)$
3198: [u0^5,u4*u0^3,u3*u0^3,u2*u0^3,u1*u0^3,u0^4,u3^2*u0,u2*u3*u0,u1*u3*u0,
3199: u1*u2*u0,u1^2*u0,u4*u0^2,u3*u0^2,u2*u0^2,u1*u0^2,u0^3,u3^2,u2*u3,u1*u3,
3200: u1*u2,u1^2,u4*u0,u3*u0,u2*u0,u1*u0,u0^2,u4,u3,u2,u1,u0,1]
3201: @end example
3202:
3203: @table @t
1.2 noro 3204: \JP @item $B;2>H(B
3205: \EG @item References
1.1 noro 3206: @fref{gr hgr gr_mod}.
3207: @end table
3208:
1.2 noro 3209: \JP @node dp_mag,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3210: \EG @node dp_mag,,, Functions for Groebner basis computation
1.1 noro 3211: @subsection @code{dp_mag}
3212: @findex dp_mag
3213:
3214: @table @t
3215: @item dp_mag(@var{p})
1.2 noro 3216: \JP :: $B78?t$N%S%C%HD9$NOB$rJV$9(B
3217: \EG :: Computes the sum of bit lengths of coefficients of a distributed polynomial.
1.1 noro 3218: @end table
3219:
3220: @table @var
3221: @item return
1.2 noro 3222: \JP $B?t(B
3223: \EG integer
1.1 noro 3224: @item p
1.2 noro 3225: \JP $BJ,;6I=8=B?9`<0(B
3226: \EG distributed polynomial
1.1 noro 3227: @end table
3228:
3229: @itemize @bullet
1.2 noro 3230: \BJP
1.1 noro 3231: @item
3232: $BJ,;6I=8=B?9`<0$N78?t$K8=$l$kM-M}?t$K$D$-(B, $B$=$NJ,JlJ,;R(B ($B@0?t$N>l9g$OJ,;R(B)
3233: $B$N%S%C%HD9$NAmOB$rJV$9(B.
3234: @item
3235: $BBP>]$H$J$kB?9`<0$NBg$-$5$NL\0B$H$7$FM-8z$G$"$k(B. $BFC$K(B, 0 $B<!85%7%9%F%`$K$*$$$F$O(B
3236: $B78?tKDD%$,LdBj$H$J$j(B, $BESCf@8@.$5$l$kB?9`<0$,78?tKDD%$r5/$3$7$F$$$k$+$I$&$+(B
3237: $B$NH=Dj$KLrN)$D(B.
3238: @item
3239: @code{dp_gr_flags()} $B$G(B, @code{ShowMag}, @code{Print} $B$r(B on $B$K$9$k$3$H$K$h$j(B
3240: $BESCf@8@.$5$l$kB?9`<0$K$?$$$9$k(B @code{dp_mag()} $B$NCM$r8+$k$3$H$,$G$-$k(B.
1.2 noro 3241: \E
3242: \BEG
3243: @item
3244: This function computes the sum of bit lengths of coefficients of a
3245: distributed polynomial @var{p}. If a coefficient is non integral,
3246: the sum of bit lengths of the numerator and the denominator is taken.
3247: @item
3248: This is a measure of the size of a polynomial. Especially for
3249: zero-dimensional system coefficient swells are often serious and
3250: the returned value is useful to detect such swells.
3251: @item
3252: If @code{ShowMag} and @code{Print} for @code{dp_gr_flags()} are on,
3253: values of @code{dp_mag()} for intermediate basis elements are shown.
3254: \E
1.1 noro 3255: @end itemize
3256:
3257: @example
3258: [221] X=dp_ptod((x+2*y)^10,[x,y])$
3259: [222] dp_mag(X);
3260: 115
3261: @end example
3262:
3263: @table @t
1.2 noro 3264: \JP @item $B;2>H(B
3265: \EG @item References
1.1 noro 3266: @fref{dp_gr_flags dp_gr_print}.
3267: @end table
3268:
1.2 noro 3269: \JP @node dp_red dp_red_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3270: \EG @node dp_red dp_red_mod,,, Functions for Groebner basis computation
1.1 noro 3271: @subsection @code{dp_red}, @code{dp_red_mod}
3272: @findex dp_red
3273: @findex dp_red_mod
3274:
3275: @table @t
3276: @item dp_red(@var{dpoly1},@var{dpoly2},@var{dpoly3})
3277: @item dp_red_mod(@var{dpoly1},@var{dpoly2},@var{dpoly3},@var{mod})
1.2 noro 3278: \JP :: $B0l2s$N4JLsA`:n(B
3279: \EG :: Single reduction operation
1.1 noro 3280: @end table
3281:
3282: @table @var
3283: @item return
1.2 noro 3284: \JP $B%j%9%H(B
3285: \EG list
1.4 noro 3286: @item dpoly1 dpoly2 dpoly3
1.2 noro 3287: \JP $BJ,;6I=8=B?9`<0(B
3288: \EG distributed polynomial
1.1 noro 3289: @item vlist
1.2 noro 3290: \JP $B%j%9%H(B
3291: \EG list
1.1 noro 3292: @item mod
1.2 noro 3293: \JP $BAG?t(B
3294: \EG prime
1.1 noro 3295: @end table
3296:
3297: @itemize @bullet
1.2 noro 3298: \BJP
1.1 noro 3299: @item
3300: @var{dpoly1} + @var{dpoly2} $B$J$kJ,;6I=8=B?9`<0$r(B @var{dpoly3} $B$G(B
3301: 1 $B2s4JLs$9$k(B.
3302: @item
3303: @code{dp_red_mod()} $B$NF~NO$O(B, $BA4$FM-8BBN78?t$KJQ49$5$l$F$$$kI,MW$,$"$k(B.
3304: @item
3305: $B4JLs$5$l$k9`$O(B @var{dpoly2} $B$NF,9`$G$"$k(B. $B=>$C$F(B, @var{dpoly2} $B$N(B
3306: $BF,9`$,(B @var{dpoly3} $B$NF,9`$G3d$j@Z$l$k$3$H$,$"$i$+$8$a$o$+$C$F$$$J$1$l$P(B
3307: $B$J$i$J$$(B.
3308: @item
3309: $B0z?t$,@0?t78?t$N;~(B, $B4JLs$O(B, $BJ,?t$,8=$l$J$$$h$&(B, $B@0?t(B @var{a}, @var{b},
1.4 noro 3310: $B9`(B @var{t} $B$K$h$j(B @var{a}(@var{dpoly1} + @var{dpoly2})-@var{bt} @var{dpoly3} $B$H$7$F7W;;$5$l$k(B.
1.1 noro 3311: @item
3312: $B7k2L$O(B, @code{[@var{a dpoly1},@var{a dpoly2 - bt dpoly3}]} $B$J$k%j%9%H$G$"$k(B.
1.2 noro 3313: \E
3314: \BEG
3315: @item
3316: Reduces a distributed polynomial, @var{dpoly1} + @var{dpoly2},
3317: by @var{dpoly3} for single time.
3318: @item
3319: An input for @code{dp_red_mod()} must be converted into a distributed
3320: polynomial with coefficients in a finite field.
3321: @item
3322: This implies that
3323: the divisibility of the head term of @var{dpoly2} by the head term of
3324: @var{dpoly3} is assumed.
3325: @item
3326: When integral coefficients, computation is so carefully performed that
3327: no rational operations appear in the reduction procedure.
3328: It is computed for integers @var{a} and @var{b}, and a term @var{t} as:
1.4 noro 3329: @var{a}(@var{dpoly1} + @var{dpoly2})-@var{bt} @var{dpoly3}.
1.2 noro 3330: @item
3331: The result is a list @code{[@var{a dpoly1},@var{a dpoly2 - bt dpoly3}]}.
3332: \E
1.1 noro 3333: @end itemize
3334:
3335: @example
3336: [157] D=(3)*<<2,1,0,0,0>>+(3)*<<1,2,0,0,0>>+(1)*<<0,3,0,0,0>>;
3337: (3)*<<2,1,0,0,0>>+(3)*<<1,2,0,0,0>>+(1)*<<0,3,0,0,0>>
3338: [158] R=(6)*<<1,1,1,0,0>>;
3339: (6)*<<1,1,1,0,0>>
3340: [159] C=12*<<1,1,1,0,0>>+(1)*<<0,1,1,1,0>>+(1)*<<1,1,0,0,1>>;
3341: (12)*<<1,1,1,0,0>>+(1)*<<0,1,1,1,0>>+(1)*<<1,1,0,0,1>>
3342: [160] dp_red(D,R,C);
1.5 noro 3343: [(6)*<<2,1,0,0,0>>+(6)*<<1,2,0,0,0>>+(2)*<<0,3,0,0,0>>,
3344: (-1)*<<0,1,1,1,0>>+(-1)*<<1,1,0,0,1>>]
1.1 noro 3345: @end example
3346:
3347: @table @t
1.2 noro 3348: \JP @item $B;2>H(B
3349: \EG @item References
1.1 noro 3350: @fref{dp_mod dp_rat}.
3351: @end table
3352:
1.2 noro 3353: \JP @node dp_sp dp_sp_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3354: \EG @node dp_sp dp_sp_mod,,, Functions for Groebner basis computation
1.1 noro 3355: @subsection @code{dp_sp}, @code{dp_sp_mod}
3356: @findex dp_sp
3357: @findex dp_sp_mod
3358:
3359: @table @t
3360: @item dp_sp(@var{dpoly1},@var{dpoly2})
3361: @item dp_sp_mod(@var{dpoly1},@var{dpoly2},@var{mod})
1.2 noro 3362: \JP :: S-$BB?9`<0$N7W;;(B
3363: \EG :: Computation of an S-polynomial
1.1 noro 3364: @end table
3365:
3366: @table @var
3367: @item return
1.2 noro 3368: \JP $BJ,;6I=8=B?9`<0(B
3369: \EG distributed polynomial
1.4 noro 3370: @item dpoly1 dpoly2
1.2 noro 3371: \JP $BJ,;6I=8=B?9`<0(B
3372: \EG distributed polynomial
1.1 noro 3373: @item mod
1.2 noro 3374: \JP $BAG?t(B
3375: \EG prime
1.1 noro 3376: @end table
3377:
3378: @itemize @bullet
1.2 noro 3379: \BJP
1.1 noro 3380: @item
3381: @var{dpoly1}, @var{dpoly2} $B$N(B S-$BB?9`<0$r7W;;$9$k(B.
3382: @item
3383: @code{dp_sp_mod()} $B$NF~NO$O(B, $BA4$FM-8BBN78?t$KJQ49$5$l$F$$$kI,MW$,$"$k(B.
3384: @item
3385: $B7k2L$KM-M}?t(B, $BM-M}<0$,F~$k$N$rHr$1$k$?$a(B, $B7k2L$,Dj?tG\(B, $B$"$k$$$OB?9`<0(B
3386: $BG\$5$l$F$$$k2DG=@-$,$"$k(B.
1.2 noro 3387: \E
3388: \BEG
3389: @item
3390: This function computes the S-polynomial of @var{dpoly1} and @var{dpoly2}.
3391: @item
3392: Inputs of @code{dp_sp_mod()} must be polynomials with coefficients in a
3393: finite field.
3394: @item
3395: The result may be multiplied by a constant in the ground field in order to
3396: make the result integral.
3397: \E
1.1 noro 3398: @end itemize
3399:
3400: @example
3401: [227] X=dp_ptod(x^2*y+x*y,[x,y]);
3402: (1)*<<2,1>>+(1)*<<1,1>>
3403: [228] Y=dp_ptod(x*y^2+x*y,[x,y]);
3404: (1)*<<1,2>>+(1)*<<1,1>>
3405: [229] dp_sp(X,Y);
3406: (-1)*<<2,1>>+(1)*<<1,2>>
3407: @end example
3408:
3409: @table @t
1.2 noro 3410: \JP @item $B;2>H(B
3411: \EG @item References
1.1 noro 3412: @fref{dp_mod dp_rat}.
3413: @end table
1.2 noro 3414: \JP @node p_nf p_nf_mod p_true_nf p_true_nf_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3415: \EG @node p_nf p_nf_mod p_true_nf p_true_nf_mod,,, Functions for Groebner basis computation
1.1 noro 3416: @subsection @code{p_nf}, @code{p_nf_mod}, @code{p_true_nf}, @code{p_true_nf_mod}
3417: @findex p_nf
3418: @findex p_nf_mod
3419: @findex p_true_nf
3420: @findex p_true_nf_mod
3421:
3422: @table @t
3423: @item p_nf(@var{poly},@var{plist},@var{vlist},@var{order})
3424: @itemx p_nf_mod(@var{poly},@var{plist},@var{vlist},@var{order},@var{mod})
1.2 noro 3425: \JP :: $BI=8=B?9`<0$N@55,7A$r5a$a$k(B. ($B7k2L$ODj?tG\$5$l$F$$$k2DG=@-$"$j(B)
3426: \BEG
3427: :: Computes the normal form of the given polynomial.
3428: (The result may be multiplied by a constant.)
3429: \E
1.1 noro 3430: @item p_true_nf(@var{poly},@var{plist},@var{vlist},@var{order})
3431: @itemx p_true_nf_mod(@var{poly},@var{plist},@var{vlist},@var{order},@var{mod})
1.2 noro 3432: \JP :: $BI=8=B?9`<0$N@55,7A$r5a$a$k(B. ($B??$N7k2L$r(B @code{[$BJ,;R(B, $BJ,Jl(B]} $B$N7A$GJV$9(B)
3433: \BEG
3434: :: Computes the normal form of the given polynomial. (The result is returned
3435: as a form of @code{[numerator, denominator]})
3436: \E
1.1 noro 3437: @end table
3438:
3439: @table @var
3440: @item return
1.2 noro 3441: \JP @code{p_nf} : $BB?9`<0(B, @code{p_true_nf} : $B%j%9%H(B
3442: \EG @code{p_nf} : polynomial, @code{p_true_nf} : list
1.1 noro 3443: @item poly
1.2 noro 3444: \JP $BB?9`<0(B
3445: \EG polynomial
1.4 noro 3446: @item plist vlist
1.2 noro 3447: \JP $B%j%9%H(B
3448: \EG list
1.1 noro 3449: @item order
1.2 noro 3450: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
3451: \EG number, list or matrix
1.1 noro 3452: @item mod
1.2 noro 3453: \JP $BAG?t(B
3454: \EG prime
1.1 noro 3455: @end table
3456:
3457: @itemize @bullet
1.2 noro 3458: \BJP
1.1 noro 3459: @item
3460: @samp{gr} $B$GDj5A$5$l$F$$$k(B.
3461: @item
3462: $BB?9`<0$N(B, $BB?9`<0%j%9%H$K$h$k@55,7A$r5a$a$k(B.
3463: @item
3464: @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()}, @code{dp_true_nf_mod}
3465: $B$KBP$9$k%$%s%?%U%'!<%9$G$"$k(B.
3466: @item
3467: @var{poly} $B$*$h$S(B @var{plist} $B$O(B, $BJQ?t=g=x(B @var{vlist} $B$*$h$S(B
3468: $BJQ?t=g=x7?(B @var{otype} $B$K=>$C$FJ,;6I=8=B?9`<0$KJQ49$5$l(B,
3469: @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()},
3470: @code{dp_true_nf_mod()} $B$KEO$5$l$k(B.
3471: @item
3472: @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()},
3473: @code{dp_true_nf_mod()} $B$O(B @var{fullreduce} $B$,(B 1 $B$G8F$S=P$5$l$k(B.
3474: @item
3475: $B7k2L$OB?9`<0$KJQ49$5$l$F=PNO$5$l$k(B.
3476: @item
3477: @code{p_true_nf()}, @code{p_true_nf_mod()} $B$N=PNO$K4X$7$F$O(B,
3478: @code{dp_true_nf()}, @code{dp_true_nf_mod()} $B$N9`$r;2>H(B.
1.2 noro 3479: \E
3480: \BEG
3481: @item
3482: Defined in the package @samp{gr}.
3483: @item
3484: Obtains the normal form of a polynomial by a polynomial list.
3485: @item
3486: These are interfaces to @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()},
3487: @code{dp_true_nf_mod}
3488: @item
3489: The polynomial @var{poly} and the polynomials in @var{plist} is
3490: converted, according to the variable ordering @var{vlist} and
3491: type of term ordering @var{otype}, into their distributed polynomial
3492: counterparts and passed to @code{dp_nf()}.
3493: @item
3494: @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()} and
3495: @code{dp_true_nf_mod()}
3496: is called with value 1 for @var{fullreduce}.
3497: @item
3498: The result is converted back into an ordinary polynomial.
3499: @item
3500: As for @code{p_true_nf()}, @code{p_true_nf_mod()}
3501: refer to @code{dp_true_nf()} and @code{dp_true_nf_mod()}.
3502: \E
1.1 noro 3503: @end itemize
3504:
3505: @example
3506: [79] K = katsura(5)$
3507: [80] V = [u5,u4,u3,u2,u1,u0]$
3508: [81] G = hgr(K,V,2)$
3509: [82] p_nf(K[1],G,V,2);
3510: 0
3511: [83] L = p_true_nf(K[1]+1,G,V,2);
3512: [-1503...,-1503...]
3513: [84] L[0]/L[1];
3514: 1
3515: @end example
3516:
3517: @table @t
1.2 noro 3518: \JP @item $B;2>H(B
3519: \EG @item References
1.1 noro 3520: @fref{dp_ptod},
3521: @fref{dp_dtop},
3522: @fref{dp_ord},
3523: @fref{dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod}.
3524: @end table
3525:
1.2 noro 3526: \JP @node p_terms,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3527: \EG @node p_terms,,, Functions for Groebner basis computation
1.1 noro 3528: @subsection @code{p_terms}
3529: @findex p_terms
3530:
3531: @table @t
3532: @item p_terms(@var{poly},@var{vlist},@var{order})
1.2 noro 3533: \JP :: $BB?9`<0$K$"$i$o$l$kC19`$r%j%9%H$K$9$k(B.
3534: \EG :: Monomials appearing in the given polynomial is collected into a list.
1.1 noro 3535: @end table
3536:
3537: @table @var
3538: @item return
1.2 noro 3539: \JP $B%j%9%H(B
3540: \EG list
1.1 noro 3541: @item poly
1.2 noro 3542: \JP $BB?9`<0(B
3543: \EG polynomial
1.1 noro 3544: @item vlist
1.2 noro 3545: \JP $B%j%9%H(B
3546: \EG list
1.1 noro 3547: @item order
1.2 noro 3548: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
3549: \EG number, list or matrix
1.1 noro 3550: @end table
3551:
3552: @itemize @bullet
1.2 noro 3553: \BJP
1.1 noro 3554: @item
3555: @samp{gr} $B$GDj5A$5$l$F$$$k(B.
3556: @item
3557: $BB?9`<0$rC19`$KE83+$7$?;~$K8=$l$k9`$r%j%9%H$K$7$FJV$9(B.
3558: @var{vlist} $B$*$h$S(B @var{order} $B$K$h$jDj$^$k9`=g=x$K$h$j(B, $B=g=x$N9b$$$b$N(B
3559: $B$,%j%9%H$N@hF,$KMh$k$h$&$K%=!<%H$5$l$k(B.
3560: @item
3561: $B%0%l%V%J4pDl$O$7$P$7$P78?t$,5pBg$K$J$k$?$a(B, $B<B:]$K$I$N9`$,8=$l$F(B
3562: $B$$$k$N$+$r8+$k$?$a$J$I$KMQ$$$k(B.
1.2 noro 3563: \E
3564: \BEG
3565: @item
3566: Defined in the package @samp{gr}.
3567: @item
3568: This returns a list which contains all non-zero monomials in the given
3569: polynomial. The monomials are ordered according to the current
3570: type of term ordering and @var{vlist}.
3571: @item
3572: Since polynomials in a Groebner base often have very large coefficients,
3573: examining a polynomial as it is may sometimes be difficult to perform.
3574: For such a case, this function enables to examine which term is really
3575: exists.
3576: \E
1.1 noro 3577: @end itemize
3578:
3579: @example
3580: [233] G=gr(katsura(5),[u5,u4,u3,u2,u1,u0],2)$
3581: [234] p_terms(G[0],[u5,u4,u3,u2,u1,u0],2);
1.5 noro 3582: [u5,u0^31,u0^30,u0^29,u0^28,u0^27,u0^26,u0^25,u0^24,u0^23,u0^22,
3583: u0^21,u0^20,u0^19,u0^18,u0^17,u0^16,u0^15,u0^14,u0^13,u0^12,u0^11,
3584: u0^10,u0^9,u0^8,u0^7,u0^6,u0^5,u0^4,u0^3,u0^2,u0,1]
1.1 noro 3585: @end example
3586:
1.2 noro 3587: \JP @node gb_comp,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3588: \EG @node gb_comp,,, Functions for Groebner basis computation
1.1 noro 3589: @subsection @code{gb_comp}
3590: @findex gb_comp
3591:
3592: @table @t
3593: @item gb_comp(@var{plist1}, @var{plist2})
1.2 noro 3594: \JP :: $BB?9`<0%j%9%H$,(B, $BId9f$r=|$$$F=89g$H$7$FEy$7$$$+$I$&$+D4$Y$k(B.
3595: \EG :: Checks whether two polynomial lists are equal or not as a set
1.1 noro 3596: @end table
3597:
3598: @table @var
1.2 noro 3599: \JP @item return 0 $B$^$?$O(B 1
3600: \EG @item return 0 or 1
1.4 noro 3601: @item plist1 plist2
1.1 noro 3602: @end table
3603:
3604: @itemize @bullet
1.2 noro 3605: \BJP
1.1 noro 3606: @item
3607: @var{plist1}, @var{plist2} $B$K$D$$$F(B, $BId9f$r=|$$$F=89g$H$7$FEy$7$$$+$I$&$+(B
3608: $BD4$Y$k(B.
3609: @item
3610: $B0[$J$kJ}K!$G5a$a$?%0%l%V%J4pDl$O(B, $B4pDl$N=g=x(B, $BId9f$,0[$J$k>l9g$,$"$j(B,
3611: $B$=$l$i$,Ey$7$$$+$I$&$+$rD4$Y$k$?$a$KMQ$$$k(B.
1.2 noro 3612: \E
3613: \BEG
3614: @item
3615: This function checks whether @var{plist1} and @var{plist2} are equal or
3616: not as a set .
3617: @item
3618: For the same input and the same term ordering different
3619: functions for Groebner basis computations may produce different outputs
3620: as lists. This function compares such lists whether they are equal
3621: as a generating set of an ideal.
3622: \E
1.1 noro 3623: @end itemize
3624:
3625: @example
3626: [243] C=cyclic(6)$
3627: [244] V=[c0,c1,c2,c3,c4,c5]$
3628: [245] G0=gr(C,V,0)$
3629: [246] G=tolex(G0,V,0,V)$
3630: [247] GG=lex_tl(C,V,0,V,0)$
3631: [248] gb_comp(G,GG);
3632: 1
3633: @end example
3634:
1.2 noro 3635: \JP @node katsura hkatsura cyclic hcyclic,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3636: \EG @node katsura hkatsura cyclic hcyclic,,, Functions for Groebner basis computation
1.1 noro 3637: @subsection @code{katsura}, @code{hkatsura}, @code{cyclic}, @code{hcyclic}
3638: @findex katsura
3639: @findex hkatsura
3640: @findex cyclic
3641: @findex hcyclic
3642:
3643: @table @t
3644: @item katsura(@var{n})
3645: @item hkatsura(@var{n})
3646: @item cyclic(@var{n})
3647: @item hcyclic(@var{n})
1.2 noro 3648: \JP :: $BB?9`<0%j%9%H$N@8@.(B
3649: \EG :: Generates a polynomial list of standard benchmark.
1.1 noro 3650: @end table
3651:
3652: @table @var
3653: @item return
1.2 noro 3654: \JP $B%j%9%H(B
3655: \EG list
1.1 noro 3656: @item n
1.2 noro 3657: \JP $B@0?t(B
3658: \EG integer
1.1 noro 3659: @end table
3660:
3661: @itemize @bullet
1.2 noro 3662: \BJP
1.1 noro 3663: @item
3664: @code{katsura()} $B$O(B @samp{katsura}, @code{cyclic()} $B$O(B @samp{cyclic}
3665: $B$GDj5A$5$l$F$$$k(B.
3666: @item
3667: $B%0%l%V%J4pDl7W;;$G$7$P$7$P%F%9%H(B, $B%Y%s%A%^!<%/$KMQ$$$i$l$k(B @code{katsura},
3668: @code{cyclic} $B$*$h$S$=$N@F<!2=$r@8@.$9$k(B.
3669: @item
3670: @code{cyclic} $B$O(B @code{Arnborg}, @code{Lazard}, @code{Davenport} $B$J$I$N(B
3671: $BL>$G8F$P$l$k$3$H$b$"$k(B.
1.2 noro 3672: \E
3673: \BEG
3674: @item
3675: Function @code{katsura()} is defined in @samp{katsura}, and
3676: function @code{cyclic()} in @samp{cyclic}.
3677: @item
3678: These functions generate a series of polynomial sets, respectively,
3679: which are often used for testing and bench marking:
3680: @code{katsura}, @code{cyclic} and their homogenized versions.
3681: @item
3682: Polynomial set @code{cyclic} is sometimes called by other name:
3683: @code{Arnborg}, @code{Lazard}, and @code{Davenport}.
3684: \E
1.1 noro 3685: @end itemize
3686:
3687: @example
3688: [74] load("katsura")$
3689: [79] load("cyclic")$
3690: [89] katsura(5);
3691: [u0+2*u4+2*u3+2*u2+2*u1+2*u5-1,2*u4*u0-u4+2*u1*u3+u2^2+2*u5*u1,
1.5 noro 3692: 2*u3*u0+2*u1*u4-u3+(2*u1+2*u5)*u2,2*u2*u0+2*u2*u4+(2*u1+2*u5)*u3
3693: -u2+u1^2,2*u1*u0+(2*u3+2*u5)*u4+2*u2*u3+2*u1*u2-u1,
1.1 noro 3694: u0^2-u0+2*u4^2+2*u3^2+2*u2^2+2*u1^2+2*u5^2]
3695: [90] hkatsura(5);
3696: [-t+u0+2*u4+2*u3+2*u2+2*u1+2*u5,
3697: -u4*t+2*u4*u0+2*u1*u3+u2^2+2*u5*u1,-u3*t+2*u3*u0+2*u1*u4+(2*u1+2*u5)*u2,
3698: -u2*t+2*u2*u0+2*u2*u4+(2*u1+2*u5)*u3+u1^2,
3699: -u1*t+2*u1*u0+(2*u3+2*u5)*u4+2*u2*u3+2*u1*u2,
3700: -u0*t+u0^2+2*u4^2+2*u3^2+2*u2^2+2*u1^2+2*u5^2]
3701: [91] cyclic(6);
3702: [c5*c4*c3*c2*c1*c0-1,
3703: ((((c4+c5)*c3+c5*c4)*c2+c5*c4*c3)*c1+c5*c4*c3*c2)*c0+c5*c4*c3*c2*c1,
3704: (((c3+c5)*c2+c5*c4)*c1+c5*c4*c3)*c0+c4*c3*c2*c1+c5*c4*c3*c2,
3705: ((c2+c5)*c1+c5*c4)*c0+c3*c2*c1+c4*c3*c2+c5*c4*c3,
3706: (c1+c5)*c0+c2*c1+c3*c2+c4*c3+c5*c4,c0+c1+c2+c3+c4+c5]
3707: [92] hcyclic(6);
3708: [-c^6+c5*c4*c3*c2*c1*c0,
3709: ((((c4+c5)*c3+c5*c4)*c2+c5*c4*c3)*c1+c5*c4*c3*c2)*c0+c5*c4*c3*c2*c1,
3710: (((c3+c5)*c2+c5*c4)*c1+c5*c4*c3)*c0+c4*c3*c2*c1+c5*c4*c3*c2,
3711: ((c2+c5)*c1+c5*c4)*c0+c3*c2*c1+c4*c3*c2+c5*c4*c3,
3712: (c1+c5)*c0+c2*c1+c3*c2+c4*c3+c5*c4,c0+c1+c2+c3+c4+c5]
3713: @end example
3714:
3715: @table @t
1.2 noro 3716: \JP @item $B;2>H(B
3717: \EG @item References
1.1 noro 3718: @fref{dp_dtop}.
3719: @end table
3720:
1.3 noro 3721: \JP @node primadec primedec,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3722: \EG @node primadec primedec,,, Functions for Groebner basis computation
3723: @subsection @code{primadec}, @code{primedec}
3724: @findex primadec
3725: @findex primedec
3726:
3727: @table @t
3728: @item primadec(@var{plist},@var{vlist})
3729: @item primedec(@var{plist},@var{vlist})
3730: \JP :: $B%$%G%"%k$NJ,2r(B
3731: \EG :: Computes decompositions of ideals.
3732: @end table
3733:
3734: @table @var
3735: @item return
3736: @itemx plist
3737: \JP $BB?9`<0%j%9%H(B
3738: \EG list of polynomials
3739: @item vlist
3740: \JP $BJQ?t%j%9%H(B
3741: \EG list of variables
3742: @end table
3743:
3744: @itemize @bullet
3745: \BJP
3746: @item
3747: @code{primadec()}, @code{primedec} $B$O(B @samp{primdec} $B$GDj5A$5$l$F$$$k(B.
3748: @item
3749: @code{primadec()}, @code{primedec()} $B$O$=$l$>$lM-M}?tBN>e$G$N%$%G%"%k$N(B
3750: $B=`AGJ,2r(B, $B:,4p$NAG%$%G%"%kJ,2r$r9T$&(B.
3751: @item
3752: $B0z?t$OB?9`<0%j%9%H$*$h$SJQ?t%j%9%H$G$"$k(B. $BB?9`<0$OM-M}?t78?t$N$_$,5v$5$l$k(B.
3753: @item
3754: @code{primadec} $B$O(B @code{[$B=`AG@.J,(B, $BIUB0AG%$%G%"%k(B]} $B$N%j%9%H$rJV$9(B.
3755: @item
3756: @code{primadec} $B$O(B $BAG0x;R$N%j%9%H$rJV$9(B.
3757: @item
3758: $B7k2L$K$*$$$F(B, $BB?9`<0%j%9%H$H$7$FI=<($5$l$F$$$k3F%$%G%"%k$OA4$F(B
3759: $B%0%l%V%J4pDl$G$"$k(B. $BBP1~$9$k9`=g=x$O(B, $B$=$l$>$l(B
3760: $BJQ?t(B @code{PRIMAORD}, @code{PRIMEORD} $B$K3JG<$5$l$F$$$k(B.
3761: @item
3762: @code{primadec} $B$O(B @code{[Shimoyama,Yokoyama]} $B$N=`AGJ,2r%"%k%4%j%:%`(B
3763: $B$r<BAu$7$F$$$k(B.
3764: @item
3765: $B$b$7AG0x;R$N$_$r5a$a$?$$$J$i(B, @code{primedec} $B$r;H$&J}$,$h$$(B.
3766: $B$3$l$O(B, $BF~NO%$%G%"%k$,:,4p%$%G%"%k$G$J$$>l9g$K(B, @code{primadec}
3767: $B$N7W;;$KM>J,$J%3%9%H$,I,MW$H$J$k>l9g$,$"$k$+$i$G$"$k(B.
3768: \E
3769: \BEG
3770: @item
3771: Function @code{primadec()} and @code{primedec} are defined in @samp{primdec}.
3772: @item
3773: @code{primadec()}, @code{primedec()} are the function for primary
3774: ideal decomposition and prime decomposition of the radical over the
3775: rationals respectively.
3776: @item
3777: The arguments are a list of polynomials and a list of variables.
3778: These functions accept ideals with rational function coefficients only.
3779: @item
3780: @code{primadec} returns the list of pair lists consisting a primary component
3781: and its associated prime.
3782: @item
3783: @code{primedec} returns the list of prime components.
3784: @item
3785: Each component is a Groebner basis and the corresponding term order
3786: is indicated by the global variables @code{PRIMAORD}, @code{PRIMEORD}
3787: respectively.
3788: @item
3789: @code{primadec} implements the primary decompostion algorithm
3790: in @code{[Shimoyama,Yokoyama]}.
3791: @item
3792: If one only wants to know the prime components of an ideal, then
3793: use @code{primedec} because @code{primadec} may need additional costs
3794: if an input ideal is not radical.
3795: \E
3796: @end itemize
3797:
3798: @example
3799: [84] load("primdec")$
3800: [102] primedec([p*q*x-q^2*y^2+q^2*y,-p^2*x^2+p^2*x+p*q*y,
3801: (q^3*y^4-2*q^3*y^3+q^3*y^2)*x-q^3*y^4+q^3*y^3,
3802: -q^3*y^4+2*q^3*y^3+(-q^3+p*q^2)*y^2],[p,q,x,y]);
3803: [[y,x],[y,p],[x,q],[q,p],[x-1,q],[y-1,p],[(y-1)*x-y,q*y^2-2*q*y-p+q]]
3804: [103] primadec([x,z*y,w*y^2,w^2*y-z^3,y^3],[x,y,z,w]);
3805: [[[x,z*y,y^2,w^2*y-z^3],[z,y,x]],[[w,x,z*y,z^3,y^3],[w,z,y,x]]]
3806: @end example
3807:
3808: @table @t
3809: \JP @item $B;2>H(B
3810: \EG @item References
3811: @fref{fctr sqfr},
3812: \JP @fref{$B9`=g=x$N@_Dj(B}.
3813: \EG @fref{Setting term orderings}.
3814: @end table
1.5 noro 3815:
3816: \JP @node primedec_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3817: \EG @node primedec_mod,,, Functions for Groebner basis computation
3818: @subsection @code{primedec_mod}
3819: @findex primedec_mod
3820:
3821: @table @t
3822: @item primedec_mod(@var{plist},@var{vlist},@var{ord},@var{mod},@var{strategy})
3823: \JP :: $B%$%G%"%k$NJ,2r(B
3824: \EG :: Computes decompositions of ideals over small finite fields.
3825: @end table
3826:
3827: @table @var
3828: @item return
3829: @itemx plist
3830: \JP $BB?9`<0%j%9%H(B
3831: \EG list of polynomials
3832: @item vlist
3833: \JP $BJQ?t%j%9%H(B
3834: \EG list of variables
3835: @item ord
3836: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
3837: \EG number, list or matrix
3838: @item mod
3839: \JP $B@5@0?t(B
3840: \EG positive integer
3841: @item strategy
3842: \JP $B@0?t(B
3843: \EG integer
3844: @end table
3845:
3846: @itemize @bullet
3847: \BJP
3848: @item
3849: @code{primedec_mod()} $B$O(B @samp{primdec_mod}
3850: $B$GDj5A$5$l$F$$$k(B. @code{[Yokoyama]} $B$NAG%$%G%"%kJ,2r%"%k%4%j%:%`(B
3851: $B$r<BAu$7$F$$$k(B.
3852: @item
3853: @code{primedec_mod()} $B$OM-8BBN>e$G$N%$%G%"%k$N(B
3854: $B:,4p$NAG%$%G%"%kJ,2r$r9T$$(B, $BAG%$%G%"%k$N%j%9%H$rJV$9(B.
3855: @item
3856: @code{primedec_mod()} $B$O(B, GF(@var{mod}) $B>e$G$NJ,2r$rM?$($k(B.
3857: $B7k2L$N3F@.J,$N@8@.85$O(B, $B@0?t78?tB?9`<0$G$"$k(B.
3858: @item
3859: $B7k2L$K$*$$$F(B, $BB?9`<0%j%9%H$H$7$FI=<($5$l$F$$$k3F%$%G%"%k$OA4$F(B
3860: [@var{vlist},@var{ord}] $B$G;XDj$5$l$k9`=g=x$K4X$9$k%0%l%V%J4pDl$G$"$k(B.
3861: @item
3862: @var{strategy} $B$,(B 0 $B$G$J$$$H$-(B, incremental $B$K(B component $B$N6&DL(B
3863: $BItJ,$r7W;;$9$k$3$H$K$h$k(B early termination $B$r9T$&(B. $B0lHL$K(B,
3864: $B%$%G%"%k$N<!85$,9b$$>l9g$KM-8z$@$,(B, 0 $B<!85$N>l9g$J$I(B, $B<!85$,>.$5$$(B
3865: $B>l9g$K$O(B overhead $B$,Bg$-$$>l9g$,$"$k(B.
1.7 ! noro 3866: @item
! 3867: $B7W;;ESCf$GFbIt>pJs$r8+$?$$>l9g$K$O!"(B
! 3868: $BA0$b$C$F(B @code{dp_gr_print(2)} $B$r<B9T$7$F$*$1$P$h$$(B.
1.5 noro 3869: \E
3870: \BEG
3871: @item
3872: Function @code{primedec_mod()}
3873: is defined in @samp{primdec_mod} and implements the prime decomposition
3874: algorithm in @code{[Yokoyama]}.
3875: @item
3876: @code{primedec_mod()}
3877: is the function for prime ideal decomposition
3878: of the radical of a polynomial ideal over small finite field,
3879: and they return a list of prime ideals, which are associated primes
3880: of the input ideal.
3881: @item
3882: @code{primedec_mod()} gives the decomposition over GF(@var{mod}).
3883: The generators of each resulting component consists of integral polynomials.
3884: @item
3885: Each resulting component is a Groebner basis with respect to
3886: a term order specified by [@var{vlist},@var{ord}].
3887: @item
3888: If @var{strategy} is non zero, then the early termination strategy
3889: is tried by computing the intersection of obtained components
3890: incrementally. In general, this strategy is useful when the krull
3891: dimension of the ideal is high, but it may add some overhead
3892: if the dimension is small.
1.7 ! noro 3893: @item
! 3894: If you want to see internal information during the computation,
! 3895: execute @code{dp_gr_print(2)} in advance.
1.5 noro 3896: \E
3897: @end itemize
3898:
3899: @example
3900: [0] load("primdec_mod")$
3901: [246] PP444=[x^8+x^2+t,y^8+y^2+t,z^8+z^2+t]$
3902: [247] primedec_mod(PP444,[x,y,z,t],0,2,1);
3903: [[y+z,x+z,z^8+z^2+t],[x+y,y^2+y+z^2+z+1,z^8+z^2+t],
3904: [y+z+1,x+z+1,z^8+z^2+t],[x+z,y^2+y+z^2+z+1,z^8+z^2+t],
3905: [y+z,x^2+x+z^2+z+1,z^8+z^2+t],[y+z+1,x^2+x+z^2+z+1,z^8+z^2+t],
3906: [x+z+1,y^2+y+z^2+z+1,z^8+z^2+t],[y+z+1,x+z,z^8+z^2+t],
3907: [x+y+1,y^2+y+z^2+z+1,z^8+z^2+t],[y+z,x+z+1,z^8+z^2+t]]
3908: [248]
3909: @end example
3910:
3911: @table @t
3912: \JP @item $B;2>H(B
3913: \EG @item References
3914: @fref{modfctr},
1.6 noro 3915: @fref{dp_gr_main dp_gr_mod_main dp_gr_f_main dp_weyl_gr_main dp_weyl_gr_mod_main dp_weyl_gr_f_main},
1.5 noro 3916: \JP @fref{$B9`=g=x$N@_Dj(B}.
1.7 ! noro 3917: \EG @fref{Setting term orderings},
! 3918: @fref{dp_gr_flags dp_gr_print}.
1.5 noro 3919: @end table
3920:
1.6 noro 3921: \JP @node bfunction generic_bfct,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3922: \EG @node bfunction generic_bfct,,, Functions for Groebner basis computation
3923: @subsection @code{bfunction}, @code{generic_bfct}
3924: @findex bfunction
3925: @findex generic_bfct
1.5 noro 3926:
1.6 noro 3927: @table @t
3928: @item bfunction(@var{f})
3929: @item generic_bfct(@var{plist},@var{vlist},@var{dvlist},@var{weight})
3930: \JP :: b $B4X?t$N7W;;(B
3931: \EG :: Computes the global b function of a polynomial or an ideal
3932: @end table
3933: @table @var
3934: @item return
3935: @itemx f
3936: \JP $BB?9`<0(B
3937: \EG polynomial
3938: @item plist
3939: \JP $BB?9`<0%j%9%H(B
3940: \EG list of polynomials
3941: @item vlist dvlist
3942: \JP $BJQ?t%j%9%H(B
3943: \EG list of variables
3944: @end table
1.5 noro 3945:
1.6 noro 3946: @itemize @bullet
3947: \BJP
3948: @item @samp{bfct} $B$GDj5A$5$l$F$$$k(B.
3949: @item @code{bfunction(@var{f})} $B$OB?9`<0(B @var{f} $B$N(B global b $B4X?t(B @code{b(s)} $B$r(B
3950: $B7W;;$9$k(B. @code{b(s)} $B$O(B, Weyl $BBe?t(B @code{D} $B>e$N0lJQ?tB?9`<04D(B @code{D[s]}
3951: $B$N85(B @code{P(x,s)} $B$,B8:_$7$F(B, @code{P(x,s)f^(s+1)=b(s)f^s} $B$rK~$?$9$h$&$J(B
3952: $BB?9`<0(B @code{b(s)} $B$NCf$G(B, $B<!?t$,:G$bDc$$$b$N$G$"$k(B.
3953: @item @code{generic_bfct(@var{f},@var{vlist},@var{dvlist},@var{weight})}
3954: $B$O(B, @var{plist} $B$G@8@.$5$l$k(B @code{D} $B$N:8%$%G%"%k(B @code{I} $B$N(B,
3955: $B%&%'%$%H(B @var{weight} $B$K4X$9$k(B global b $B4X?t$r7W;;$9$k(B.
3956: @var{vlist} $B$O(B @code{x}-$BJQ?t(B, @var{vlist} $B$OBP1~$9$k(B @code{D}-$BJQ?t(B
3957: $B$r=g$KJB$Y$k(B.
1.7 ! noro 3958: @item $B>\:Y$K$D$$$F$O(B, [Saito,Sturmfels,Takayama] $B$r8+$h(B.
1.6 noro 3959: \E
3960: \BEG
3961: @item These functions are defined in @samp{bfct}.
3962: @item @code{bfunction(@var{f})} computes the global b-function @code{b(s)} of
3963: a polynomial @var{f}.
3964: @code{b(s)} is a polynomial of the minimal degree
3965: such that there exists @code{P(x,s)} in D[s], which is a polynomial
3966: ring over Weyl algebra @code{D}, and @code{P(x,s)f^(s+1)=b(s)f^s} holds.
3967: @item @code{generic_bfct(@var{f},@var{vlist},@var{dvlist},@var{weight})}
3968: computes the global b-function of a left ideal @code{I} in @code{D}
3969: generated by @var{plist}, with respect to @var{weight}.
3970: @var{vlist} is the list of @code{x}-variables,
3971: @var{vlist} is the list of corresponding @code{D}-variables.
1.7 ! noro 3972: @item See [Saito,Sturmfels,Takayama] for the details.
1.6 noro 3973: \E
3974: @end itemize
3975:
3976: @example
3977: [0] load("bfct")$
3978: [216] bfunction(x^3+y^3+z^3+x^2*y^2*z^2+x*y*z);
3979: -9*s^5-63*s^4-173*s^3-233*s^2-154*s-40
3980: [217] fctr(@@);
3981: [[-1,1],[s+2,1],[3*s+4,1],[3*s+5,1],[s+1,2]]
3982: [218] F = [4*x^3*dt+y*z*dt+dx,x*z*dt+4*y^3*dt+dy,
3983: x*y*dt+5*z^4*dt+dz,-x^4-z*y*x-y^4-z^5+t]$
3984: [219] generic_bfct(F,[t,z,y,x],[dt,dz,dy,dx],[1,0,0,0]);
3985: 20000*s^10-70000*s^9+101750*s^8-79375*s^7+35768*s^6-9277*s^5
3986: +1278*s^4-72*s^3
3987: @end example
3988:
3989: @table @t
3990: \JP @item $B;2>H(B
3991: \EG @item References
3992: \JP @fref{Weyl $BBe?t(B}.
3993: \EG @fref{Weyl algebra}.
3994: @end table
1.5 noro 3995:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to groebner.texi CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM / src / asir-doc / parts