Annotation of OpenXM/src/asir-doc/parts/groebner.texi, Revision 1.24
1.24 ! noro 1: @comment $OpenXM: OpenXM/src/asir-doc/parts/groebner.texi,v 1.23 2019/09/13 09:31:00 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::
1.13 noro 18: * Weight::
1.1 noro 19: * $BM-M}<0$r78?t$H$9$k%0%l%V%J4pDl7W;;(B::
20: * $B4pDlJQ49(B::
1.5 noro 21: * Weyl $BBe?t(B::
1.23 noro 22: * $BB?9`<04D>e$N2C72(B::
1.1 noro 23: * $B%0%l%V%J4pDl$K4X$9$kH!?t(B::
1.2 noro 24: \E
25: \BEG
26: * Distributed polynomial::
27: * Reading files::
28: * Fundamental functions::
29: * Controlling Groebner basis computations::
30: * Setting term orderings::
1.13 noro 31: * Weight::
1.2 noro 32: * Groebner basis computation with rational function coefficients::
33: * Change of ordering::
1.5 noro 34: * Weyl algebra::
1.23 noro 35: * Module over a polynomial ring::
1.2 noro 36: * Functions for Groebner basis computation::
37: \E
1.1 noro 38: @end menu
39:
1.2 noro 40: \BJP
1.1 noro 41: @node $BJ,;6I=8=B?9`<0(B,,, $B%0%l%V%J4pDl$N7W;;(B
42: @section $BJ,;6I=8=B?9`<0(B
1.2 noro 43: \E
44: \BEG
45: @node Distributed polynomial,,, Groebner basis computation
46: @section Distributed polynomial
47: \E
1.1 noro 48:
49: @noindent
1.2 noro 50: \BJP
1.1 noro 51: $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
52: (@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
53: $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
54: $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,
55: $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 56: \E
57: \BEG
58: A distributed polynomial is a polynomial with a special internal
59: representation different from the ordinary one.
60:
61: An ordinary polynomial (having @code{type} 2) is internally represented
62: in a format, called recursive representation.
63: In fact, it is represented as an uni-variate polynomial with respect to
64: a fixed variable, called main variable of that polynomial,
65: where the other variables appear in the coefficients which may again
66: polynomials in such variables other than the previous main variable.
67: A polynomial in the coefficients is again represented as
68: an uni-variate polynomial in a certain fixed variable,
69: the main variable. Thus, by this recursive structure of polynomial
70: representation, it is called the `recursive representation.'
71: \E
1.1 noro 72:
73: @iftex
74: @tex
1.2 noro 75: \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 ))$
76: \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 77: @end tex
78: @end iftex
79: @ifinfo
80: @example
81: (x+y+z)^2 = 1 x^2 + (2 y + (2 z)) x + ((2 z) y + (1 z^2 ))
82: @end example
83: @end ifinfo
84:
85: @noindent
1.2 noro 86: \BJP
1.1 noro 87: $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
88: $BI=8=$H8F$V(B.
1.2 noro 89: \E
90: \BEG
91: On the other hand,
92: we call a representation the distributed representation of a polynomial,
93: if a polynomial is represented, according to its original meaning,
94: as a sum of monomials,
95: where a monomial is the product of power product of variables
96: and a coefficient. We call a polynomial, represented in such an
97: internal format, a distributed polynomial. (This naming may sounds
98: something strange.)
99: \E
1.1 noro 100:
101: @iftex
102: @tex
1.2 noro 103: \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$
104: \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 105: @end tex
106: @end iftex
107: @ifinfo
108: @example
109: (x+y+z)^2 = 1 x^2 + 2 xy + 2 xz + 1 y^2 + 2 yz +1 z^2$
110: @end example
111: @end ifinfo
112:
113: @noindent
1.2 noro 114: \BJP
1.1 noro 115: $B%0%l%V%J4pDl7W;;$K$*$$$F$O(B, $BC19`<0$KCmL\$7$FA`:n$r9T$&$?$aB?9`<0$,J,;6I=8=(B
116: $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,
117: $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.
118: $B$3$3$G(B, $B8e$N@bL@$N$?$a$K(B, $B$$$/$D$+$N8@MU$rDj5A$7$F$*$/(B.
1.2 noro 119: \E
120: \BEG
121: For computation of Groebner basis, efficient operation is expected if
122: polynomials are represented in a distributed representation,
123: because major operations for Groebner basis are performed with respect
124: to monomials.
125: From this view point, we provide the object type distributed polynomial
126: with its object identification number 9, and objects having such a type
127: are available by @b{Asir} language.
128:
129: Here, we provide several definitions for the later description.
130: \E
1.1 noro 131:
132: @table @b
1.2 noro 133: \BJP
1.1 noro 134: @item $B9`(B (term)
135: $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 136: \E
137: \BEG
138: @item term
139: The power product of variables, i.e., a monomial with coefficient 1.
140: In an @b{Asir} session, it is displayed in the form like
141: \E
1.1 noro 142:
143: @example
144: <<0,1,2,3,4>>
145: @end example
146:
1.2 noro 147: \BJP
1.1 noro 148: $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
149: $B$r<($9(B. $B3FJQ?t$r(B @code{a}, @code{b}, @code{c}, @code{d}, @code{e} $B$H$9$k$H(B
150: $B$3$N9`$O(B @code{b*c^2*d^3*e^4} $B$rI=$9(B.
1.2 noro 151: \E
152: \BEG
153: and also can be input in such a form.
154: This example shows a term in 5 variables. If we assume the 5 variables
155: as @code{a}, @code{b}, @code{c}, @code{d}, and @code{e},
156: the term represents @code{b*c^2*d^3*e^4} in the ordinary expression.
157: \E
1.1 noro 158:
1.2 noro 159: \BJP
1.1 noro 160: @item $B9`=g=x(B (term order)
161: $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 162: \E
163: \BEG
164: @item term order
165: Terms are ordered according to a total order with the following properties.
166: \E
1.1 noro 167:
168: @enumerate
169: @item
1.2 noro 170: \JP $BG$0U$N9`(B @code{t} $B$KBP$7(B @code{t} > 1
171: \EG For all @code{t} @code{t} > 1.
1.1 noro 172:
173: @item
1.2 noro 174: \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}
175: \EG For all @code{t}, @code{s}, @code{u} @code{t} > @code{s} implies @code{tu} > @code{su}.
1.1 noro 176: @end enumerate
177:
1.2 noro 178: \BJP
1.1 noro 179: $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)
180: $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 181: \E
182: \BEG
183: Such a total order is called a term ordering. A term ordering is specified
184: by a variable ordering (a list of variables) and a type of term ordering
185: (an integer, a list or a matrix).
186: \E
1.1 noro 187:
1.2 noro 188: \BJP
1.1 noro 189: @item $BC19`<0(B (monomial)
190: $B9`$H78?t$N@Q(B.
1.2 noro 191: \E
192: \BEG
193: @item monomial
194: The product of a term and a coefficient.
195: In an @b{Asir} session, it is displayed in the form like
196: \E
1.1 noro 197:
198: @example
199: 2*<<0,1,2,3,4>>
200: @end example
201:
1.2 noro 202: \JP $B$H$$$&7A$GI=<($5$l(B, $B$^$?(B, $B$3$N7A$GF~NO2DG=$G$"$k(B.
203: \EG and also can be input in such a form.
1.1 noro 204:
1.2 noro 205: \BJP
1.19 noro 206: @item $BF,9`(B (head term)
1.1 noro 207: @itemx $BF,C19`<0(B (head monomial)
208: @itemx $BF,78?t(B (head coefficient)
209: $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
210: $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
211: $B$H8F$V(B.
1.2 noro 212: \E
213: \BEG
1.19 noro 214: @item head term
1.2 noro 215: @itemx head monomial
216: @itemx head coefficient
217:
218: Monomials in a distributed polynomial is sorted by a total order.
219: In such representation, we call the monomial that is maximum
220: with respect to the order the head monomial, and its term and coefficient
221: the head term and the head coefficient respectively.
222: \E
1.1 noro 223: @end table
224:
1.20 takayama 225: @noindent
226: ChangeLog
227: @itemize @bullet
228: \BJP
229: @item $BJ,;6I=8=B?9`<0$OG$0U$N%*%V%8%'%/%H$r78?t$K$b$F$k$h$&$K$J$C$?(B.
230: $B$^$?2C72$N(Bk$B@.J,$NMWAG$r<!$N7A<0(B <<d0,d1,...:k>> $B$GI=8=$9$k$h$&$K$J$C$?(B (2017-08-31).
231: \E
232: \BEG
233: @item Distributed polynomials accept objects as coefficients.
234: The k-th element of a free module is expressed as <<d0,d1,...:k>> (2017-08-31).
235: \E
236: @item
237: 1.15 algnum.c,
238: 1.53 ctrl.c,
239: 1.66 dp-supp.c,
240: 1.105 dp.c,
241: 1.73 gr.c,
242: 1.4 reduct.c,
243: 1.16 _distm.c,
244: 1.17 dalg.c,
245: 1.52 dist.c,
246: 1.20 distm.c,
247: 1.8 gmpq.c,
248: 1.238 engine/nd.c,
249: 1.102 ca.h,
250: 1.411 version.h,
251: 1.28 cpexpr.c,
252: 1.42 pexpr.c,
253: 1.20 pexpr_body.c,
254: 1.40 spexpr.c,
255: 1.27 arith.c,
256: 1.77 eval.c,
257: 1.56 parse.h,
258: 1.37 parse.y,
259: 1.8 stdio.c,
260: 1.31 plotf.c
261: @end itemize
262:
1.2 noro 263: \BJP
1.1 noro 264: @node $B%U%!%$%k$NFI$_9~$_(B,,, $B%0%l%V%J4pDl$N7W;;(B
265: @section $B%U%!%$%k$NFI$_9~$_(B
1.2 noro 266: \E
267: \BEG
268: @node Reading files,,, Groebner basis computation
269: @section Reading files
270: \E
1.1 noro 271:
272: @noindent
1.2 noro 273: \BJP
1.1 noro 274: $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 275: @code{dp_gr_mod_main()}, @code{dp_gr_f_main()}
276: $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 277: $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.
278: $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
279: $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 280: $B%i%$%V%i%j%G%#%l%/%H%j$KCV$+$l$F$$$k(B.
1.2 noro 281: \E
282: \BEG
1.5 noro 283: Facilities for computing Groebner bases are
284: @code{dp_gr_main()}, @code{dp_gr_mod_main()}and @code{dp_gr_f_main()}.
285: To call these functions,
286: it is necessary to set several parameters correctly and it is convenient
287: to use a set of interface functions provided in the library file
288: @samp{gr}.
1.2 noro 289: The facilities will be ready to use after you load the package by
290: @code{load()}. The package @samp{gr} is placed in the standard library
1.5 noro 291: directory of @b{Asir}.
1.2 noro 292: \E
1.1 noro 293:
294: @example
295: [0] load("gr")$
296: @end example
297:
1.2 noro 298: \BJP
1.1 noro 299: @node $B4pK\E*$JH!?t(B,,, $B%0%l%V%J4pDl$N7W;;(B
300: @section $B4pK\E*$JH!?t(B
1.2 noro 301: \E
302: \BEG
303: @node Fundamental functions,,, Groebner basis computation
304: @section Fundamental functions
305: \E
1.1 noro 306:
307: @noindent
1.2 noro 308: \BJP
1.1 noro 309: @samp{gr} $B$G$O?tB?$/$NH!?t$,Dj5A$5$l$F$$$k$,(B, $BD>@\(B
310: $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.
311: $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,
312: @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 313: \E
314: \BEG
315: There are many functions and options defined in the package @samp{gr}.
316: Usually not so many of them are used. Top level functions for Groebner
317: basis computation are the following three functions.
318:
319: In the following description, @var{plist}, @var{vlist}, @var{order}
320: and @var{p} stand for a list of polynomials, a list of variables
321: (indeterminates), a type of term ordering and a prime less than
322: @code{2^27} respectively.
323: \E
1.1 noro 324:
325: @table @code
326: @item gr(@var{plist},@var{vlist},@var{order})
327:
1.2 noro 328: \BJP
1.1 noro 329: Gebauer-Moeller $B$K$h$k(B useless pair elimination criteria, sugar
330: strategy $B$*$h$S(B Traverso $B$K$h$k(B trace-lifting $B$rMQ$$$?(B Buchberger $B%"%k(B
331: $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 332: \E
333: \BEG
334: Function that computes Groebner bases over the rationals. The
335: algorithm is Buchberger algorithm with useless pair elimination
336: criteria by Gebauer-Moeller, sugar strategy and trace-lifting by
337: Traverso. For ordinary computation, this function is used.
338: \E
1.1 noro 339:
340: @item hgr(@var{plist},@var{vlist},@var{order})
341:
1.2 noro 342: \BJP
1.1 noro 343: $BF~NOB?9`<0$r@F<!2=$7$?8e(B @code{gr()} $B$N%0%l%V%J4pDl8uJd@8@.It$K$h$j8u(B
344: $BJd@8@.$7(B, $BHs@F<!2=(B, interreduce $B$7$?$b$N$r(B @code{gr()} $B$N%0%l%V%J4pDl(B
345: $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)
346: $B$N>l9g(B, sugar strategy $B$,78?tKDD%$r0z$-5/$3$9>l9g$,$"$k(B. $B$3$N$h$&$J>l(B
347: $B9g(B, strategy $B$r@F<!2=$K$h$k(B strategy $B$KCV$-49$($k$3$H$K$h$j78?tKDD%$r(B
348: $BM^@)$9$k$3$H$,$G$-$k>l9g$,B?$$(B.
1.2 noro 349: \E
350: \BEG
351: After homogenizing the input polynomials a candidate of the \gr basis
352: is computed by trace-lifting. Then the candidate is dehomogenized and
353: checked whether it is indeed a Groebner basis of the input. Sugar
354: strategy often causes intermediate coefficient swells. It is
355: empirically known that the combination of homogenization and supresses
356: the swells for such cases.
357: \E
1.1 noro 358:
359: @item gr_mod(@var{plist},@var{vlist},@var{order},@var{p})
360:
1.2 noro 361: \BJP
1.1 noro 362: Gebauer-Moeller $B$K$h$k(B useless pair elimination criteria, sugar
363: strategy $B$*$h$S(B Buchberger $B%"%k%4%j%:%`$K$h$k(B GF(p) $B78?t%0%l%V%J4pDl7W(B
364: $B;;H!?t(B.
1.2 noro 365: \E
366: \BEG
367: Function that computes Groebner bases over GF(@var{p}). The same
368: algorithm as @code{gr()} is used.
369: \E
1.1 noro 370:
371: @end table
372:
1.2 noro 373: \BJP
1.1 noro 374: @node $B7W;;$*$h$SI=<($N@)8f(B,,, $B%0%l%V%J4pDl$N7W;;(B
375: @section $B7W;;$*$h$SI=<($N@)8f(B
1.2 noro 376: \E
377: \BEG
378: @node Controlling Groebner basis computations,,, Groebner basis computation
379: @section Controlling Groebner basis computations
380: \E
1.1 noro 381:
382: @noindent
1.2 noro 383: \BJP
1.1 noro 384: $B%0%l%V%J4pDl$N7W;;$K$*$$$F(B, $B$5$^$6$^$J%Q%i%a%?@_Dj$r9T$&$3$H$K$h$j7W;;(B,
385: $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()}
386: $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
387: $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 388: \E
389: \BEG
390: One can cotrol a Groebner basis computation by setting various parameters.
391: These parameters can be set and examined by a built-in function
392: @code{dp_gr_flags()}. Without argument it returns the current settings.
393: \E
1.1 noro 394:
395: @example
396: [100] dp_gr_flags();
1.5 noro 397: [Demand,0,NoSugar,0,NoCriB,0,NoGC,0,NoMC,0,NoRA,0,NoGCD,0,Top,0,
398: ShowMag,1,Print,1,Stat,0,Reverse,0,InterReduce,0,Multiple,0]
1.1 noro 399: [101]
400: @end example
401:
1.2 noro 402: \BJP
1.1 noro 403: $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
404: $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 405: \E
406: \BEG
407: The return value is a list which contains the names of parameters and their
408: values. The meaning of the parameters are as follows. `on' means that the
409: parameter is not zero.
410: \E
1.1 noro 411:
412: @table @code
413: @item NoSugar
1.2 noro 414: \BJP
1.1 noro 415: on $B$N>l9g(B, sugar strategy $B$NBe$o$j$K(B Buchberger$B$N(B normal strategy $B$,MQ(B
416: $B$$$i$l$k(B.
1.2 noro 417: \E
418: \BEG
419: If `on', Buchberger's normal strategy is used instead of sugar strategy.
420: \E
1.1 noro 421:
422: @item NoCriB
1.2 noro 423: \JP on $B$N>l9g(B, $BITI,MWBP8!=P5,=`$N$&$A(B, $B5,=`(B B $B$rE,MQ$7$J$$(B.
424: \EG If `on', criterion B among the Gebauer-Moeller's criteria is not applied.
1.1 noro 425:
426: @item NoGC
1.2 noro 427: \JP on $B$N>l9g(B, $B7k2L$,%0%l%V%J4pDl$K$J$C$F$$$k$+$I$&$+$N%A%'%C%/$r9T$o$J$$(B.
428: \BEG
429: If `on', the check that a Groebner basis candidate is indeed a Groebner basis,
430: is not executed.
431: \E
1.1 noro 432:
433: @item NoMC
1.2 noro 434: \BJP
1.1 noro 435: on $B$N>l9g(B, $B7k2L$,F~NO%$%G%"%k$HF1Ey$N%$%G%"%k$G$"$k$+$I$&$+$N%A%'%C%/(B
436: $B$r9T$o$J$$(B.
1.2 noro 437: \E
438: \BEG
439: If `on', the check that the resulting polynomials generates the same ideal as
440: the ideal generated by the input, is not executed.
441: \E
1.1 noro 442:
443: @item NoRA
1.2 noro 444: \BJP
1.1 noro 445: on $B$N>l9g(B, $B7k2L$r(B reduced $B%0%l%V%J4pDl$K$9$k$?$a$N(B
446: interreduce $B$r9T$o$J$$(B.
1.2 noro 447: \E
448: \BEG
449: If `on', the interreduction, which makes the Groebner basis reduced, is not
450: executed.
451: \E
1.1 noro 452:
453: @item NoGCD
1.2 noro 454: \BJP
1.1 noro 455: 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,
456: $B78?t$N(B content $B$r$H$i$J$$(B.
1.2 noro 457: \E
458: \BEG
459: If `on', content removals are not executed during a Groebner basis computation
460: over a rational function field.
461: \E
1.1 noro 462:
463: @item Top
1.2 noro 464: \JP on $B$N>l9g(B, normal form $B7W;;$K$*$$$FF,9`>C5n$N$_$r9T$&(B.
465: \EG If `on', Only the head term of the polynomial being reduced is reduced.
1.1 noro 466:
1.2 noro 467: @comment @item Interreduce
468: @comment \BJP
469: @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
470: @comment $B$h$k(B normal form $B$GCV$-49$($k(B.
471: @comment \E
472: @comment \BEG
473: @comment If `on', intermediate basis elements are reduced by using a newly generated
474: @comment basis element.
475: @comment \E
1.1 noro 476:
477: @item Reverse
1.2 noro 478: \BJP
1.1 noro 479: 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
480: $B@h$7$FA*$V(B.
1.2 noro 481: \E
482: \BEG
483: If `on', the selection strategy of reducer in a normal form computation
484: is such that a newer reducer is used first.
485: \E
1.1 noro 486:
487: @item Print
1.2 noro 488: \JP on $B$N>l9g(B, $B%0%l%V%J4pDl7W;;$NESCf$K$*$1$k$5$^$6$^$J>pJs$rI=<($9$k(B.
489: \BEG
490: If `on', various informations during a Groebner basis computation is
491: displayed.
492: \E
1.1 noro 493:
1.7 noro 494: @item PrintShort
495: \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.
496: \BEG
497: If `on' and Print is `off', short information during a Groebner basis computation is
498: displayed.
499: \E
500:
1.1 noro 501: @item Stat
1.2 noro 502: \BJP
1.1 noro 503: 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
504: $B$l$k%G!<%?$NFb(B, $B=87W%G!<%?$N$_$,I=<($5$l$k(B.
1.2 noro 505: \E
506: \BEG
507: If `on', a summary of informations is shown after a Groebner basis
508: computation. Note that the summary is always shown if @code{Print} is `on'.
509: \E
1.1 noro 510:
511: @item ShowMag
1.2 noro 512: \BJP
1.1 noro 513: 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
514: $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 515: \E
516: \BEG
517: If `on' and @code{Print} is `on', the sum of bit length of
518: coefficients of a generated basis element, which we call @var{magnitude},
519: is shown after every normal computation. After comleting the
520: computation the maximal value among the sums is shown.
521: \E
1.1 noro 522:
1.7 noro 523: @item Content
524: @itemx Multiple
1.2 noro 525: \BJP
1.7 noro 526: 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
527: @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
528: $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
529: GCD $B7W;;$,9T$o$l0lHL$K$O8zN($,0-$/$J$k$,(B, @code{Content} $B$r(B 2 $BDxEY(B
1.1 noro 530: $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 531: backward compatibility $B$N$?$a!"(B@code{Multiple} $B$G@0?tCM$r;XDj$G$-$k(B.
1.2 noro 532: \E
533: \BEG
1.7 noro 534: If a non-zero rational number, in a normal form computation
1.2 noro 535: over the rationals, the integer content of the polynomial being
1.7 noro 536: reduced is removed when its magnitude becomes @code{Content} times
1.2 noro 537: larger than a registered value, which is set to the magnitude of the
538: input polynomial. After each content removal the registered value is
1.7 noro 539: set to the magnitude of the resulting polynomial. @code{Content} is
1.2 noro 540: equal to 1, the simiplification is done after every normal form computation.
1.7 noro 541: It is empirically known that it is often efficient to set @code{Content} to 2
1.2 noro 542: for the case where large integers appear during the computation.
1.7 noro 543: An integer value can be set by the keyword @code{Multiple} for
544: backward compatibility.
1.2 noro 545: \E
1.1 noro 546:
547: @item Demand
1.2 noro 548:
549: \BJP
1.1 noro 550: $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
551: $BCf$K$*$+$l$:(B, $B$=$N%G%#%l%/%H%jCf$K%P%$%J%j%G!<%?$H$7$FCV$+$l(B, $B$=$NB?9`(B
552: $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
553: $B9`<0$O(B, $BFbIt$G$N%$%s%G%C%/%9$r%U%!%$%kL>$K;}$D%U%!%$%k$K3JG<$5$l$k(B.
554: $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
555: $B$?$a(B, $B%f!<%6$,@UG$$r;}$C$F>C5n$9$kI,MW$,$"$k(B.
1.2 noro 556: \E
557: \BEG
558: If the value (a character string) is a valid directory name, then
559: generated basis elements are put in the directory and are loaded on
560: demand during normal form computations. Each elements is saved in the
561: binary form and its name coincides with the index internally used in
562: the computation. These binary files are not removed automatically
563: and one should remove them by hand.
564: \E
1.1 noro 565: @end table
566:
567: @noindent
1.2 noro 568: \JP @code{Print} $B$,(B 0 $B$G$J$$>l9g<!$N$h$&$J%G!<%?$,I=<($5$l$k(B.
569: \EG If @code{Print} is `on', the following informations are shown.
1.1 noro 570:
571: @example
572: [93] gr(cyclic(4),[c0,c1,c2,c3],0)$
573: mod= 99999989, eval = []
574: (0)(0)<<0,2,0,0>>(2,3),nb=2,nab=5,rp=2,sugar=2,mag=4
575: (0)(0)<<0,1,2,0>>(1,2),nb=3,nab=6,rp=2,sugar=3,mag=4
576: (0)(0)<<0,1,1,2>>(0,1),nb=4,nab=7,rp=3,sugar=4,mag=6
577: .
578: (0)(0)<<0,0,3,2>>(5,6),nb=5,nab=8,rp=2,sugar=5,mag=4
579: (0)(0)<<0,1,0,4>>(4,6),nb=6,nab=9,rp=3,sugar=5,mag=4
580: (0)(0)<<0,0,2,4>>(6,8),nb=7,nab=10,rp=4,sugar=6,mag=6
581: ....gb done
582: reduceall
583: .......
584: membercheck
585: (0,0)(0,0)(0,0)(0,0)
586: gbcheck total 8 pairs
587: ........
1.5 noro 588: UP=(0,0)SP=(0,0)SPM=(0,0)NF=(0,0)NFM=(0.010002,0)ZNFM=(0.010002,0)
589: 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
590: D=12 ZR=5 NZR=6 Max_mag=6
1.1 noro 591: [94]
592: @end example
593:
594: @noindent
1.2 noro 595: \BJP
1.1 noro 596: $B:G=i$KI=<($5$l$k(B @code{mod}, @code{eval} $B$O(B, trace-lifting $B$GMQ$$$i$l$kK!(B
597: $B$G$"$k(B. @code{mod} $B$OAG?t(B, @code{eval} $B$OM-M}<078?t$N>l9g$KMQ$$$i$l$k(B
598: $B?t$N%j%9%H$G$"$k(B.
1.2 noro 599: \E
600: \BEG
601: In this example @code{mod} and @code{eval} indicate moduli used in
602: trace-lifting. @code{mod} is a prime and @code{eval} is a list of integers
603: used for evaluation when the ground field is a field of rational functions.
604: \E
1.1 noro 605:
606: @noindent
1.2 noro 607: \JP $B7W;;ESCf$GB?9`<0$,@8@.$5$l$kKh$K<!$N7A$N%G!<%?$,I=<($5$l$k(B.
608: \EG The following information is shown after every normal form computation.
1.1 noro 609:
610: @example
611: (TNF)(TCONT)HT(INDEX),nb=NB,nab=NAB,rp=RP,sugar=S,mag=M
612: @end example
613:
614: @noindent
1.2 noro 615: \JP $B$=$l$i$N0UL#$O<!$NDL$j(B.
616: \EG Meaning of each component is as follows.
1.1 noro 617:
618: @table @code
1.2 noro 619: \BJP
1.1 noro 620: @item TNF
1.2 noro 621:
1.1 noro 622: normal form $B7W;;;~4V(B ($BIC(B)
623:
624: @item TCONT
1.2 noro 625:
1.1 noro 626: content $B7W;;;~4V(B ($BIC(B)
627:
628: @item HT
1.2 noro 629:
1.1 noro 630: $B@8@.$5$l$?B?9`<0$NF,9`(B
631:
632: @item INDEX
1.2 noro 633:
1.1 noro 634: S-$BB?9`<0$r9=@.$9$kB?9`<0$N%$%s%G%C%/%9$N%Z%"(B
635:
636: @item NB
1.2 noro 637:
1.1 noro 638: $B8=:_$N(B, $B>iD9@-$r=|$$$?4pDl$N?t(B
639:
640: @item NAB
1.2 noro 641:
1.1 noro 642: $B8=:_$^$G$K@8@.$5$l$?4pDl$N?t(B
643:
644: @item RP
1.2 noro 645:
1.1 noro 646: $B;D$j$N%Z%"$N?t(B
647:
648: @item S
1.2 noro 649:
1.1 noro 650: $B@8@.$5$l$?B?9`<0$N(B sugar $B$NCM(B
651:
652: @item M
1.2 noro 653:
1.1 noro 654: $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 655: \E
656: \BEG
657: @item TNF
658:
659: CPU time for normal form computation (second)
660:
661: @item TCONT
662:
663: CPU time for content removal(second)
664:
665: @item HT
666:
667: Head term of the generated basis element
668:
669: @item INDEX
670:
671: Pair of indices which corresponds to the reduced S-polynomial
672:
673: @item NB
674:
675: Number of basis elements after removing redundancy
676:
677: @item NAB
678:
679: Number of all the basis elements
680:
681: @item RP
682:
683: Number of remaining pairs
684:
685: @item S
686:
687: Sugar of the generated basis element
688:
689: @item M
690:
691: Magnitude of the genrated basis element (shown if @code{ShowMag} is `on'.)
692: \E
1.1 noro 693: @end table
694:
695: @noindent
1.2 noro 696: \BJP
1.1 noro 697: $B:G8e$K(B, $B=87W%G!<%?$,I=<($5$l$k(B. $B0UL#$O<!$NDL$j(B.
698: ($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 699: \E
700: \BEG
701: The summary of the informations shown after a Groebner basis
702: computation is as follows. If a component shows timings and it
703: contains two numbers, they are a pair of time for computation and time
704: for garbage colection.
705: \E
1.1 noro 706:
707: @table @code
1.2 noro 708: \BJP
1.1 noro 709: @item UP
1.2 noro 710:
1.1 noro 711: $B%Z%"$N%j%9%H$NA`:n$K$+$+$C$?;~4V(B
712:
713: @item SP
1.2 noro 714:
1.1 noro 715: $BM-M}?t>e$N(B S-$BB?9`<07W;;;~4V(B
716:
717: @item SPM
1.2 noro 718:
1.1 noro 719: $BM-8BBN>e$N(B S-$BB?9`<07W;;;~4V(B
720:
721: @item NF
1.2 noro 722:
1.1 noro 723: $BM-M}?t>e$N(B normal form $B7W;;;~4V(B
724:
725: @item NFM
1.2 noro 726:
1.1 noro 727: $BM-8BBN>e$N(B normal form $B7W;;;~4V(B
728:
729: @item ZNFM
1.2 noro 730:
1.1 noro 731: @code{NFM} $B$NFb(B, 0 $B$X$N(B reduction $B$K$+$+$C$?;~4V(B
732:
733: @item PZ
1.2 noro 734:
1.1 noro 735: content $B7W;;;~4V(B
736:
737: @item NP
1.2 noro 738:
1.1 noro 739: $BM-M}?t78?tB?9`<0$N78?t$KBP$9$k>jM>1i;;$N7W;;;~4V(B
740:
741: @item MP
1.2 noro 742:
1.1 noro 743: S-$BB?9`<0$r@8@.$9$k%Z%"$NA*Br$K$+$+$C$?;~4V(B
744:
745: @item RA
1.2 noro 746:
1.1 noro 747: interreduce $B7W;;;~4V(B
748:
749: @item MC
1.2 noro 750:
1.1 noro 751: trace-lifting $B$K$*$1$k(B, $BF~NOB?9`<0$N%a%s%P%7%C%W7W;;;~4V(B
752:
753: @item GC
1.2 noro 754:
1.1 noro 755: $B7k2L$N%0%l%V%J4pDl8uJd$N%0%l%V%J4pDl%A%'%C%/;~4V(B
756:
757: @item T
1.2 noro 758:
1.1 noro 759: $B@8@.$5$l$?%Z%"$N?t(B
760:
761: @item B, M, F, D
1.2 noro 762:
1.1 noro 763: $B3F(B criterion $B$K$h$j=|$+$l$?%Z%"$N?t(B
764:
765: @item ZR
1.2 noro 766:
1.1 noro 767: 0 $B$K(B reduce $B$5$l$?%Z%"$N?t(B
768:
769: @item NZR
1.2 noro 770:
1.1 noro 771: 0 $B$G$J$$B?9`<0$K(B reduce $B$5$l$?%Z%"$N?t(B
772:
773: @item Max_mag
1.2 noro 774:
1.1 noro 775: $B@8@.$5$l$?B?9`<0$N(B, $B78?t$N%S%C%HD9$NOB$N:GBgCM(B
1.2 noro 776: \E
777: \BEG
778: @item UP
779:
780: Time to manipulate the list of critical pairs
781:
782: @item SP
783:
784: Time to compute S-polynomials over the rationals
785:
786: @item SPM
787:
788: Time to compute S-polynomials over a finite field
789:
790: @item NF
791:
792: Time to compute normal forms over the rationals
793:
794: @item NFM
795:
796: Time to compute normal forms over a finite field
797:
798: @item ZNFM
799:
800: Time for zero reductions in @code{NFM}
801:
802: @item PZ
803:
804: Time to remove integer contets
805:
806: @item NP
807:
808: Time to compute remainders for coefficients of polynomials with coeffieints
809: in the rationals
810:
811: @item MP
812:
813: Time to select pairs from which S-polynomials are computed
814:
815: @item RA
816:
817: Time to interreduce the Groebner basis candidate
818:
819: @item MC
1.1 noro 820:
1.2 noro 821: Time to check that each input polynomial is a member of the ideal
822: generated by the Groebner basis candidate.
823:
824: @item GC
825:
826: Time to check that the Groebner basis candidate is a Groebner basis
827:
828: @item T
829:
830: Number of critical pairs generated
831:
832: @item B, M, F, D
833:
834: Number of critical pairs removed by using each criterion
835:
836: @item ZR
837:
838: Number of S-polynomials reduced to 0
839:
840: @item NZR
841:
842: Number of S-polynomials reduced to non-zero results
843:
844: @item Max_mag
845:
846: Maximal magnitude among all the generated polynomials
847: \E
1.1 noro 848: @end table
849:
1.2 noro 850: \BJP
1.1 noro 851: @node $B9`=g=x$N@_Dj(B,,, $B%0%l%V%J4pDl$N7W;;(B
852: @section $B9`=g=x$N@_Dj(B
1.2 noro 853: \E
854: \BEG
855: @node Setting term orderings,,, Groebner basis computation
856: @section Setting term orderings
857: \E
1.1 noro 858:
859: @noindent
1.2 noro 860: \BJP
1.1 noro 861: $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
862: $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
863: $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
864: $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
865: $B9TNs$GI=8=$5$l$k(B.
1.2 noro 866: \E
867: \BEG
868: A term is internally represented as an integer vector whose components
869: are exponents with respect to variables. A variable list specifies the
870: correspondences between variables and components. A type of term ordering
871: specifies a total order for integer vectors. A type of term ordering is
872: represented by an integer, a list of integer or matrices.
873: \E
1.1 noro 874:
875: @noindent
1.2 noro 876: \JP $B4pK\E*$J9`=g=x7?$H$7$F<!$N(B 3 $B$D$,$"$k(B.
877: \EG There are following three fundamental types.
1.1 noro 878:
879: @table @code
1.2 noro 880: \JP @item 0 (DegRevLex; @b{$BA4<!?t5U<-=q<0=g=x(B})
881: \EG @item 0 (DegRevLex; @b{total degree reverse lexicographic ordering})
1.1 noro 882:
1.2 noro 883: \BJP
1.1 noro 884: $B0lHL$K(B, $B$3$N=g=x$K$h$k%0%l%V%J4pDl7W;;$,:G$b9bB.$G$"$k(B. $B$?$@$7(B,
885: $BJ}Dx<0$r2r$/$H$$$&L\E*$KMQ$$$k$3$H$O(B, $B0lHL$K$O$G$-$J$$(B. $B$3$N(B
886: $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,
887: $BB>$NJQ?t=g=x$X$N4pDlJQ49$N$?$a$N%=!<%9$H$7$FMQ$$$i$l$k(B.
1.2 noro 888: \E
889: \BEG
890: In general, computation by this ordering shows the fastest speed
891: in most Groebner basis computations.
892: However, for the purpose to solve polynomial equations, this type
893: of ordering is, in general, not so suitable.
894: The Groebner bases obtained by this ordering is used for computing
895: the number of solutions, solving ideal membership problem and seeds
896: for conversion to other Groebner bases under different ordering.
897: \E
1.1 noro 898:
1.2 noro 899: \JP @item 1 (DegLex; @b{$BA4<!?t<-=q<0=g=x(B})
900: \EG @item 1 (DegLex; @b{total degree lexicographic ordering})
1.1 noro 901:
1.2 noro 902: \BJP
1.1 noro 903: $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,
904: @code{DegRevLex} $B$HF1MMD>@\$=$N7k2L$rMQ$$$k$3$H$O:$Fq$G$"$k(B. $B$7$+$7(B,
905: $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
906: $B$r5a$a$F$$$k(B.
1.2 noro 907: \E
908: \BEG
909: By this type term ordering, Groebner bases are obtained fairly faster
910: than Lex (lexicographic) ordering, too.
911: Alike the @code{DegRevLex} ordering, the result, in general, cannot directly
912: be used for solving polynomial equations.
913: It is used, however, in such a way
914: that a Groebner basis is computed in this ordering after homogenization
915: to obtain the final lexicographic Groebner basis.
916: \E
1.1 noro 917:
1.2 noro 918: \JP @item 2 (Lex; @b{$B<-=q<0=g=x(B})
919: \EG @item 2 (Lex; @b{lexicographic ordering})
1.1 noro 920:
1.2 noro 921: \BJP
1.1 noro 922: $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
923: $B7W;;;~4V$,$+$+$j2a$.$k$N$,FqE@$G$"$k(B. $BFC$K(B, $B2r$,M-8B8D$N>l9g(B, $B7k2L$N(B
924: $B78?t$,6K$a$FD9Bg$JB?G\D9?t$K$J$k>l9g$,B?$$(B. $B$3$N>l9g(B, @code{gr()},
925: @code{hgr()} $B$K$h$k7W;;$,6K$a$FM-8z$K$J$k>l9g$,B?$$(B.
1.2 noro 926: \E
927: \BEG
928: Groebner bases computed by this ordering give the most convenient
929: Groebner bases for solving the polynomial equations.
930: The only and serious shortcoming is the enormously long computation
931: time.
932: It is often observed that the number coefficients of the result becomes
933: very very long integers, especially if the ideal is 0-dimensional.
934: For such a case, it is empirically true for many cases
935: that i.e., computation by
936: @code{gr()} and/or @code{hgr()} may be quite effective.
937: \E
1.1 noro 938: @end table
939:
940: @noindent
1.2 noro 941: \BJP
1.1 noro 942: $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.
943: $B$3$l$O(B,
1.2 noro 944: \E
945: \BEG
946: By combining these fundamental orderingl into a list, one can make
947: various term ordering called elimination orderings.
948: \E
1.1 noro 949:
950: @code{[[O1,L1],[O2,L2],...]}
951:
952: @noindent
1.2 noro 953: \BJP
1.1 noro 954: $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
955: $B?t$rI=$9(B. $B$3$N;XDj$O(B, $BJQ?t$r@hF,$+$i(B @code{L1}, @code{L2} , ...$B8D(B
956: $B$:$D$NAH$KJ,$1(B, $B$=$l$>$l$NJQ?t$K4X$7(B, $B=g$K(B @code{O1}, @code{O2},
957: ...$B$N9`=g=x7?$GBg>.$,7hDj$9$k$^$GHf3S$9$k$3$H$r0UL#$9$k(B. $B$3$N7?$N(B
958: $B=g=x$O0lHL$K>C5n=g=x$H8F$P$l$k(B.
1.2 noro 959: \E
960: \BEG
961: In this example @code{Oi} indicates 0, 1 or 2 and @code{Li} indicates
962: the number of variables subject to the correspoinding orderings.
963: This specification means the following.
964:
965: The variable list is separated into sub lists from left to right where
966: the @code{i}-th list contains @code{Li} members and it corresponds to
967: the ordering of type @code{Oi}. The result of a comparison is equal
968: to that for the leftmost different sub components. This type of ordering
969: is called an elimination ordering.
970: \E
1.1 noro 971:
972: @noindent
1.2 noro 973: \BJP
1.1 noro 974: $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
975: @code{m} $BNs$N<B?t9TNs(B @code{M} $B$,<!$N@-<A$r;}$D$H$9$k(B.
1.2 noro 976: \E
977: \BEG
978: Furthermore one can specify a term ordering by a matix.
979: Suppose that a real @code{n}, @code{m} matrix @code{M} has the
980: following properties.
981: \E
1.1 noro 982:
983: @enumerate
984: @item
1.2 noro 985: \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.
986: \BEG
987: For all integer verctors @code{v} of length @code{m} @code{Mv=0} is equivalent
988: to @code{v=0}.
989: \E
1.1 noro 990:
991: @item
1.2 noro 992: \BJP
1.1 noro 993: $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,
994: @code{Mv} $B$N(B 0 $B$G$J$$:G=i$N@.J,$OHsIi(B.
1.2 noro 995: \E
996: \BEG
997: For all non-negative integer vectors @code{v} the first non-zero component
998: of @code{Mv} is non-negative.
999: \E
1.1 noro 1000: @end enumerate
1001:
1002: @noindent
1.2 noro 1003: \BJP
1.1 noro 1004: $B$3$N;~(B, 2 $B$D$N%Y%/%H%k(B @code{t}, @code{s} $B$KBP$7(B,
1005: @code{t>s} $B$r(B, @code{M(t-s)} $B$N(B 0 $B$G$J$$:G=i$N@.J,$,HsIi(B,
1006: $B$GDj5A$9$k$3$H$K$h$j9`=g=x$,Dj5A$G$-$k(B.
1.2 noro 1007: \E
1008: \BEG
1009: Then we can define a term ordering such that, for two vectors
1010: @code{t}, @code{s}, @code{t>s} means that the first non-zero component
1011: of @code{M(t-s)} is non-negative.
1012: \E
1.1 noro 1013:
1014: @noindent
1.2 noro 1015: \BJP
1.1 noro 1016: $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
1017: @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 1018: \E
1019: \BEG
1020: Types of term orderings are used as arguments of functions such as
1021: @code{gr()}. It is also set internally by @code{dp_ord()} and is used
1022: during executions of various functions.
1023: \E
1.1 noro 1024:
1025: @noindent
1.2 noro 1026: \BJP
1.1 noro 1027: $B$3$l$i$N=g=x$N6qBNE*$JDj5A$*$h$S%0%l%V%J4pDl$K4X$9$k99$K>\$7$$2r@b$O(B
1028: @code{[Becker,Weispfenning]} $B$J$I$r;2>H$N$3$H(B.
1.2 noro 1029: \E
1030: \BEG
1031: For concrete definitions of term ordering and more information
1032: about Groebner basis, refer to, for example, the book
1033: @code{[Becker,Weispfenning]}.
1034: \E
1.1 noro 1035:
1036: @noindent
1.2 noro 1037: \JP $B9`=g=x7?$N@_Dj$NB>$K(B, $BJQ?t$N=g=x<+BN$b7W;;;~4V$KBg$-$J1F6A$rM?$($k(B.
1038: \BEG
1039: Note that the variable ordering have strong effects on the computation
1040: time as well as the choice of types of term orderings.
1041: \E
1.1 noro 1042:
1043: @example
1044: [90] B=[x^10-t,x^8-z,x^31-x^6-x-y]$
1045: [91] gr(B,[x,y,z,t],2);
1046: [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
1047: -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
1048: +(-12*t^16+72*t^13-28*t^11-180*t^10+112*t^8+240*t^7+28*t^6-127*t^5
1049: -167*t^4-55*t^3+30*t^2+58*t-15)*z^4,
1.5 noro 1050: (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
1051: +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
1052: +(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
1053: +27*t^3-16*t^2-30*t+7)*z^4,
1054: (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
1055: -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
1056: +10*t^4-36*t^3-11*t^2-5*t+9)*z^2,
1.1 noro 1057: -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 1058: -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
1059: +20*t^19+28*t^18-120*t^16-56*t^15+14*t^14+300*t^13+70*t^12-56*t^11
1060: -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
1061: -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
1062: -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 1063: -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 1064: 2*t^2*y^3+z^2*y^2+(-2*t^5+4*t^2-6)*z^4*y
1065: +(4*t^8-t^7-8*t^5+2*t^4-4*t^3+5*t^2-t)*z,
1.1 noro 1066: z^3*y^2+2*t^3*y+(-t^7+2*t^4+t^2-t)*z^2,
1067: -t*z*y^2-2*z^3*y+t^8-2*t^5-t^3+t^2,
1.5 noro 1068: -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 1069: [93] gr(B,[t,z,y,x],2);
1070: [x^10-t,x^8-z,x^31-x^6-x-y]
1071: @end example
1072:
1073: @noindent
1.2 noro 1074: \BJP
1.1 noro 1075: $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
1076: $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
1077: $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
1078: $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
1079: $B$3$H$G$"$j(B, $B$3$NNc$N>l9g$O(B, @code{t}, @code{z}, @code{y} $B$,4{$K(B
1080: @code{x} $B$GI=$5$l$F$$$k$3$H$+$i$3$N$h$&$J6KC<$J7k2L$H$J$C$?$o$1$G$"$k(B.
1081: $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
1082: $B$3$H$O>/$J$/(B, $B;n9T:x8m$,I,MW$J>l9g$b$"$k(B.
1.2 noro 1083: \E
1084: \BEG
1085: As you see in the above example, the Groebner base under variable
1086: ordering @code{[x,y,z,t]} has a lot of bases and each base itself is
1087: large. Under variable ordering @code{[t,z,y,x]}, however, @code{B} itself
1088: is already the Groebner basis.
1089: Roughly speaking, to obtain a Groebner base under the lexicographic
1090: ordering is to express the variables on the left (having higher order)
1091: in terms of variables on the right (having lower order).
1092: In the example, variables @code{t}, @code{z}, and @code{y} are already
1093: expressed by variable @code{x}, and the above explanation justifies
1094: such a drastic experimental results.
1095: In practice, however, optimum ordering for variables may not known
1096: beforehand, and some heuristic trial may be inevitable.
1.13 noro 1097: \E
1098:
1099: \BJP
1100: @node Weight ,,, $B%0%l%V%J4pDl$N7W;;(B
1101: @section Weight
1102: \E
1103: \BEG
1104: @node Weight,,, Groebner basis computation
1105: @section Weight
1106: \E
1107: \BJP
1108: $BA0@a$G>R2p$7$?9`=g=x$O(B, $B3FJQ?t$K(B weight ($B=E$_(B) $B$r@_Dj$9$k$3$H$G(B
1109: $B$h$j0lHLE*$J$b$N$H$J$k(B.
1110: \E
1111: \BEG
1.14 noro 1112: Term orderings introduced in the previous section can be generalized
1.13 noro 1113: by setting a weight for each variable.
1114: \E
1115: @example
1116: [0] dp_td(<<1,1,1>>);
1117: 3
1118: [1] dp_set_weight([1,2,3])$
1119: [2] dp_td(<<1,1,1>>);
1120: 6
1121: @end example
1122: \BJP
1123: $BC19`<0$NA4<!?t$r7W;;$9$k:](B, $B%G%U%)%k%H$G$O(B
1124: $B3FJQ?t$N;X?t$NOB$rA4<!?t$H$9$k(B. $B$3$l$O3FJQ?t$N(B weight $B$r(B 1 $B$H(B
1125: $B9M$($F$$$k$3$H$KAjEv$9$k(B. $B$3$NNc$G$O(B, $BBh0l(B, $BBhFs(B, $BBh;0JQ?t$N(B
1126: weight $B$r$=$l$>$l(B 1,2,3 $B$H;XDj$7$F$$$k(B. $B$3$N$?$a(B, @code{<<1,1,1>>}
1127: $B$NA4<!?t(B ($B0J2<$G$O$3$l$rC19`<0$N(B weight $B$H8F$V(B) $B$,(B @code{1*1+1*2+1*3=6} $B$H$J$k(B.
1128: weight $B$r@_Dj$9$k$3$H$G(B, $BF1$89`=g=x7?$N$b$H$G0[$J$k9`=g=x$,Dj5A$G$-$k(B.
1129: $BNc$($P(B, weight $B$r$&$^$/@_Dj$9$k$3$H$G(B, $BB?9`<0$r(B weighted homogeneous
1130: $B$K$9$k$3$H$,$G$-$k>l9g$,$"$k(B.
1131: \E
1132: \BEG
1133: By default, the total degree of a monomial is equal to
1134: the sum of all exponents. This means that the weight for each variable
1135: is set to 1.
1136: In this example, the weights for the first, the second and the third
1137: variable are set to 1, 2 and 3 respectively.
1138: Therefore the total degree of @code{<<1,1,1>>} under this weight,
1139: which is called the weight of the monomial, is @code{1*1+1*2+1*3=6}.
1.14 noro 1140: By setting weights, different term orderings can be set under a type of
1141: term ordeing. In some case a polynomial can
1142: be made weighted homogeneous by setting an appropriate weight.
1.13 noro 1143: \E
1144:
1145: \BJP
1146: $B3FJQ?t$KBP$9$k(B weight $B$r$^$H$a$?$b$N$r(B weight vector $B$H8F$V(B.
1147: $B$9$Y$F$N@.J,$,@5$G$"$j(B, $B%0%l%V%J4pDl7W;;$K$*$$$F(B, $BA4<!?t$N(B
1148: $BBe$o$j$KMQ$$$i$l$k$b$N$rFC$K(B sugar weight $B$H8F$V$3$H$K$9$k(B.
1149: sugar strategy $B$K$*$$$F(B, $BA4<!?t$NBe$o$j$K;H$o$l$k$+$i$G$"$k(B.
1150: $B0lJ}$G(B, $B3F@.J,$,I,$:$7$b@5$H$O8B$i$J$$(B weight vector $B$O(B,
1151: sugar weight $B$H$7$F@_Dj$9$k$3$H$O$G$-$J$$$,(B, $B9`=g=x$N0lHL2=$K$O(B
1152: $BM-MQ$G$"$k(B. $B$3$l$i$O(B, $B9TNs$K$h$k9`=g=x$N@_Dj$K$9$G$K8=$l$F(B
1153: $B$$$k(B. $B$9$J$o$A(B, $B9`=g=x$rDj5A$9$k9TNs$N3F9T$,(B, $B0l$D$N(B weight vector
1154: $B$H8+$J$5$l$k(B. $B$^$?(B, $B%V%m%C%/=g=x$O(B, $B3F%V%m%C%/$N(B
1155: $BJQ?t$KBP1~$9$k@.J,$N$_(B 1 $B$GB>$O(B 0 $B$N(B weight vector $B$K$h$kHf3S$r(B
1156: $B:G=i$K9T$C$F$+$i(B, $B3F%V%m%C%/Kh$N(B tie breaking $B$r9T$&$3$H$KAjEv$9$k(B.
1157: \E
1158:
1159: \BEG
1160: A list of weights for all variables is called a weight vector.
1161: A weight vector is called a sugar weight vector if
1162: its elements are all positive and it is used for computing
1163: a weighted total degree of a monomial, because such a weight
1164: is used instead of total degree in sugar strategy.
1165: On the other hand, a weight vector whose elements are not necessarily
1166: positive cannot be set as a sugar weight, but it is useful for
1167: generalizing term order. In fact, such a weight vector already
1168: appeared in a matrix order. That is, each row of a matrix defining
1169: a term order is regarded as a weight vector. A block order
1170: is also considered as a refinement of comparison by weight vectors.
1171: It compares two terms by using a weight vector whose elements
1172: corresponding to variables in a block is 1 and 0 otherwise,
1173: then it applies a tie breaker.
1.14 noro 1174: \E
1175:
1176: \BJP
1177: weight vector $B$N@_Dj$O(B @code{dp_set_weight()} $B$G9T$&$3$H$,$G$-$k(B
1178: $B$,(B, $B9`=g=x$r;XDj$9$k:]$NB>$N%Q%i%a%?(B ($B9`=g=x7?(B, $BJQ?t=g=x(B) $B$H(B
1179: $B$^$H$a$F@_Dj$G$-$k$3$H$,K>$^$7$$(B. $B$3$N$?$a(B, $B<!$N$h$&$J7A$G$b(B
1180: $B9`=g=x$,;XDj$G$-$k(B.
1181: \E
1182: \BEG
1183: A weight vector can be set by using @code{dp_set_weight()}.
1184: However it is more preferable if a weight vector can be set
1185: together with other parapmeters such as a type of term ordering
1186: and a variable order. This is realized as follows.
1187: \E
1.13 noro 1188:
1.14 noro 1189: @example
1190: [64] B=[x+y+z-6,x*y+y*z+z*x-11,x*y*z-6]$
1191: [65] dp_gr_main(B|v=[x,y,z],sugarweight=[3,2,1],order=0);
1192: [z^3-6*z^2+11*z-6,x+y+z-6,-y^2+(-z+6)*y-z^2+6*z-11]
1193: [66] dp_gr_main(B|v=[y,z,x],order=[[1,1,0],[0,1,0],[0,0,1]]);
1194: [x^3-6*x^2+11*x-6,x+y+z-6,-x^2+(-y+6)*x-y^2+6*y-11]
1195: [67] dp_gr_main(B|v=[y,z,x],order=[[x,1,y,2,z,3]]);
1196: [x+y+z-6,x^3-6*x^2+11*x-6,-x^2+(-y+6)*x-y^2+6*y-11]
1197: @end example
1198:
1199: \BJP
1200: $B$$$:$l$NNc$K$*$$$F$b(B, $B9`=g=x$O(B option $B$H$7$F;XDj$5$l$F$$$k(B.
1201: $B:G=i$NNc$G$O(B @code{v} $B$K$h$jJQ?t=g=x$r(B, @code{sugarweight} $B$K$h$j(B
1202: sugar weight vector $B$r(B, @code{order}$B$K$h$j9`=g=x7?$r;XDj$7$F$$$k(B.
1203: $BFs$DL\$NNc$K$*$1$k(B @code{order} $B$N;XDj$O(B matrix order $B$HF1MM$G$"$k(B.
1204: $B$9$J$o$A(B, $B;XDj$5$l$?(B weight vector $B$r:8$+$i=g$K;H$C$F(B weight $B$NHf3S(B
1205: $B$r9T$&(B. $B;0$DL\$NNc$bF1MM$G$"$k$,(B, $B$3$3$G$O(B weight vector $B$NMWAG$r(B
1206: $BJQ?tKh$K;XDj$7$F$$$k(B. $B;XDj$,$J$$$b$N$O(B 0 $B$H$J$k(B. $B;0$DL\$NNc$G$O(B,
1207: @code{order} $B$K$h$k;XDj$G$O9`=g=x$,7hDj$7$J$$(B. $B$3$N>l9g$K$O(B,
1208: tie breaker $B$H$7$FA4<!?t5U<-=q<0=g=x$,<+F0E*$K@_Dj$5$l$k(B.
1209: $B$3$N;XDjJ}K!$O(B, @code{dp_gr_main}, @code{dp_gr_mod_main} $B$J$I(B
1210: $B$NAH$_9~$_4X?t$G$N$_2DG=$G$"$j(B, @code{gr} $B$J$I$N%f!<%6Dj5A4X?t(B
1211: $B$G$OL$BP1~$G$"$k(B.
1212: \E
1213: \BEG
1214: In each example, a term ordering is specified as options.
1215: In the first example, a variable order, a sugar weight vector
1216: and a type of term ordering are specified by options @code{v},
1217: @code{sugarweight} and @code{order} respectively.
1218: In the second example, an option @code{order} is used
1219: to set a matrix ordering. That is, the specified weight vectors
1220: are used from left to right for comparing terms.
1221: The third example shows a variant of specifying a weight vector,
1222: where each component of a weight vector is specified variable by variable,
1223: and unspecified components are set to zero. In this example,
1224: a term order is not determined only by the specified weight vector.
1225: In such a case a tie breaker by the graded reverse lexicographic ordering
1226: is set automatically.
1227: This type of a term ordering specification can be applied only to builtin
1228: functions such as @code{dp_gr_main()}, @code{dp_gr_mod_main()}, not to
1229: user defined functions such as @code{gr()}.
1.2 noro 1230: \E
1.1 noro 1231:
1.2 noro 1232: \BJP
1.1 noro 1233: @node $BM-M}<0$r78?t$H$9$k%0%l%V%J4pDl7W;;(B,,, $B%0%l%V%J4pDl$N7W;;(B
1234: @section $BM-M}<0$r78?t$H$9$k%0%l%V%J4pDl7W;;(B
1.2 noro 1235: \E
1236: \BEG
1237: @node Groebner basis computation with rational function coefficients,,, Groebner basis computation
1238: @section Groebner basis computation with rational function coefficients
1239: \E
1.1 noro 1240:
1241: @noindent
1.2 noro 1242: \BJP
1.1 noro 1243: @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
1244: $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
1245: $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
1246: $BBN$N85$H$7$F07$&(B.
1.2 noro 1247: \E
1248: \BEG
1249: Such variables that appear within the input polynomials but
1250: not appearing in the input variable list are automatically treated
1251: as elements in the coefficient field
1252: by top level functions, such as @code{gr()}.
1253: \E
1.1 noro 1254:
1255: @example
1256: [64] gr([a*x+b*y-c,d*x+e*y-f],[x,y],2);
1257: [(-e*a+d*b)*x-f*b+e*c,(-e*a+d*b)*y+f*a-d*c]
1258: @end example
1259:
1260: @noindent
1.2 noro 1261: \BJP
1.1 noro 1262: $B$3$NNc$G$O(B, @code{a}, @code{b}, @code{c}, @code{d} $B$,78?tBN$N85$H$7$F(B
1263: $B07$o$l$k(B. $B$9$J$o$A(B, $BM-M}H!?tBN(B
1264: @b{F} = @b{Q}(@code{a},@code{b},@code{c},@code{d}) $B>e$N(B 2 $BJQ?tB?9`<04D(B
1265: @b{F}[@code{x},@code{y}] $B$K$*$1$k%0%l%V%J4pDl$r5a$a$k$3$H$K$J$k(B.
1266: $BCm0U$9$Y$-$3$H$O(B,
1267: $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
1268: $B$H$7$F$N6&DL0x;R$,$"$C$?>l9g$K$O(B, $B7k2L$+$i$=$N0x;R$O=|$+$l$F$$$k(B
1269: $B$?$a(B, $BM-M}?tBN>e$NB?9`<04D>e$NLdBj$H$7$F9M$($?>l9g$N7k2L$H$O0lHL(B
1270: $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
1271: $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
1272: $B;}$DM-M}<0$OJ,;6I=8=B?9`<0$N78?t$H$7$F$O5v$5$l$J$$(B.
1.2 noro 1273: \E
1274: \BEG
1275: In this example, variables @code{a}, @code{b}, @code{c}, and @code{d}
1276: are treated as elements in the coefficient field.
1277: In this case, a Groebner basis is computed
1278: on a bi-variate polynomial ring
1279: @b{F}[@code{x},@code{y}]
1280: over rational function field
1281: @b{F} = @b{Q}(@code{a},@code{b},@code{c},@code{d}).
1282: Notice that coefficients are considered as a member in a field.
1283: As a consequence, polynomial factors common to the coefficients
1284: are removed so that the result, in general, is different from
1285: the result that would be obtained when the problem is considered
1286: as a computation of Groebner basis over a polynomial ring
1287: with rational function coefficients.
1288: And note that coefficients of a distributed polynomial are limited
1289: to numbers and polynomials because of efficiency.
1290: \E
1.1 noro 1291:
1.2 noro 1292: \BJP
1.1 noro 1293: @node $B4pDlJQ49(B,,, $B%0%l%V%J4pDl$N7W;;(B
1294: @section $B4pDlJQ49(B
1.2 noro 1295: \E
1296: \BEG
1297: @node Change of ordering,,, Groebner basis computation
1298: @section Change of orderng
1299: \E
1.1 noro 1300:
1301: @noindent
1.2 noro 1302: \BJP
1.1 noro 1303: $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
1304: $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,
1305: $B$=$l$rF~NO$H$7$F<-=q<0=g=x$N%0%l%V%J4pDl$r7W;;$9$kJ}$,8zN($,$h$$>l9g(B
1306: $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
1307: $BJQ49$H8F$P$l$kJ}K!$K$h$j(B, Buchberger $B%"%k%4%j%:%`$K$h$i$:$K8zN(NI$/(B
1308: $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
1309: $BH!?t$,(B, $B%f!<%6Dj5AH!?t$H$7$F(B @samp{gr} $B$K$$$/$D$+Dj5A$5$l$F$$$k(B.
1310: $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
1311: $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
1312: @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 1313: \E
1314: \BEG
1315: When we compute a lex order Groebner basis, it is often efficient to
1316: compute it via Groebner basis with respect to another order such as
1317: degree reverse lex order, rather than to compute it directory by
1318: @code{gr()} etc. If we know that an input is a Groebner basis with
1319: respect to an order, we can apply special methods called change of
1320: ordering for a Groebner basis computation with respect to another
1321: order, without using Buchberger algorithm. The following two functions
1322: are ones for change of ordering such that they convert a Groebner
1323: basis @var{gbase} with respect to the variable order @var{vlist1} and
1324: the order type @var{order} into a lex Groebner basis with respect
1325: to the variable order @var{vlist2}.
1326: \E
1.1 noro 1327:
1328: @table @code
1329: @item tolex(@var{gbase},@var{vlist1},@var{order},@var{vlist2})
1330:
1.2 noro 1331: \BJP
1.1 noro 1332: $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.
1333: $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
1334: $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 1335: \E
1336: \BEG
1337: This function can be used only when @var{gbase} is an ideal over the
1338: rationals. The input @var{gbase} must be a Groebner basis with respect
1339: to the variable order @var{vlist1} and the order type @var{order}. Moreover
1340: the ideal generated by @var{gbase} must be zero-dimensional.
1341: This computes the lex Groebner basis of @var{gbase}
1342: by using the modular change of ordering algorithm. The algorithm first
1343: computes the lex Groebner basis over a finite field. Then each element
1344: in the lex Groebner basis over the rationals is computed with undetermined
1345: coefficient method and linear equation solving by Hensel lifting.
1346: \E
1.1 noro 1347:
1348: @item tolex_tl(@var{gbase},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1349:
1.2 noro 1350: \BJP
1.1 noro 1351: $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
1352: $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
1353: trace-lifting$B$K$*$1$k%0%l%V%J4pDl8uJd$NF,9`(B, $BF,78?t$N@-<A$rMxMQ$7$F(B,
1354: $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
1355: $B$k$?$a(B, $BC1$K(BBuchberger $B%"%k%4%j%:%`$r7+$jJV$9$h$j8zN($h$/7W;;$G$-$k(B.
1356: $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
1357: $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,
1358: $BD>@\<-=q<0=g=x$N7W;;$r9T$&$h$j8zN($,$h$$(B. ($B$b$A$m$sNc30$"$j(B. )
1359: $B0z?t(B @var{homo} $B$,(B 0 $B$G$J$$;~(B, @code{hgr()} $B$HF1MM$K@F<!2=$r7PM3$7$F(B
1360: $B7W;;$r9T$&(B.
1.2 noro 1361: \E
1362: \BEG
1363: This function computes the lex Groebner basis of @var{gbase}. The
1364: input @var{gbase} must be a Groebner basis with respect to the
1365: variable order @var{vlist1} and the order type @var{order}.
1366: Buchberger algorithm with trace lifting is used to compute the lex
1367: Groebner basis, however the Groebner basis check and the ideal
1368: membership check can be omitted by using several properties derived
1369: from the fact that the input is a Groebner basis. So it is more
1370: efficient than simple repetition of Buchberger algorithm. If the input
1371: is zero-dimensional, this function inserts automatically a computation
1372: of Groebner basis with respect to an elimination order, which makes
1373: the whole computation more efficient for many cases. If @var{homo} is
1374: not equal to 0, homogenization is used in each step.
1375: \E
1.1 noro 1376: @end table
1377:
1378: @noindent
1.2 noro 1379: \BJP
1.1 noro 1380: $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
1381: $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
1382: @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 1383: \E
1384: \BEG
1385: For zero-dimensional systems, there are several fuctions to
1386: compute the minimal polynomial of a polynomial and or a more compact
1387: representation for zeros of the system. They are all defined in @samp{gr}.
1388: Refer to the sections for each functions.
1389: \E
1.1 noro 1390:
1.2 noro 1391: \BJP
1.6 noro 1392: @node Weyl $BBe?t(B,,, $B%0%l%V%J4pDl$N7W;;(B
1393: @section Weyl $BBe?t(B
1394: \E
1395: \BEG
1396: @node Weyl algebra,,, Groebner basis computation
1397: @section Weyl algebra
1398: \E
1399:
1400: @noindent
1401:
1402: \BJP
1403: $B$3$l$^$G$O(B, $BDL>o$N2D49$JB?9`<04D$K$*$1$k%0%l%V%J4pDl7W;;$K$D$$$F(B
1404: $B=R$Y$F$-$?$,(B, $B%0%l%V%J4pDl$NM}O@$O(B, $B$"$k>r7o$rK~$?$9Hs2D49$J(B
1405: $B4D$K$b3HD%$G$-$k(B. $B$3$N$h$&$J4D$NCf$G(B, $B1~MQ>e$b=EMW$J(B,
1406: Weyl $BBe?t(B, $B$9$J$o$AB?9`<04D>e$NHyJ,:nMQAG4D$N1i;;$*$h$S(B
1407: $B%0%l%V%J4pDl7W;;$,(B Risa/Asir $B$K<BAu$5$l$F$$$k(B.
1408:
1409: $BBN(B @code{K} $B>e$N(B @code{n} $B<!85(B Weyl $BBe?t(B
1410: @code{D=K<x1,@dots{},xn,D1,@dots{},Dn>} $B$O(B
1411: \E
1412:
1413: \BEG
1414: So far we have explained Groebner basis computation in
1415: commutative polynomial rings. However Groebner basis can be
1416: considered in more general non-commutative rings.
1417: Weyl algebra is one of such rings and
1418: Risa/Asir implements fundamental operations
1419: in Weyl algebra and Groebner basis computation in Weyl algebra.
1420:
1421: The @code{n} dimensional Weyl algebra over a field @code{K},
1422: @code{D=K<x1,@dots{},xn,D1,@dots{},Dn>} is a non-commutative
1423: algebra which has the following fundamental relations:
1424: \E
1425:
1426: @code{xi*xj-xj*xi=0}, @code{Di*Dj-Dj*Di=0}, @code{Di*xj-xj*Di=0} (@code{i!=j}),
1427: @code{Di*xi-xi*Di=1}
1428:
1429: \BJP
1430: $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
1431: $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,
1432: @code{D} $B$N85$O(B, @code{x1^i1*@dots{}*xn^in*D1^j1*@dots{}*Dn^jn} $B$J$kC19`(B
1433: $B<0$N(B @code{K} $B@~7A7k9g$H$7$F=q$-I=$9$3$H$,$G$-$k(B.
1434: Risa/Asir $B$K$*$$$F$O(B, $B$3$NC19`<0$r(B, $B2D49$JB?9`<0$HF1MM$K(B
1435: @code{<<i1,@dots{},in,j1,@dots{},jn>>} $B$GI=$9(B. $B$9$J$o$A(B, @code{D} $B$N85$b(B
1436: $BJ,;6I=8=B?9`<0$H$7$FI=$5$l$k(B. $B2C8:;;$O(B, $B2D49$N>l9g$HF1MM$K(B, @code{+}, @code{-}
1437: $B$K$h$j(B
1438: $B<B9T$G$-$k$,(B, $B>h;;$O(B, $BHs2D49@-$r9MN8$7$F(B @code{dp_weyl_mul()} $B$H$$$&4X?t(B
1439: $B$K$h$j<B9T$9$k(B.
1440: \E
1441:
1442: \BEG
1443: @code{D} is the ring of differential operators whose coefficients
1444: are polynomials in @code{K[x1,@dots{},xn]} and
1445: @code{Di} denotes the differentiation with respect to @code{xi}.
1446: According to the commutation relation,
1447: elements of @code{D} can be represented as a @code{K}-linear combination
1448: of monomials @code{x1^i1*@dots{}*xn^in*D1^j1*@dots{}*Dn^jn}.
1449: In Risa/Asir, this type of monomial is represented
1450: by @code{<<i1,@dots{},in,j1,@dots{},jn>>} as in the case of commutative
1451: polynomial.
1452: That is, elements of @code{D} are represented by distributed polynomials.
1453: Addition and subtraction can be done by @code{+}, @code{-},
1454: but multiplication is done by calling @code{dp_weyl_mul()} because of
1455: the non-commutativity of @code{D}.
1456: \E
1457:
1458: @example
1459: [0] A=<<1,2,2,1>>;
1460: (1)*<<1,2,2,1>>
1461: [1] B=<<2,1,1,2>>;
1462: (1)*<<2,1,1,2>>
1463: [2] A*B;
1464: (1)*<<3,3,3,3>>
1465: [3] dp_weyl_mul(A,B);
1466: (1)*<<3,3,3,3>>+(1)*<<3,2,3,2>>+(4)*<<2,3,2,3>>+(4)*<<2,2,2,2>>
1467: +(2)*<<1,3,1,3>>+(2)*<<1,2,1,2>>
1468: @end example
1469:
1470: \BJP
1471: $B%0%l%V%J4pDl7W;;$K$D$$$F$b(B, Weyl $BBe?t@lMQ$N4X?t$H$7$F(B,
1472: $B<!$N4X?t$,MQ0U$7$F$"$k(B.
1473: \E
1474: \BEG
1475: The following functions are avilable for Groebner basis computation
1476: in Weyl algebra:
1477: \E
1478: @code{dp_weyl_gr_main()},
1479: @code{dp_weyl_gr_mod_main()},
1480: @code{dp_weyl_gr_f_main()},
1481: @code{dp_weyl_f4_main()},
1482: @code{dp_weyl_f4_mod_main()}.
1483: \BJP
1484: $B$^$?(B, $B1~MQ$H$7$F(B, global b $B4X?t$N7W;;$,<BAu$5$l$F$$$k(B.
1485: \E
1486: \BEG
1487: Computation of the global b function is implemented as an application.
1488: \E
1489:
1490: \BJP
1.23 noro 1491: @node $BB?9`<04D>e$N2C72(B,,, $B%0%l%V%J4pDl$N7W;;(B
1492: @section $BB?9`<04D>e$N2C72(B
1493: \E
1494: \BEG
1495: @node Module over a polynomial ring,,, Groebner basis computation
1496: @section Module over a polynomial ring
1497: \E
1498:
1499: @noindent
1500:
1501: \BJP
1502: $BB?9`<04D>e$N<+M32C72$N85$O(B, $B2C72C19`<0(B te_i $B$N@~7?OB$H$7$FFbItI=8=$5$l$k(B.
1503: $B$3$3$G(B t $B$OB?9`<04D$NC19`<0(B, e_i $B$O<+M32C72$NI8=`4pDl$G$"$k(B. $B2C72C19`<0$O(B, $BB?9`<04D$NC19`<0(B
1504: $B$K0LCV(B i $B$rDI2C$7$?(B @code{<<a,b,...,c:i>>} $B$GI=$9(B. $B2C72B?9`<0(B, $B$9$J$o$A2C72C19`<0$N@~7?OB$O(B,
1505: $B@_Dj$5$l$F$$$k2C729`=g=x$K$7$?$,$C$F9_=g$K@0Ns$5$l$k(B. $B2C729`=g=x$K$O0J2<$N(B3$B<oN`$,$"$k(B.
1506:
1507: @table @code
1508: @item TOP $B=g=x(B
1509:
1510: $B$3$l$O(B, te_i > se_j $B$H$J$k$N$O(B t>s $B$^$?$O(B (t=s $B$+$D(B i<j) $B$H$J$k$h$&$J9`=g=x$G$"$k(B. $B$3$3$G(B,
1511: t, s $B$NHf3S$OB?9`<04D$K@_Dj$5$l$F$$$k=g=x$G9T$&(B.
1512: $B$3$N7?$N=g=x$O(B, @code{dp_ord([0,Ord])} $B$K(B
1513: $B$h$j@_Dj$9$k(B. $B$3$3$G(B, @code{Ord} $B$OB?9`<04D$N=g=x7?$G$"$k(B.
1514:
1515: @item POT $B=g=x(B
1516:
1517: $B$3$l$O(B, te_i > se_j $B$H$J$k$N$O(B i<j $B$^$?$O(B (i=j $B$+$D(B t>s) $B$H$J$k$h$&$J9`=g=x$G$"$k(B. $B$3$3$G(B,
1518: t, s $B$NHf3S$OB?9`<04D$K@_Dj$5$l$F$$$k=g=x$G9T$&(B.
1519: $B$3$N7?$N=g=x$O(B, @code{dp_ord([1,Ord])} $B$K(B
1520: $B$h$j@_Dj$9$k(B. $B$3$3$G(B, @code{Ord} $B$OB?9`<04D$N=g=x7?$G$"$k(B.
1521:
1522: @item Schreyer $B7?=g=x(B
1523:
1524: $B3FI8=`4pDl(B e_i $B$KBP$7(B, $BJL$N<+M32C72$N2C72C19`<0(B T_i $B$,M?$($i$l$F$$$F(B, te_i > se_j $B$H$J$k$N$O(B
1525: tT_i > sT_j $B$^$?$O(B (tT_i=sT_j $B$+$D(B i<j) $B$H$J$k$h$&$J9`=g=x$G$"$k(B. $B$3$3$G(B tT_i, sT_j $B$N(B
1526: $BHf3S$O(B, $B$3$l$i$,=jB0$9$k<+M32C72$K@_Dj$5$l$F$$$k=g=x$G9T$&(B.
1527: $B$3$N7?$N=g=x$O(B, $BDL>o:F5"E*$K@_Dj$5$l$k(B. $B$9$J$o$A(B, T_i $B$,=jB0$9$k<+M32C72$N=g=x$b(B Schreyer $B7?(B
1528: $B$G$"$k$+(B, $B$^$?$O%\%H%`$H$J$k(B TOP, POT $B$J$I$N9`=g=x$H$J$k(B.
1529: $B$3$N7?$N=g=x$O(B @code{dpm_set_schreyer([H_1,H_2,...])} $B$K$h$j;XDj$9$k(B. $B$3$3$G(B,
1530: @code{H_i=[T_1,T_2,...]} $B$O2C72C19`<0$N%j%9%H$G(B, @code{[H_2,...]} $B$GDj5A$5$l$k(B Schreyer $B7?9`=g=x$r(B
1531: @code{tT_i} $B$i$KE,MQ$9$k$H$$$&0UL#$G$"$k(B.
1532: @end table
1533:
1534: $B2C72B?9`<0$rF~NO$9$kJ}K!$H$7$F$O(B, @code{<<a,b,...:i>>} $B$J$k7A<0$GD>@\F~NO$9$kB>$K(B,
1535: $BB?9`<0%j%9%H$r:n$j(B, @code{dpm_ltod()} $B$K$h$jJQ49$9$kJ}K!$b$"$k(B.
1536: \E
1537: \BEG
1538: not yet
1539: \E
1540:
1541: \BJP
1.1 noro 1542: @node $B%0%l%V%J4pDl$K4X$9$kH!?t(B,,, $B%0%l%V%J4pDl$N7W;;(B
1543: @section $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1.2 noro 1544: \E
1545: \BEG
1546: @node Functions for Groebner basis computation,,, Groebner basis computation
1547: @section Functions for Groebner basis computation
1548: \E
1.1 noro 1549:
1550: @menu
1551: * gr hgr gr_mod::
1552: * lex_hensel lex_tl tolex tolex_d tolex_tl::
1553: * lex_hensel_gsl tolex_gsl tolex_gsl_d::
1554: * gr_minipoly minipoly::
1555: * tolexm minipolym::
1.6 noro 1556: * 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::
1557: * dp_f4_main dp_f4_mod_main dp_weyl_f4_main dp_weyl_f4_mod_main::
1.17 noro 1558: * nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace::
1.22 noro 1559: * nd_gr_postproc nd_weyl_gr_postproc::
1.1 noro 1560: * dp_gr_flags dp_gr_print::
1561: * dp_ord::
1.18 noro 1562: * dp_set_weight dp_set_top_weight dp_weyl_set_weight::
1.1 noro 1563: * dp_ptod::
1564: * dp_dtop::
1565: * dp_mod dp_rat::
1566: * dp_homo dp_dehomo::
1567: * dp_ptozp dp_prim::
1.18 noro 1568: * dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod dp_weyl_nf dp_weyl_nf_mod::
1.1 noro 1569: * dp_hm dp_ht dp_hc dp_rest::
1.23 noro 1570: * dpm_hm dpm_ht dpm_hc dpm_hp dpm_rest::
1.24 ! noro 1571: * dpm_sp::
! 1572: * dpm_redble::
! 1573: * dpm_nf dpm_nf_and_quotient::
! 1574: * dpm_dtol::
! 1575: * dpm_ltod::
! 1576: * dpm_dptodpm::
1.1 noro 1577: * dp_td dp_sugar::
1578: * dp_lcm::
1579: * dp_redble::
1580: * dp_subd::
1581: * dp_mbase::
1582: * dp_mag::
1583: * dp_red dp_red_mod::
1584: * dp_sp dp_sp_mod::
1585: * p_nf p_nf_mod p_true_nf p_true_nf_mod ::
1586: * p_terms::
1587: * gb_comp::
1588: * katsura hkatsura cyclic hcyclic::
1589: * dp_vtoe dp_etov::
1590: * lex_hensel_gsl tolex_gsl tolex_gsl_d::
1.3 noro 1591: * primadec primedec::
1.5 noro 1592: * primedec_mod::
1.10 noro 1593: * bfunction bfct generic_bfct ann ann0::
1.1 noro 1594: @end menu
1595:
1.2 noro 1596: \JP @node gr hgr gr_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1597: \EG @node gr hgr gr_mod,,, Functions for Groebner basis computation
1.1 noro 1598: @subsection @code{gr}, @code{hgr}, @code{gr_mod}, @code{dgr}
1599: @findex gr
1600: @findex hgr
1601: @findex gr_mod
1602: @findex dgr
1603:
1604: @table @t
1605: @item gr(@var{plist},@var{vlist},@var{order})
1606: @itemx hgr(@var{plist},@var{vlist},@var{order})
1607: @itemx gr_mod(@var{plist},@var{vlist},@var{order},@var{p})
1608: @itemx dgr(@var{plist},@var{vlist},@var{order},@var{procs})
1.2 noro 1609: \JP :: $B%0%l%V%J4pDl$N7W;;(B
1610: \EG :: Groebner basis computation
1.1 noro 1611: @end table
1612:
1613: @table @var
1614: @item return
1.2 noro 1615: \JP $B%j%9%H(B
1616: \EG list
1.4 noro 1617: @item plist vlist procs
1.2 noro 1618: \JP $B%j%9%H(B
1619: \EG list
1.1 noro 1620: @item order
1.2 noro 1621: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
1622: \EG number, list or matrix
1.1 noro 1623: @item p
1.2 noro 1624: \JP 2^27 $BL$K~$NAG?t(B
1625: \EG prime less than 2^27
1.1 noro 1626: @end table
1627:
1628: @itemize @bullet
1.2 noro 1629: \BJP
1.1 noro 1630: @item
1631: $BI8=`%i%$%V%i%j$N(B @samp{gr} $B$GDj5A$5$l$F$$$k(B.
1632: @item
1.21 takayama 1633: gr $B$rL>A0$K4^$`4X?t$O8=:_%a%s%F$5$l$F$$$J$$(B. @code{nd_gr}$B7O$N4X?t$rBe$o$j$KMxMQ$9$Y$-$G$"$k(B(@fref{nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace}).
1634: @item
1.1 noro 1635: $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
1636: @var{order} $B$K4X$9$k%0%l%V%J4pDl$r5a$a$k(B. @code{gr()}, @code{hgr()}
1637: $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.
1638: @item
1639: @var{vlist} $B$OITDj85$N%j%9%H(B. @var{vlist} $B$K8=$l$J$$ITDj85$O(B,
1640: $B78?tBN$KB0$9$k$H8+$J$5$l$k(B.
1641: @item
1642: @code{gr()}, trace-lifting ($B%b%8%e%i1i;;$rMQ$$$?9bB.2=(B) $B$*$h$S(B sugar
1643: strategy $B$K$h$k7W;;(B, @code{hgr()} $B$O(B trace-lifting $B$*$h$S(B
1644: $B@F<!2=$K$h$k(B $B6:@5$5$l$?(B sugar strategy $B$K$h$k7W;;$r9T$&(B.
1645: @item
1.16 fujiwara 1646: @code{dgr()} $B$O(B, @code{gr()}, @code{hgr()} $B$r(B
1.1 noro 1647: $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,
1648: $B@h$K7k2L$rJV$7$?J}$N7k2L$rJV$9(B. $B7k2L$OF10l$G$"$k$,(B, $B$I$A$i$NJ}K!$,(B
1649: $B9bB.$+0lHL$K$OITL@$N$?$a(B, $B<B:]$N7P2a;~4V$rC;=L$9$k$N$KM-8z$G$"$k(B.
1650: @item
1651: @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
1652: CPU $B;~4V$G$"$j(B, $B$3$NH!?t$N>l9g$O$[$H$s$IDL?.$N$?$a$N;~4V$G$"$k(B.
1.12 takayama 1653: @item
1654: $BB?9`<0%j%9%H(B @var{plist} $B$NMWAG$,J,;6I=8=B?9`<0$N>l9g$O(B
1655: $B7k2L$bJ,;6I=8=B?9`<0$N%j%9%H$G$"$k(B.
1656: $B$3$N>l9g(B, $B0z?t$NJ,;6B?9`<0$OM?$($i$l$?=g=x$K=>$$(B @code{dp_sort} $B$G(B
1657: $B%=!<%H$5$l$F$+$i7W;;$5$l$k(B.
1658: $BB?9`<0%j%9%H$NMWAG$,J,;6I=8=B?9`<0$N>l9g$b(B
1659: $BJQ?t$N?tJ,$NITDj85$N%j%9%H$r(B @var{vlist} $B0z?t$H$7$FM?$($J$$$H$$$1$J$$(B
1660: ($B%@%_!<(B).
1.2 noro 1661: \E
1662: \BEG
1663: @item
1664: These functions are defined in @samp{gr} in the standard library
1665: directory.
1.21 takayama 1666: @item
1667: Functions of which names contains gr are obsolted.
1668: Functions of @code{nd_gr} families should be used (@fref{nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace}).
1.2 noro 1669: @item
1670: They compute a Groebner basis of a polynomial list @var{plist} with
1671: respect to the variable order @var{vlist} and the order type @var{order}.
1672: @code{gr()} and @code{hgr()} compute a Groebner basis over the rationals
1673: and @code{gr_mod} computes over GF(@var{p}).
1674: @item
1675: Variables not included in @var{vlist} are regarded as
1676: included in the ground field.
1677: @item
1678: @code{gr()} uses trace-lifting (an improvement by modular computation)
1679: and sugar strategy.
1680: @code{hgr()} uses trace-lifting and a cured sugar strategy
1681: by using homogenization.
1682: @item
1683: @code{dgr()} executes @code{gr()}, @code{dgr()} simultaneously on
1684: two process in a child process list @var{procs} and returns
1685: the result obtained first. The results returned from both the process
1686: should be equal, but it is not known in advance which method is faster.
1687: Therefore this function is useful to reduce the actual elapsed time.
1688: @item
1689: The CPU time shown after an exection of @code{dgr()} indicates
1690: that of the master process, and most of the time corresponds to the time
1691: for communication.
1.12 takayama 1692: @item
1693: When the elements of @var{plist} are distributed polynomials,
1694: the result is also a list of distributed polynomials.
1695: In this case, firstly the elements of @var{plist} is sorted by @code{dp_sort}
1696: and the Grobner basis computation is started.
1697: Variables must be given in @var{vlist} even in this case
1698: (these variables are dummy).
1.2 noro 1699: \E
1.1 noro 1700: @end itemize
1701:
1702: @example
1703: [0] load("gr")$
1704: [64] load("cyclic")$
1705: [74] G=gr(cyclic(5),[c0,c1,c2,c3,c4],2);
1706: [c4^15+122*c4^10-122*c4^5-1,...]
1707: [75] GM=gr_mod(cyclic(5),[c0,c1,c2,c3,c4],2,31991)$
1708: 24628*c4^15+29453*c4^10+2538*c4^5+7363
1709: [76] (G[0]*24628-GM[0])%31991;
1710: 0
1711: @end example
1712:
1713: @table @t
1.2 noro 1714: \JP @item $B;2>H(B
1715: \EG @item References
1.6 noro 1716: @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 1717: @fref{dp_ord}.
1718: @end table
1719:
1.2 noro 1720: \JP @node lex_hensel lex_tl tolex tolex_d tolex_tl,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1721: \EG @node lex_hensel lex_tl tolex tolex_d tolex_tl,,, Functions for Groebner basis computation
1.1 noro 1722: @subsection @code{lex_hensel}, @code{lex_tl}, @code{tolex}, @code{tolex_d}, @code{tolex_tl}
1723: @findex lex_hensel
1724: @findex lex_tl
1725: @findex tolex
1726: @findex tolex_d
1727: @findex tolex_tl
1728:
1729: @table @t
1730: @item lex_hensel(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1731: @itemx lex_tl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1.2 noro 1732: \JP :: $B4pDlJQ49$K$h$k<-=q<0=g=x%0%l%V%J4pDl$N7W;;(B
1733: \EG:: Groebner basis computation with respect to a lex order by change of ordering
1.1 noro 1734: @item tolex(@var{plist},@var{vlist1},@var{order},@var{vlist2})
1735: @itemx tolex_d(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{procs})
1736: @itemx tolex_tl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1.2 noro 1737: \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
1738: \EG :: Groebner basis computation with respect to a lex order by change of ordering, starting from a Groebner basis
1.1 noro 1739: @end table
1740:
1741: @table @var
1742: @item return
1.2 noro 1743: \JP $B%j%9%H(B
1744: \EG list
1.4 noro 1745: @item plist vlist1 vlist2 procs
1.2 noro 1746: \JP $B%j%9%H(B
1747: \EG list
1.1 noro 1748: @item order
1.2 noro 1749: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
1750: \EG number, list or matrix
1.1 noro 1751: @item homo
1.2 noro 1752: \JP $B%U%i%0(B
1753: \EG flag
1.1 noro 1754: @end table
1755:
1756: @itemize @bullet
1.2 noro 1757: \BJP
1.1 noro 1758: @item
1759: $BI8=`%i%$%V%i%j$N(B @samp{gr} $B$GDj5A$5$l$F$$$k(B.
1760: @item
1761: @code{lex_hensel()}, @code{lex_tl()} $B$O(B,
1762: $BB?9`<0%j%9%H(B @var{plist} $B$N(B, $BJQ?t=g=x(B @var{vlist1}, $B9`=g=x7?(B
1763: @var{order} $B$K4X$9$k%0%l%V%J4pDl$r5a$a(B, $B$=$l$r(B, $BJQ?t=g=x(B @var{vlist2}
1764: $B$N<-=q<0=g=x%0%l%V%J4pDl$KJQ49$9$k(B.
1765: @item
1766: @code{tolex()}, @code{tolex_tl()} $B$O(B,
1767: $BJQ?t=g=x(B @var{vlist1}, $B9`=g=x7?(B @var{order} $B$K4X$9$k%0%l%V%J4pDl$G$"$k(B
1768: $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
1769: $B4pDl$KJQ49$9$k(B.
1770: @code{tolex_d()} $B$O(B, @code{tolex()} $B$K$*$1$k(B, $B3F4pDl$N7W;;$r(B, $B;R%W%m%;%9(B
1771: $B%j%9%H(B @var{procs} $B$N3F%W%m%;%9$KJ,;67W;;$5$;$k(B.
1772: @item
1773: @code{lex_hensel()}, @code{lex_tl()} $B$K$*$$$F$O(B, $B<-=q<0=g=x%0%l%V%J4pDl$N(B
1774: $B7W;;$O<!$N$h$&$K9T$o$l$k(B. (@code{[Noro,Yokoyama]} $B;2>H(B.)
1775: @enumerate
1776: @item
1777: @var{vlist1}, @var{order} $B$K4X$9$k%0%l%V%J4pDl(B @var{G0} $B$r7W;;$9$k(B.
1778: (@code{lex_hensel()} $B$N$_(B. )
1779: @item
1780: @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
1781: $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
1782: @var{Gp} $B$r7W;;$9$k(B.
1783: @item
1784: @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.
1785: @item
1786: @var{Gp} $B$N3F85(B @var{f} $B$K$D$-(B, @var{f} $B$N78?t$rL$Dj78?t$G(B,
1787: @var{f} $B$N3F9`$rBP1~$9$k(B @var{NF} $B$N85$GCV$-49$((B, $B3F9`$N78?t$r(B 0 $B$HCV$$$?(B,
1788: $BL$Dj78?t$K4X$9$k@~7AJ}Dx<07O(B @var{Lf} $B$r:n$k(B.
1789: @item
1790: @var{Lf} $B$,(B, $BK!(B @var{p} $B$G0l0U2r$r;}$D$3$H$rMQ$$$F(B @var{Lf} $B$N2r$r(B
1791: $BK!(B @var{p}$B$N2r$+$i(B Hensel $B9=@.$K$h$j5a$a$k(B.
1792: @item
1793: $B$9$Y$F$N(B @var{Gp} $B$N85$K$D$-@~7AJ}Dx<0$,2r$1$?$i$=$N2rA4BN$,5a$a$k(B
1794: $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,
1795: @var{p} $B$r$H$jD>$7$F$d$jD>$9(B.
1796: @end enumerate
1797:
1798: @item
1799: @code{lex_tl()}, @code{tolex_tl()} $B$K$*$$$F$O(B, $B<-=q<0=g=x%0%l%V%J4pDl$N(B
1800: $B7W;;$O<!$N$h$&$K9T$o$l$k(B.
1801:
1802: @enumerate
1803: @item
1804: @var{vlist1}, @var{order} $B$K4X$9$k%0%l%V%J4pDl(B @var{G0} $B$r7W;;$9$k(B.
1805: (@code{lex_hensel()} $B$N$_(B. )
1806: @item
1807: @var{G0} $B$,(B 0 $B<!85%7%9%F%`$G$J$$$H$-(B, @var{G0} $B$rF~NO$H$7$F(B,
1808: @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
1809: $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
1810: $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
1811: $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.
1812: @item
1813: @var{G0} $B$,(B 0 $B<!85%7%9%F%`$N$H$-(B, @var{G0} $B$rF~NO$H$7$F(B,
1814: $B$^$:(B, @var{vlist2} $B$N:G8e$NJQ?t0J30$r>C5n$9$k>C5n=g=x$K$h$j(B
1815: $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
1816: $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
1817: $BF,78?t$r3d$i$J$$AG?t$rMQ$$$?(B trace-lifting $B$G%0%l%V%J4pDl8uJd$r5a$a(B,
1818: $B$b$75a$^$C$?$i%A%'%C%/$J$7$K$=$l$,$=$N=g=x$G$N%0%l%V%J4pDl$H$J$k(B.
1819: @end enumerate
1820:
1821: @item
1822: $BM-M}<078?t$N7W;;$O(B, @code{lex_tl()}, @code{tolex_tl()} $B$N$_<u$1IU$1$k(B.
1823: @item
1824: @code{homo} $B$,(B 0 $B$G$J$$>l9g(B, $BFbIt$G5/F0$5$l$k(B Buchberger $B%"%k%4%j%:%`$K(B
1825: $B$*$$$F(B, $B@F<!2=$,9T$o$l$k(B.
1826: @item
1827: @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
1828: $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 1829: \E
1830: \BEG
1831: @item
1832: These functions are defined in @samp{gr} in the standard library
1833: directory.
1834: @item
1835: @code{lex_hensel()} and @code{lex_tl()} first compute a Groebner basis
1836: with respect to the variable order @var{vlist1} and the order type @var{order}.
1837: Then the Groebner basis is converted into a lex order Groebner basis
1838: with respect to the varable order @var{vlist2}.
1839: @item
1840: @code{tolex()} and @code{tolex_tl()} convert a Groebner basis @var{plist}
1841: with respect to the variable order @var{vlist1} and the order type @var{order}
1842: into a lex order Groebner basis
1843: with respect to the varable order @var{vlist2}.
1844: @code{tolex_d()} does computations of basis elements in @code{tolex()}
1845: in parallel on the processes in a child process list @var{procs}.
1846: @item
1847: In @code{lex_hensel()} and @code{tolex_hensel()} a lex order Groebner basis
1848: is computed as follows.(Refer to @code{[Noro,Yokoyama]}.)
1849: @enumerate
1850: @item
1851: Compute a Groebner basis @var{G0} with respect to @var{vlist1} and @var{order}.
1852: (Only in @code{lex_hensel()}. )
1853: @item
1854: Choose a prime which does not divide head coefficients of elements in @var{G0}
1855: with respect to @var{vlist1} and @var{order}. Then compute a lex order
1856: Groebner basis @var{Gp} over GF(@var{p}) with respect to @var{vlist2}.
1857: @item
1858: Compute @var{NF}, the set of all the normal forms with respect to
1859: @var{G0} of terms appearing in @var{Gp}.
1860: @item
1861: For each element @var{f} in @var{Gp}, replace coefficients and terms in @var{f}
1862: with undetermined coefficients and the corresponding polynomials in @var{NF}
1863: respectively, and generate a system of liear equation @var{Lf} by equating
1864: the coefficients of terms in the replaced polynomial with 0.
1865: @item
1866: Solve @var{Lf} by Hensel lifting, starting from the unique mod @var{p}
1867: solution.
1868: @item
1869: If all the linear equations generated from the elements in @var{Gp}
1870: could be solved, then the set of solutions corresponds to a lex order
1871: Groebner basis. Otherwise redo the whole process with another @var{p}.
1872: @end enumerate
1873:
1874: @item
1875: In @code{lex_tl()} and @code{tolex_tl()} a lex order Groebner basis
1876: is computed as follows.(Refer to @code{[Noro,Yokoyama]}.)
1877:
1878: @enumerate
1879: @item
1880: Compute a Groebner basis @var{G0} with respect to @var{vlist1} and @var{order}.
1881: (Only in @code{lex_tl()}. )
1882: @item
1883: If @var{G0} is not zero-dimensional, choose a prime which does not divide
1884: head coefficients of elements in @var{G0} with respect to @var{vlist1} and
1885: @var{order}. Then compute a candidate of a lex order Groebner basis
1886: via trace lifting with @var{p}. If it succeeds the candidate is indeed
1887: a lex order Groebner basis without any check. Otherwise redo the whole
1888: process with another @var{p}.
1889: @item
1890:
1891: If @var{G0} is zero-dimensional, starting from @var{G0},
1892: compute a Groebner basis @var{G1} with respect to an elimination order
1893: to eliminate variables other than the last varibale in @var{vlist2}.
1894: Then compute a lex order Groebner basis stating from @var{G1}. These
1895: computations are done by trace lifting and the selection of a mudulus
1896: @var{p} is the same as in non zero-dimensional cases.
1897: @end enumerate
1898:
1899: @item
1900: Computations with rational function coefficients can be done only by
1901: @code{lex_tl()} and @code{tolex_tl()}.
1902: @item
1903: If @code{homo} is not equal to 0, homogenization is used in Buchberger
1904: algorithm.
1905: @item
1906: The CPU time shown after an execution of @code{tolex_d()} indicates
1907: that of the master process, and it does not include the time in child
1908: processes.
1909: \E
1.1 noro 1910: @end itemize
1911:
1912: @example
1913: [78] K=katsura(5)$
1914: 30msec + gc : 20msec
1915: [79] V=[u5,u4,u3,u2,u1,u0]$
1916: 0msec
1917: [80] G0=hgr(K,V,2)$
1918: 91.558sec + gc : 15.583sec
1919: [81] G1=lex_hensel(K,V,0,V,0)$
1920: 49.049sec + gc : 9.961sec
1921: [82] G2=lex_tl(K,V,0,V,1)$
1922: 31.186sec + gc : 3.500sec
1923: [83] gb_comp(G0,G1);
1924: 1
1925: 10msec
1926: [84] gb_comp(G0,G2);
1927: 1
1928: @end example
1929:
1930: @table @t
1.2 noro 1931: \JP @item $B;2>H(B
1932: \EG @item References
1.6 noro 1933: @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 1934: \JP @fref{dp_ord}, @fref{$BJ,;67W;;(B}
1935: \EG @fref{dp_ord}, @fref{Distributed computation}
1.1 noro 1936: @end table
1937:
1.2 noro 1938: \JP @node lex_hensel_gsl tolex_gsl tolex_gsl_d,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
1939: \EG @node lex_hensel_gsl tolex_gsl tolex_gsl_d,,, Functions for Groebner basis computation
1.1 noro 1940: @subsection @code{lex_hensel_gsl}, @code{tolex_gsl}, @code{tolex_gsl_d}
1941: @findex lex_hensel_gsl
1942: @findex tolex_gsl
1943: @findex tolex_gsl_d
1944:
1945: @table @t
1946: @item lex_hensel_gsl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo})
1.2 noro 1947: \JP :: GSL $B7A<0$N%$%G%"%k4pDl$N7W;;(B
1948: \EG ::Computation of an GSL form ideal basis
1.8 noro 1949: @item tolex_gsl(@var{plist},@var{vlist1},@var{order},@var{vlist2})
1950: @itemx tolex_gsl_d(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{procs})
1.2 noro 1951: \JP :: $B%0%l%V%J4pDl$rF~NO$H$9$k(B, GSL $B7A<0$N%$%G%"%k4pDl$N7W;;(B
1952: \EG :: Computation of an GSL form ideal basis stating from a Groebner basis
1.1 noro 1953: @end table
1954:
1955: @table @var
1956: @item return
1.2 noro 1957: \JP $B%j%9%H(B
1958: \EG list
1.4 noro 1959: @item plist vlist1 vlist2 procs
1.2 noro 1960: \JP $B%j%9%H(B
1961: \EG list
1.1 noro 1962: @item order
1.2 noro 1963: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
1964: \EG number, list or matrix
1.1 noro 1965: @item homo
1.2 noro 1966: \JP $B%U%i%0(B
1967: \EG flag
1.1 noro 1968: @end table
1969:
1970: @itemize @bullet
1.2 noro 1971: \BJP
1.1 noro 1972: @item
1973: @code{lex_hensel_gsl()} $B$O(B @code{lex_hensel()} $B$N(B, @code{tolex_gsl()} $B$O(B
1974: @code{tolex()} $B$NJQ<o$G(B, $B7k2L$N$_$,0[$J$k(B.
1975: @code{tolex_gsl_d()} $B$O(B, $B4pDl7W;;$r(B, @code{procs} $B$G;XDj$5$l$k;R%W%m%;%9$K(B
1976: $BJ,;67W;;$5$;$k(B.
1977: @item
1978: $BF~NO$,(B 0 $B<!85%7%9%F%`$G(B, $B$=$N<-=q<0=g=x%0%l%V%J4pDl$,(B
1979: @code{[f0,x1-f1,...,xn-fn]} (@code{f0},...,@code{fn} $B$O(B
1980: @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,
1981: @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)
1982: $B$rJV$9(B.
1.2 noro 1983: $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 1984: @code{x0} $B$N(B1 $BJQ?tB?9`<0$G(B,
1985: $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')]}
1986: $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
1987: $B$h$kDL>o$N%0%l%V%J4pDl$rJV$9(B.
1988: @item
1989: 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
1990: $B$N%0%l%V%J4pDl$h$jHs>o$K>.$5$$$?$a7W;;$bB.$/(B, $B2r$b5a$a$d$9$$(B.
1991: @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
1992: $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 1993: \E
1994: \BEG
1995: @item
1996: @code{lex_hensel_gsl()} and @code{lex_hensel()} are variants of
1997: @code{tolex_gsl()} and @code{tolex()} respectively. The results are
1998: Groebner basis or a kind of ideal basis, called GSL form.
1999: @code{tolex_gsl_d()} does basis computations in parallel on child
2000: processes specified in @code{procs}.
2001:
2002: @item
2003: If the input is zero-dimensional and a lex order Groebner basis has
2004: the form @code{[f0,x1-f1,...,xn-fn]} (@code{f0},...,@code{fn} are
2005: univariate polynomials of @code{x0}; SL form), then this these
2006: functions return a list such as
2007: @code{[[x1,g1,d1],...,[xn,gn,dn],[x0,f0,f0']]} (GSL form). In this list
2008: @code{gi} is a univariate polynomial of @code{x0} such that
2009: @code{di*f0'*fi-gi} divides @code{f0} and the roots of the input ideal is
2010: @code{[x1=g1/(d1*f0'),...,xn=gn/(dn*f0')]} for @code{x0}
2011: such that @code{f0(x0)=0}.
2012: If the lex order Groebner basis does not have the above form,
2013: these functions return
2014: a lex order Groebner basis computed by @code{tolex()}.
2015: @item
2016: Though an ideal basis represented as GSL form is not a Groebner basis
2017: we can expect that the coefficients are much smaller than those in a Groebner
2018: basis and that the computation is efficient.
2019: The CPU time shown after an execution of @code{tolex_gsl_d()} indicates
2020: that of the master process, and it does not include the time in child
2021: processes.
2022: \E
1.1 noro 2023: @end itemize
2024:
2025: @example
2026: [103] K=katsura(5)$
2027: [104] V=[u5,u4,u3,u2,u1,u0]$
2028: [105] G0=gr(K,V,0)$
2029: [106] GSL=tolex_gsl(G0,V,0,V)$
2030: [107] GSL[0];
2031: [u1,8635837421130477667200000000*u0^31-...]
2032: [108] GSL[1];
2033: [u2,10352277157007342793600000000*u0^31-...]
2034: [109] GSL[5];
1.5 noro 2035: [u0,11771021876193064124640000000*u0^32-...,
2036: 376672700038178051988480000000*u0^31-...]
1.1 noro 2037: @end example
2038:
2039: @table @t
1.2 noro 2040: \JP @item $B;2>H(B
2041: \EG @item References
1.1 noro 2042: @fref{lex_hensel lex_tl tolex tolex_d tolex_tl},
1.2 noro 2043: \JP @fref{$BJ,;67W;;(B}
2044: \EG @fref{Distributed computation}
1.1 noro 2045: @end table
2046:
1.2 noro 2047: \JP @node gr_minipoly minipoly,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2048: \EG @node gr_minipoly minipoly,,, Functions for Groebner basis computation
1.1 noro 2049: @subsection @code{gr_minipoly}, @code{minipoly}
2050: @findex gr_minipoly
2051: @findex minipoly
2052:
2053: @table @t
2054: @item gr_minipoly(@var{plist},@var{vlist},@var{order},@var{poly},@var{v},@var{homo})
1.2 noro 2055: \JP :: $BB?9`<0$N(B, $B%$%G%"%k$rK!$H$7$?:G>.B?9`<0$N7W;;(B
2056: \EG :: Computation of the minimal polynomial of a polynomial modulo an ideal
1.1 noro 2057: @item minipoly(@var{plist},@var{vlist},@var{order},@var{poly},@var{v})
1.2 noro 2058: \JP :: $B%0%l%V%J4pDl$rF~NO$H$9$k(B, $BB?9`<0$N:G>.B?9`<0$N7W;;(B
2059: \EG :: Computation of the minimal polynomial of a polynomial modulo an ideal
1.1 noro 2060: @end table
2061:
2062: @table @var
2063: @item return
1.2 noro 2064: \JP $BB?9`<0(B
2065: \EG polynomial
1.4 noro 2066: @item plist vlist
1.2 noro 2067: \JP $B%j%9%H(B
2068: \EG list
1.1 noro 2069: @item order
1.2 noro 2070: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
2071: \EG number, list or matrix
1.1 noro 2072: @item poly
1.2 noro 2073: \JP $BB?9`<0(B
2074: \EG polynomial
1.1 noro 2075: @item v
1.2 noro 2076: \JP $BITDj85(B
2077: \EG indeterminate
1.1 noro 2078: @item homo
1.2 noro 2079: \JP $B%U%i%0(B
2080: \EG flag
1.1 noro 2081: @end table
2082:
2083: @itemize @bullet
1.2 noro 2084: \BJP
1.1 noro 2085: @item
2086: @code{gr_minipoly()} $B$O%0%l%V%J4pDl$N7W;;$+$i9T$$(B, @code{minipoly()} $B$O(B
2087: $BF~NO$r%0%l%V%J4pDl$H$_$J$9(B.
2088: @item
2089: $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,
2090: K[@var{v}] $B$N85(B f(@var{v}) $B$K(B f(@var{p}) mod I $B$rBP1~$5$;$k(B
2091: $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}
2092: $B$N(B, $BK!(B @var{I} $B$G$N:G>.B?9`<0$H8F$V(B.
2093: @item
2094: @code{gr_minipoly()}, @code{minipoly()} $B$O(B, $BB?9`<0(B @var{p} $B$N:G>.B?9`<0(B
2095: $B$r5a$a(B, @var{v} $B$rJQ?t$H$9$kB?9`<0$H$7$FJV$9(B.
2096: @item
2097: $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,
2098: $B:G>.B?9`<0$N$_$r5a$a$?$$>l9g(B, @code{minipoly()}, @code{gr_minipoly()} $B$O(B
2099: $B%0%l%V%J4pDl$rMQ$$$kJ}K!$KHf$Y$F8zN($,$h$$(B.
2100: @item
2101: @code{gr_minipoly()} $B$K;XDj$9$k9`=g=x$H$7$F$O(B, $BDL>oA4<!?t5U<-=q<0=g=x$r(B
2102: $BMQ$$$k(B.
1.2 noro 2103: \E
2104: \BEG
2105: @item
2106: @code{gr_minipoly()} begins by computing a Groebner basis.
2107: @code{minipoly()} regards an input as a Groebner basis with respect to
2108: the variable order @var{vlist} and the order type @var{order}.
2109: @item
2110: Let K be a field. If an ideal @var{I} in K[X] is zero-dimensional, then, for
2111: a polynomial @var{p} in K[X], the kernel of a homomorphism from
2112: K[@var{v}] to K[X]/@var{I} which maps f(@var{v}) to f(@var{p}) mod @var{I}
2113: is generated by a polynomial. The generator is called the minimal polynomial
2114: of @var{p} modulo @var{I}.
2115: @item
2116: @code{gr_minipoly()} and @code{minipoly()} computes the minimal polynomial
2117: of a polynomial @var{p} and returns it as a polynomial of @var{v}.
2118: @item
2119: The minimal polynomial can be computed as an element of a Groebner basis.
2120: But if we are only interested in the minimal polynomial,
2121: @code{minipoly()} and @code{gr_minipoly()} can compute it more efficiently
2122: than methods using Groebner basis computation.
2123: @item
2124: It is recommended to use a degree reverse lex order as a term order
2125: for @code{gr_minipoly()}.
2126: \E
1.1 noro 2127: @end itemize
2128:
2129: @example
2130: [117] G=tolex(G0,V,0,V)$
2131: 43.818sec + gc : 11.202sec
2132: [118] GSL=tolex_gsl(G0,V,0,V)$
2133: 17.123sec + gc : 2.590sec
2134: [119] MP=minipoly(G0,V,0,u0,z)$
2135: 4.370sec + gc : 780msec
2136: @end example
2137:
2138: @table @t
1.2 noro 2139: \JP @item $B;2>H(B
2140: \EG @item References
1.1 noro 2141: @fref{lex_hensel lex_tl tolex tolex_d tolex_tl}.
2142: @end table
2143:
1.2 noro 2144: \JP @node tolexm minipolym,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2145: \EG @node tolexm minipolym,,, Functions for Groebner basis computation
1.1 noro 2146: @subsection @code{tolexm}, @code{minipolym}
2147: @findex tolexm
2148: @findex minipolym
2149:
2150: @table @t
2151: @item tolexm(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{mod})
1.2 noro 2152: \JP :: $BK!(B @var{mod} $B$G$N4pDlJQ49$K$h$k%0%l%V%J4pDl7W;;(B
2153: \EG :: Groebner basis computation modulo @var{mod} by change of ordering.
1.1 noro 2154: @item minipolym(@var{plist},@var{vlist1},@var{order},@var{poly},@var{v},@var{mod})
1.2 noro 2155: \JP :: $BK!(B @var{mod} $B$G$N%0%l%V%J4pDl$K$h$kB?9`<0$N:G>.B?9`<0$N7W;;(B
2156: \EG :: Minimal polynomial computation modulo @var{mod} the same method as
1.1 noro 2157: @end table
2158:
2159: @table @var
2160: @item return
1.2 noro 2161: \JP @code{tolexm()} : $B%j%9%H(B, @code{minipolym()} : $BB?9`<0(B
2162: \EG @code{tolexm()} : list, @code{minipolym()} : polynomial
1.4 noro 2163: @item plist vlist1 vlist2
1.2 noro 2164: \JP $B%j%9%H(B
2165: \EG list
1.1 noro 2166: @item order
1.2 noro 2167: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
2168: \EG number, list or matrix
1.1 noro 2169: @item mod
1.2 noro 2170: \JP $BAG?t(B
2171: \EG prime
1.1 noro 2172: @end table
2173:
2174: @itemize @bullet
1.2 noro 2175: \BJP
1.1 noro 2176: @item
2177: $BF~NO(B @var{plist} $B$O$$$:$l$b(B $BJQ?t=g=x(B @var{vlist1}, $B9`=g=x7?(B @var{order},
2178: $BK!(B @var{mod} $B$K$*$1$k%0%l%V%J4pDl$G$J$1$l$P$J$i$J$$(B.
2179: @item
2180: @code{minipolym()} $B$O(B @code{minipoly} $B$KBP1~$9$k7W;;$rK!(B @var{mod}$B$G9T$&(B.
2181: @item
2182: @code{tolexm()} $B$O(B FGLM $BK!$K$h$k4pDlJQ49$K$h$j(B @var{vlist2},
2183: $B<-=q<0=g=x$K$h$k%0%l%V%J4pDl$r7W;;$9$k(B.
1.2 noro 2184: \E
2185: \BEG
2186: @item
2187: An input @var{plist} must be a Groebner basis modulo @var{mod}
2188: with respect to the variable order @var{vlist1} and the order type @var{order}.
2189: @item
2190: @code{minipolym()} executes the same computation as in @code{minipoly}.
2191: @item
2192: @code{tolexm()} computes a lex order Groebner basis modulo @var{mod}
2193: with respect to the variable order @var{vlist2}, by using FGLM algorithm.
2194: \E
1.1 noro 2195: @end itemize
2196:
2197: @example
2198: [197] tolexm(G0,V,0,V,31991);
2199: [8271*u0^31+10435*u0^30+816*u0^29+26809*u0^28+...,...]
2200: [198] minipolym(G0,V,0,u0,z,31991);
2201: z^32+11405*z^31+20868*z^30+21602*z^29+...
2202: @end example
2203:
2204: @table @t
1.2 noro 2205: \JP @item $B;2>H(B
2206: \EG @item References
1.1 noro 2207: @fref{lex_hensel lex_tl tolex tolex_d tolex_tl},
2208: @fref{gr_minipoly minipoly}.
2209: @end table
2210:
1.6 noro 2211: \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
2212: \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
2213: @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 2214: @findex dp_gr_main
2215: @findex dp_gr_mod_main
1.5 noro 2216: @findex dp_gr_f_main
1.6 noro 2217: @findex dp_weyl_gr_main
2218: @findex dp_weyl_gr_mod_main
2219: @findex dp_weyl_gr_f_main
1.1 noro 2220:
2221: @table @t
2222: @item dp_gr_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order})
2223: @itemx dp_gr_mod_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order})
1.5 noro 2224: @itemx dp_gr_f_main(@var{plist},@var{vlist},@var{homo},@var{order})
1.6 noro 2225: @itemx dp_weyl_gr_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order})
2226: @itemx dp_weyl_gr_mod_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order})
2227: @itemx dp_weyl_gr_f_main(@var{plist},@var{vlist},@var{homo},@var{order})
1.2 noro 2228: \JP :: $B%0%l%V%J4pDl$N7W;;(B ($BAH$_9~$_H!?t(B)
2229: \EG :: Groebner basis computation (built-in functions)
1.1 noro 2230: @end table
2231:
2232: @table @var
2233: @item return
1.2 noro 2234: \JP $B%j%9%H(B
2235: \EG list
1.4 noro 2236: @item plist vlist
1.2 noro 2237: \JP $B%j%9%H(B
2238: \EG list
1.1 noro 2239: @item order
1.2 noro 2240: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
2241: \EG number, list or matrix
1.1 noro 2242: @item homo
1.2 noro 2243: \JP $B%U%i%0(B
2244: \EG flag
1.1 noro 2245: @item modular
1.2 noro 2246: \JP $B%U%i%0$^$?$OAG?t(B
2247: \EG flag or prime
1.1 noro 2248: @end table
2249:
2250: @itemize @bullet
1.2 noro 2251: \BJP
1.1 noro 2252: @item
2253: $B$3$l$i$NH!?t$O(B, $B%0%l%V%J4pDl7W;;$N4pK\E*AH$_9~$_H!?t$G$"$j(B, @code{gr()},
2254: @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 2255: $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
2256: $B$N$?$a$N4X?t$G$"$k(B.
1.1 noro 2257: @item
1.6 noro 2258: @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 2259: $B>l9g$KMQ$$$k(B. $BF~NO$O(B, $B$"$i$+$8$a(B, @code{simp_ff()} $B$J$I$G(B,
2260: $B9M$($kM-8BBN>e$K<M1F$5$l$F$$$kI,MW$,$"$k(B.
2261: @item
1.1 noro 2262: $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
2263: $B$r<B9T$9$k(B.
2264: @item
2265: @code{dp_gr_mod_main()} $B$KBP$7$F$O(B, @var{modular} $B$O(B, GF(@var{modular}) $B>e(B
2266: $B$G$N7W;;$r0UL#$9$k(B.
2267: @code{dp_gr_main()} $B$KBP$7$F$O(B, @var{modular} $B$O<!$N$h$&$J0UL#$r;}$D(B.
2268: @enumerate
2269: @item
2270: @var{modular} $B$,(B 1 $B$N;~(B, trace-lifting $B$K$h$k7W;;$r9T$&(B. $BAG?t$O(B
2271: @code{lprime(0)} $B$+$i=g$K@.8y$9$k$^$G(B @code{lprime()} $B$r8F$S=P$7$F@8@.$9$k(B.
2272: @item
2273: @var{modular} $B$,(B 2 $B0J>e$N<+A3?t$N;~(B, $B$=$NCM$rAG?t$H$_$J$7$F(B trace-lifting
2274: $B$r9T$&(B. $B$=$NAG?t$G<:GT$7$?>l9g(B, 0 $B$rJV$9(B.
2275: @item
2276: @var{modular} $B$,Ii$N>l9g(B,
2277: @var{-modular} $B$KBP$7$F>e=R$N5,B'$,E,MQ$5$l$k$,(B, trace-lifting $B$N:G=*(B
2278: $BCJ3,$N%0%l%V%J4pDl%A%'%C%/$H%$%G%"%k%a%s%P%7%C%W%A%'%C%/$,>JN,$5$l$k(B.
2279: @end enumerate
2280:
2281: @item
2282: @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
2283: @code{dp_gr_main(P,V,1,1,O)}, @code{gr_mod(P,V,O,M)} $B$O(B
2284: @code{dp_gr_mod_main(P,V,0,M,O)} $B$r$=$l$>$l<B9T$9$k(B.
2285: @item
2286: @var{homo}, @var{modular} $B$NB>$K(B, @code{dp_gr_flags()} $B$G@_Dj$5$l$k(B
2287: $B$5$^$6$^$J%U%i%0$K$h$j7W;;$,@)8f$5$l$k(B.
1.2 noro 2288: \E
2289: \BEG
2290: @item
2291: These functions are fundamental built-in functions for Groebner basis
2292: computation and @code{gr()},@code{hgr()} and @code{gr_mod()}
1.6 noro 2293: are all interfaces to these functions. Functions whose names
2294: contain weyl are those for computation in Weyl algebra.
1.2 noro 2295: @item
1.6 noro 2296: @code{dp_gr_f_main()} and @code{dp_weyl_gr_f_main()}
2297: are functions for Groebner basis computation
1.5 noro 2298: over various finite fields. Coefficients of input polynomials
2299: must be converted to elements of a finite field
2300: currently specified by @code{setmod_ff()}.
2301: @item
1.2 noro 2302: If @var{homo} is not equal to 0, homogenization is applied before entering
2303: Buchberger algorithm
2304: @item
2305: For @code{dp_gr_mod_main()}, @var{modular} means a computation over
2306: GF(@var{modular}).
2307: For @code{dp_gr_main()}, @var{modular} has the following mean.
2308: @enumerate
2309: @item
2310: If @var{modular} is 1 , trace lifting is used. Primes for trace lifting
2311: are generated by @code{lprime()}, starting from @code{lprime(0)}, until
2312: the computation succeeds.
2313: @item
2314: If @var{modular} is an integer greater than 1, the integer is regarded as a
2315: prime and trace lifting is executed by using the prime. If the computation
2316: fails then 0 is returned.
2317: @item
2318: If @var{modular} is negative, the above rule is applied for @var{-modular}
2319: but the Groebner basis check and ideal-membership check are omitted in
2320: the last stage of trace lifting.
2321: @end enumerate
2322:
2323: @item
2324: @code{gr(P,V,O)}, @code{hgr(P,V,O)} and @code{gr_mod(P,V,O,M)} execute
2325: @code{dp_gr_main(P,V,0,1,O)}, @code{dp_gr_main(P,V,1,1,O)}
2326: and @code{dp_gr_mod_main(P,V,0,M,O)} respectively.
2327: @item
2328: Actual computation is controlled by various parameters set by
2329: @code{dp_gr_flags()}, other then by @var{homo} and @var{modular}.
2330: \E
1.1 noro 2331: @end itemize
2332:
2333: @table @t
1.2 noro 2334: \JP @item $B;2>H(B
2335: \EG @item References
1.1 noro 2336: @fref{dp_ord},
2337: @fref{dp_gr_flags dp_gr_print},
2338: @fref{gr hgr gr_mod},
1.5 noro 2339: @fref{setmod_ff},
1.2 noro 2340: \JP @fref{$B7W;;$*$h$SI=<($N@)8f(B}.
2341: \EG @fref{Controlling Groebner basis computations}
1.1 noro 2342: @end table
2343:
1.6 noro 2344: \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
2345: \EG @node dp_f4_main dp_f4_mod_main dp_weyl_f4_main dp_weyl_f4_mod_main,,, Functions for Groebner basis computation
2346: @subsection @code{dp_f4_main}, @code{dp_f4_mod_main}, @code{dp_weyl_f4_main}, @code{dp_weyl_f4_mod_main}
1.1 noro 2347: @findex dp_f4_main
2348: @findex dp_f4_mod_main
1.6 noro 2349: @findex dp_weyl_f4_main
2350: @findex dp_weyl_f4_mod_main
1.1 noro 2351:
2352: @table @t
2353: @item dp_f4_main(@var{plist},@var{vlist},@var{order})
2354: @itemx dp_f4_mod_main(@var{plist},@var{vlist},@var{order})
1.6 noro 2355: @itemx dp_weyl_f4_main(@var{plist},@var{vlist},@var{order})
2356: @itemx dp_weyl_f4_mod_main(@var{plist},@var{vlist},@var{order})
1.2 noro 2357: \JP :: F4 $B%"%k%4%j%:%`$K$h$k%0%l%V%J4pDl$N7W;;(B ($BAH$_9~$_H!?t(B)
2358: \EG :: Groebner basis computation by F4 algorithm (built-in functions)
1.1 noro 2359: @end table
2360:
2361: @table @var
2362: @item return
1.2 noro 2363: \JP $B%j%9%H(B
2364: \EG list
1.4 noro 2365: @item plist vlist
1.2 noro 2366: \JP $B%j%9%H(B
2367: \EG list
1.1 noro 2368: @item order
1.2 noro 2369: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
2370: \EG number, list or matrix
1.1 noro 2371: @end table
2372:
2373: @itemize @bullet
1.2 noro 2374: \BJP
1.1 noro 2375: @item
2376: F4 $B%"%k%4%j%:%`$K$h$j%0%l%V%J4pDl$N7W;;$r9T$&(B.
2377: @item
2378: F4 $B%"%k%4%j%:%`$O(B, J.C. Faugere $B$K$h$jDs>'$5$l$??7@$Be%0%l%V%J4pDl(B
2379: $B;;K!$G$"$j(B, $BK\<BAu$O(B, $BCf9q>jM>DjM}$K$h$k@~7AJ}Dx<05a2r$rMQ$$$?(B
2380: $B;n83E*$J<BAu$G$"$k(B.
2381: @item
1.6 noro 2382: $B@F<!2=$N0z?t$,$J$$$3$H$r=|$1$P(B, $B0z?t$*$h$SF0:n$O$=$l$>$l(B
2383: @code{dp_gr_main()}, @code{dp_gr_mod_main()},
2384: @code{dp_weyl_gr_main()}, @code{dp_weyl_gr_mod_main()}
1.1 noro 2385: $B$HF1MM$G$"$k(B.
1.2 noro 2386: \E
2387: \BEG
2388: @item
2389: These functions compute Groebner bases by F4 algorithm.
2390: @item
2391: F4 is a new generation algorithm for Groebner basis computation
2392: invented by J.C. Faugere. The current implementation of @code{dp_f4_main()}
2393: uses Chinese Remainder theorem and not highly optimized.
2394: @item
2395: Arguments and actions are the same as those of
1.6 noro 2396: @code{dp_gr_main()}, @code{dp_gr_mod_main()},
2397: @code{dp_weyl_gr_main()}, @code{dp_weyl_gr_mod_main()},
2398: except for lack of the argument for controlling homogenization.
1.2 noro 2399: \E
1.1 noro 2400: @end itemize
2401:
2402: @table @t
1.2 noro 2403: \JP @item $B;2>H(B
2404: \EG @item References
1.1 noro 2405: @fref{dp_ord},
2406: @fref{dp_gr_flags dp_gr_print},
2407: @fref{gr hgr gr_mod},
1.15 noro 2408: \JP @fref{$B7W;;$*$h$SI=<($N@)8f(B}.
2409: \EG @fref{Controlling Groebner basis computations}
2410: @end table
2411:
1.17 noro 2412: \JP @node nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2413: \EG @node nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace,,, Functions for Groebner basis computation
2414: @subsection @code{nd_gr}, @code{nd_gr_trace}, @code{nd_f4}, @code{nd_f4_trace}, @code{nd_weyl_gr}, @code{nd_weyl_gr_trace}
1.15 noro 2415: @findex nd_gr
2416: @findex nd_gr_trace
2417: @findex nd_f4
1.17 noro 2418: @findex nd_f4_trace
1.15 noro 2419: @findex nd_weyl_gr
2420: @findex nd_weyl_gr_trace
2421:
2422: @table @t
1.23 noro 2423: @item nd_gr(@var{plist},@var{vlist},@var{p},@var{order}[|@var{option=value,...}])
2424: @itemx nd_gr_trace(@var{plist},@var{vlist},@var{homo},@var{p},@var{order}[|@var{option=value,...}])
2425: @itemx nd_f4(@var{plist},@var{vlist},@var{modular},@var{order}[|@var{option=value,...}])
2426: @itemx nd_f4_trace(@var{plist},@var{vlist},@var{homo},@var{p},@var{order}[|@var{option=value,...}])
2427: @itemx nd_weyl_gr(@var{plist},@var{vlist},@var{p},@var{order}[|@var{option=value,...}])
2428: @itemx nd_weyl_gr_trace(@var{plist},@var{vlist},@var{homo},@var{p},@var{order}[|@var{option=value,...}])
1.15 noro 2429: \JP :: $B%0%l%V%J4pDl$N7W;;(B ($BAH$_9~$_H!?t(B)
2430: \EG :: Groebner basis computation (built-in functions)
2431: @end table
2432:
2433: @table @var
2434: @item return
2435: \JP $B%j%9%H(B
2436: \EG list
2437: @item plist vlist
2438: \JP $B%j%9%H(B
2439: \EG list
2440: @item order
2441: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
2442: \EG number, list or matrix
2443: @item homo
2444: \JP $B%U%i%0(B
2445: \EG flag
2446: @item modular
2447: \JP $B%U%i%0$^$?$OAG?t(B
2448: \EG flag or prime
2449: @end table
2450:
2451: \BJP
2452: @itemize @bullet
2453: @item
2454: $B$3$l$i$NH!?t$O(B, $B%0%l%V%J4pDl7W;;AH$_9~$_4X?t$N?7<BAu$G$"$k(B.
2455: @item @code{nd_gr} $B$O(B, @code{p} $B$,(B 0 $B$N$H$-M-M}?tBN>e$N(B Buchberger
2456: $B%"%k%4%j%:%`$r<B9T$9$k(B. @code{p} $B$,(B 2 $B0J>e$N<+A3?t$N$H$-(B, GF(p) $B>e$N(B
2457: Buchberger $B%"%k%4%j%:%`$r<B9T$9$k(B.
1.17 noro 2458: @item @code{nd_gr_trace} $B$*$h$S(B @code{nd_f4_trace}
2459: $B$OM-M}?tBN>e$G(B trace $B%"%k%4%j%:%`$r<B9T$9$k(B.
1.18 noro 2460: @var{p} $B$,(B 0 $B$^$?$O(B 1 $B$N$H$-(B, $B<+F0E*$KA*$P$l$?AG?t$rMQ$$$F(B, $B@.8y$9$k(B
1.15 noro 2461: $B$^$G(B trace $B%"%k%4%j%:%`$r<B9T$9$k(B.
1.18 noro 2462: @var{p} $B$,(B 2 $B0J>e$N$H$-(B, trace $B$O(BGF(p) $B>e$G7W;;$5$l$k(B. trace $B%"%k%4%j%:%`(B
2463: $B$,<:GT$7$?>l9g(B 0 $B$,JV$5$l$k(B. @var{p} $B$,Ii$N>l9g(B, $B%0%l%V%J4pDl%A%'%C%/$O(B
2464: $B9T$o$J$$(B. $B$3$N>l9g(B, @var{p} $B$,(B -1 $B$J$i$P<+F0E*$KA*$P$l$?AG?t$,(B,
1.17 noro 2465: $B$=$l0J30$O;XDj$5$l$?AG?t$rMQ$$$F%0%l%V%J4pDl8uJd$N7W;;$,9T$o$l$k(B.
2466: @code{nd_f4_trace} $B$O(B, $B3FA4<!?t$K$D$$$F(B, $B$"$kM-8BBN>e$G(B F4 $B%"%k%4%j%:%`(B
2467: $B$G9T$C$?7k2L$r$b$H$K(B, $B$=$NM-8BBN>e$G(B 0 $B$G$J$$4pDl$rM?$($k(B S-$BB?9`<0$N$_$r(B
2468: $BMQ$$$F9TNs@8@.$r9T$$(B, $B$=$NA4<!?t$K$*$1$k4pDl$r@8@.$9$kJ}K!$G$"$k(B. $BF@$i$l$k(B
2469: $BB?9`<0=89g$O$d$O$j%0%l%V%J4pDl8uJd$G$"$j(B, @code{nd_gr_trace} $B$HF1MM$N(B
2470: $B%A%'%C%/$,9T$o$l$k(B.
1.15 noro 2471: @item
1.17 noro 2472: @code{nd_f4} $B$O(B @code{modular} $B$,(B 0 $B$N$H$-M-M}?tBN>e$N(B, @code{modular} $B$,(B
2473: $B%^%7%s%5%$%:AG?t$N$H$-M-8BBN>e$N(B F4 $B%"%k%4%j%:%`$r<B9T$9$k(B.
1.15 noro 2474: @item
1.18 noro 2475: @var{plist} $B$,B?9`<0%j%9%H$N>l9g(B, @var{plist}$B$G@8@.$5$l$k%$%G%"%k$N%0%l%V%J!<4pDl$,(B
2476: $B7W;;$5$l$k(B. @var{plist} $B$,B?9`<0%j%9%H$N%j%9%H$N>l9g(B, $B3FMWAG$OB?9`<04D>e$N<+M32C72$N85$H8+$J$5$l(B,
2477: $B$3$l$i$,@8@.$9$kItJ,2C72$N%0%l%V%J!<4pDl$,7W;;$5$l$k(B. $B8e<T$N>l9g(B, $B9`=g=x$O2C72$KBP$9$k9`=g=x$r(B
2478: $B;XDj$9$kI,MW$,$"$k(B. $B$3$l$O(B @var{[s,ord]} $B$N7A$G;XDj$9$k(B. @var{s} $B$,(B 0 $B$J$i$P(B TOP (Term Over Position),
2479: 1 $B$J$i$P(B POT (Position Over Term) $B$r0UL#$7(B, @var{ord} $B$OB?9`<04D$NC19`<0$KBP$9$k9`=g=x$G$"$k(B.
2480: @item
1.15 noro 2481: @code{nd_weyl_gr}, @code{nd_weyl_gr_trace} $B$O(B Weyl $BBe?tMQ$G$"$k(B.
2482: @item
1.18 noro 2483: @code{f4} $B7O4X?t0J30$O$9$Y$FM-M}4X?t78?t$N7W;;$,2DG=$G$"$k(B.
1.15 noro 2484: @item
2485: $B0lHL$K(B @code{dp_gr_main}, @code{dp_gr_mod_main} $B$h$j9bB.$G$"$k$,(B,
2486: $BFC$KM-8BBN>e$N>l9g82Cx$G$"$k(B.
1.23 noro 2487: @item
2488: $B0J2<$N%*%W%7%g%s$,;XDj$G$-$k(B.
2489: @table @code
2490: @item homo
2491: 1 $B$N$H$-(B, $B@F<!2=$r7PM3$7$F7W;;$9$k(B. (@code{nd_gr}, @code{nd_f4} $B$N$_(B)
2492: @item dp
2493: 1 $B$N$H$-(B, $BJ,;6I=8=B?9`<0(B ($B2C72$N>l9g$K$O2C72B?9`<0(B) $B$r7k2L$H$7$FJV$9(B.
2494: @item nora
2495: 1 $B$N$H$-(B, $B7k2L$NAj8_4JLs$r9T$o$J$$(B.
2496: @end table
1.15 noro 2497: @end itemize
2498: \E
2499:
2500: \BEG
2501: @itemize @bullet
2502: @item
2503: These functions are new implementations for computing Groebner bases.
2504: @item @code{nd_gr} executes Buchberger algorithm over the rationals
2505: if @code{p} is 0, and that over GF(p) if @code{p} is a prime.
2506: @item @code{nd_gr_trace} executes the trace algorithm over the rationals.
2507: If @code{p} is 0 or 1, the trace algorithm is executed until it succeeds
2508: by using automatically chosen primes.
2509: If @code{p} a positive prime,
2510: the trace is comuted over GF(p).
2511: If the trace algorithm fails 0 is returned.
2512: If @code{p} is negative,
2513: the Groebner basis check and ideal-membership check are omitted.
2514: In this case, an automatically chosen prime if @code{p} is 1,
2515: otherwise the specified prime is used to compute a Groebner basis
2516: candidate.
1.17 noro 2517: Execution of @code{nd_f4_trace} is done as follows:
2518: For each total degree, an F4-reduction of S-polynomials over a finite field
2519: is done, and S-polynomials which give non-zero basis elements are gathered.
2520: Then F4-reduction over Q is done for the gathered S-polynomials.
2521: The obtained polynomial set is a Groebner basis candidate and the same
2522: check procedure as in the case of @code{nd_gr_trace} is done.
2523: @item
2524: @code{nd_f4} executes F4 algorithm over Q if @code{modular} is equal to 0,
2525: or over a finite field GF(@code{modular})
2526: if @code{modular} is a prime number of machine size (<2^29).
1.18 noro 2527: If @var{plist} is a list of polynomials, then a Groebner basis of the ideal generated by @var{plist}
2528: is computed. If @var{plist} is a list of lists of polynomials, then each list of polynomials are regarded
2529: as an element of a free module over a polynomial ring and a Groebner basis of the sub-module generated by @var{plist}
2530: in the free module. In the latter case a term order in the free module should be specified.
2531: This is specified by @var{[s,ord]}. If @var{s} is 0 then it means TOP (Term Over Position).
2532: If @var{s} is 1 then it means POT 1 (Position Over Term). @var{ord} is a term order in the base polynomial ring.
1.15 noro 2533: @item
2534: @code{nd_weyl_gr}, @code{nd_weyl_gr_trace} are for Weyl algebra computation.
2535: @item
1.18 noro 2536: Functions except for F4 related ones can handle rational coeffient cases.
1.15 noro 2537: @item
2538: In general these functions are more efficient than
2539: @code{dp_gr_main}, @code{dp_gr_mod_main}, especially over finite fields.
1.23 noro 2540: @item
2541: The fallowing options can be specified.
2542: @table @code
2543: @item homo
2544: If set to 1, the computation is done via homogenization. (only for @code{nd_gr} and @code{nd_f4})
2545: @item dp
2546: If set to 1, the functions return a list of distributed polynomials (a list of
2547: module polynomials when the input is a sub-module).
2548: @item nora
2549: If set to 1, the inter-reduction is not performed.
2550: @end table
1.15 noro 2551: @end itemize
2552: \E
2553:
2554: @example
2555: [38] load("cyclic")$
2556: [49] C=cyclic(7)$
2557: [50] V=vars(C)$
2558: [51] cputime(1)$
2559: [52] dp_gr_mod_main(C,V,0,31991,0)$
2560: 26.06sec + gc : 0.313sec(26.4sec)
2561: [53] nd_gr(C,V,31991,0)$
2562: ndv_alloc=1477188
2563: 5.737sec + gc : 0.1837sec(5.921sec)
2564: [54] dp_f4_mod_main(C,V,31991,0)$
2565: 3.51sec + gc : 0.7109sec(4.221sec)
2566: [55] nd_f4(C,V,31991,0)$
2567: 1.906sec + gc : 0.126sec(2.032sec)
2568: @end example
2569:
2570: @table @t
2571: \JP @item $B;2>H(B
2572: \EG @item References
2573: @fref{dp_ord},
2574: @fref{dp_gr_flags dp_gr_print},
1.2 noro 2575: \JP @fref{$B7W;;$*$h$SI=<($N@)8f(B}.
2576: \EG @fref{Controlling Groebner basis computations}
1.1 noro 2577: @end table
2578:
1.22 noro 2579: \JP @node nd_gr_postproc nd_weyl_gr_postproc,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2580: \EG @node nd_gr_postproc nd_weyl_gr_postproc,,, Functions for Groebner basis computation
2581: @subsection @code{nd_gr_postproc}, @code{nd_weyl_gr_postproc}
2582: @findex nd_gr_postproc
2583: @findex nd_weyl_gr_postproc
2584:
2585: @table @t
2586: @item nd_gr_postproc(@var{plist},@var{vlist},@var{p},@var{order},@var{check})
2587: @itemx nd_weyl_gr_postproc(@var{plist},@var{vlist},@var{p},@var{order},@var{check})
2588: \JP :: $B%0%l%V%J4pDl8uJd$N%A%'%C%/$*$h$SAj8_4JLs(B
2589: \EG :: Check of Groebner basis candidate and inter-reduction
2590: @end table
2591:
2592: @table @var
2593: @item return
2594: \JP $B%j%9%H(B $B$^$?$O(B 0
2595: \EG list or 0
2596: @item plist vlist
2597: \JP $B%j%9%H(B
2598: \EG list
2599: @item p
2600: \JP $BAG?t$^$?$O(B 0
2601: \EG prime or 0
2602: @item order
2603: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
2604: \EG number, list or matrix
2605: @item check
2606: \JP 0 $B$^$?$O(B 1
2607: \EG 0 or 1
2608: @end table
2609:
2610: @itemize @bullet
2611: \BJP
2612: @item
2613: $B%0%l%V%J4pDl(B($B8uJd(B)$B$NAj8_4JLs$r9T$&(B.
2614: @item
2615: @code{nd_weyl_gr_postproc} $B$O(B Weyl $BBe?tMQ$G$"$k(B.
2616: @item
2617: @var{check=1} $B$N>l9g(B, @var{plist} $B$,(B, @var{vlist}, @var{p}, @var{order} $B$G;XDj$5$l$kB?9`<04D(B, $B9`=g=x$G%0%l%V%J!<4pDl$K$J$C$F$$$k$+(B
2618: $B$N%A%'%C%/$b9T$&(B.
2619: @item
2620: $B@F<!2=$7$F7W;;$7$?%0%l%V%J!<4pDl$rHs@F<!2=$7$?$b$N$rAj8_4JLs$r9T$&(B, CRT $B$G7W;;$7$?%0%l%V%J!<4pDl8uJd$N%A%'%C%/$r9T$&$J$I$N>l9g$KMQ$$$k(B.
2621: \E
2622: \BEG
2623: @item
2624: Perform the inter-reduction for a Groebner basis (candidate).
2625: @item
2626: @code{nd_weyl_gr_postproc} is for Weyl algebra.
2627: @item
2628: If @var{check=1} then the check whether @var{plist} is a Groebner basis with respect to a term order in a polynomial ring
2629: or Weyl algebra specified by @var{vlist}, @var{p} and @var{order}.
2630: @item
2631: This function is used for inter-reduction of a non-reduced Groebner basis that is obtained by dehomogenizing a Groebner basis
2632: computed via homogenization, or Groebner basis check of a Groebner basis candidate computed by CRT.
2633: \E
2634: @end itemize
2635:
2636: @example
2637: afo
2638: @end example
2639:
1.2 noro 2640: \JP @node dp_gr_flags dp_gr_print,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2641: \EG @node dp_gr_flags dp_gr_print,,, Functions for Groebner basis computation
1.1 noro 2642: @subsection @code{dp_gr_flags}, @code{dp_gr_print}
2643: @findex dp_gr_flags
2644: @findex dp_gr_print
2645:
2646: @table @t
2647: @item dp_gr_flags([@var{list}])
1.7 noro 2648: @itemx dp_gr_print([@var{i}])
1.2 noro 2649: \JP :: $B7W;;$*$h$SI=<(MQ%Q%i%a%?$N@_Dj(B, $B;2>H(B
2650: \BEG :: Set and show various parameters for cotrolling computations
2651: and showing informations.
2652: \E
1.1 noro 2653: @end table
2654:
2655: @table @var
2656: @item return
1.2 noro 2657: \JP $B@_DjCM(B
2658: \EG value currently set
1.1 noro 2659: @item list
1.2 noro 2660: \JP $B%j%9%H(B
2661: \EG list
1.7 noro 2662: @item i
2663: \JP $B@0?t(B
2664: \EG integer
1.1 noro 2665: @end table
2666:
2667: @itemize @bullet
1.2 noro 2668: \BJP
1.1 noro 2669: @item
1.5 noro 2670: @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 2671: $B$J%Q%i%a%?$r@_Dj(B, $B;2>H$9$k(B.
2672: @item
2673: $B0z?t$,$J$$>l9g(B, $B8=:_$N@_Dj$,JV$5$l$k(B.
2674: @item
2675: $B0z?t$O(B, @code{["Print",1,"NoSugar",1,...]} $B$J$k7A$N%j%9%H$G(B, $B:8$+$i=g$K(B
2676: $B@_Dj$5$l$k(B. $B%Q%i%a%?L>$OJ8;zNs$GM?$($kI,MW$,$"$k(B.
2677: @item
1.7 noro 2678: @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
2679: $B$G$-$k(B. $B@_Dj$5$l$kCM$O<!$NDL$j$G$"$k!#(B
2680: @table @var
2681: @item i=0
2682: @code{Print=0}, @code{PrintShort=0}
2683: @item i=1
2684: @code{Print=1}, @code{PrintShort=0}
2685: @item i=2
2686: @code{Print=0}, @code{PrintShort=1}
2687: @end table
2688: $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
2689: $BH!?t$K$*$$$F(B, $B$=$N%5%V%k!<%A%s$,Cf4V>pJs$NI=<((B
1.1 noro 2690: $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 2691: \E
2692: \BEG
2693: @item
2694: @code{dp_gr_flags()} sets and shows various parameters for Groebner basis
2695: computation.
2696: @item
2697: If no argument is specified the current settings are returned.
2698: @item
2699: Arguments must be specified as a list such as
2700: @code{["Print",1,"NoSugar",1,...]}. Names of parameters must be character
2701: strings.
2702: @item
2703: @code{dp_gr_print()} is used to set and show the value of a parameter
1.7 noro 2704: @code{Print} and @code{PrintShort}.
2705: @table @var
2706: @item i=0
2707: @code{Print=0}, @code{PrintShort=0}
2708: @item i=1
2709: @code{Print=1}, @code{PrintShort=0}
2710: @item i=2
2711: @code{Print=0}, @code{PrintShort=1}
2712: @end table
2713: This functions is prepared to get quickly the value
2714: when a user defined function calling @code{dp_gr_main()} etc.
1.2 noro 2715: uses the value as a flag for showing intermediate informations.
2716: \E
1.1 noro 2717: @end itemize
2718:
2719: @table @t
1.2 noro 2720: \JP @item $B;2>H(B
2721: \EG @item References
2722: \JP @fref{$B7W;;$*$h$SI=<($N@)8f(B}
2723: \EG @fref{Controlling Groebner basis computations}
1.1 noro 2724: @end table
2725:
1.2 noro 2726: \JP @node dp_ord,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2727: \EG @node dp_ord,,, Functions for Groebner basis computation
1.1 noro 2728: @subsection @code{dp_ord}
2729: @findex dp_ord
2730:
2731: @table @t
2732: @item dp_ord([@var{order}])
1.2 noro 2733: \JP :: $BJQ?t=g=x7?$N@_Dj(B, $B;2>H(B
2734: \EG :: Set and show the ordering type.
1.1 noro 2735: @end table
2736:
2737: @table @var
2738: @item return
1.2 noro 2739: \JP $BJQ?t=g=x7?(B ($B?t(B, $B%j%9%H$^$?$O9TNs(B)
2740: \EG ordering type (number, list or matrix)
1.1 noro 2741: @item order
1.2 noro 2742: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
2743: \EG number, list or matrix
1.1 noro 2744: @end table
2745:
2746: @itemize @bullet
1.2 noro 2747: \BJP
1.1 noro 2748: @item
2749: $B0z?t$,$"$k;~(B, $BJQ?t=g=x7?$r(B @var{order} $B$K@_Dj$9$k(B. $B0z?t$,$J$$;~(B,
2750: $B8=:_@_Dj$5$l$F$$$kJQ?t=g=x7?$rJV$9(B.
2751:
2752: @item
2753: $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
2754: $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
2755: $B9T$o$l$k(B.
2756:
2757: @item
2758: @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()}
2759: $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.
2760:
2761: @item
2762: $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,
2763: $B$=$NB?9`<0$,@8@.$5$l$?;~E@$K$*$1$kJQ?t=g=x7?$,(B, $B;MB'1i;;;~$K@5$7$/@_Dj(B
2764: $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
2765: $B7?$K4p$E$$$F@8@.$5$l$?$b$N$G$J$1$l$P$J$i$J$$(B.
2766:
2767: @item
2768: $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
2769: $BJQ?t=g=x7?$r@5$7$/@_Dj$7$J$1$l$P$J$i$J$$(B.
1.23 noro 2770:
2771: @item
2772: $B0z?t$,%j%9%H$N>l9g(B, $B<+M32C72$K$*$1$k9`=g=x7?$r@_Dj$9$k(B. $B0z?t$,(B@code{[0,Ord]} $B$N>l9g(B,
2773: $BB?9`<04D>e$G(B @code{Ord} $B$G;XDj$5$l$k9`=g=x$K4p$E$/(B TOP $B=g=x(B, $B0z?t$,(B @code{[1,Ord]} $B$N>l9g(B
2774: OPT $B=g=x$r@_Dj$9$k(B.
2775:
1.2 noro 2776: \E
2777: \BEG
2778: @item
2779: If an argument is specified, the function
2780: sets the current ordering type to @var{order}.
2781: If no argument is specified, the function returns the ordering
2782: type currently set.
2783:
2784: @item
2785: There are two types of functions concerning distributed polynomial,
2786: functions which take a ordering type and those which don't take it.
2787: The latter ones use the current setting.
2788:
2789: @item
2790: Functions such as @code{gr()}, which need a ordering type as an argument,
2791: call @code{dp_ord()} internally during the execution.
2792: The setting remains after the execution.
2793:
2794: Fundamental arithmetics for distributed polynomial also use the current
2795: setting. Therefore, when such arithmetics for distributed polynomials
2796: are done, the current setting must coincide with the ordering type
2797: which was used upon the creation of the polynomials. It is assumed
2798: that such polynomials were generated under the same ordering type.
2799:
2800: @item
2801: Type of term ordering must be correctly set by this function
2802: when functions other than top level functions are called directly.
1.23 noro 2803:
2804: @item
2805: If the argument is a list, then an ordering type in a free module is set.
2806: If the argument is @code{[0,Ord]} then a TOP ordering based on the ordering type specified
2807: by @code{Ord} is set.
2808: If the argument is @code{[1,Ord]} then a POT ordering is set.
1.2 noro 2809: \E
1.1 noro 2810: @end itemize
2811:
2812: @example
2813: [19] dp_ord(0)$
2814: [20] <<1,2,3>>+<<3,1,1>>;
2815: (1)*<<1,2,3>>+(1)*<<3,1,1>>
2816: [21] dp_ord(2)$
2817: [22] <<1,2,3>>+<<3,1,1>>;
2818: (1)*<<3,1,1>>+(1)*<<1,2,3>>
2819: @end example
2820:
2821: @table @t
1.2 noro 2822: \JP @item $B;2>H(B
2823: \EG @item References
2824: \JP @fref{$B9`=g=x$N@_Dj(B}
2825: \EG @fref{Setting term orderings}
1.1 noro 2826: @end table
2827:
1.18 noro 2828: \JP @node dp_set_weight dp_set_top_weight dp_weyl_set_weight,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2829: \EG @node dp_set_weight dp_set_top_weight dp_weyl_set_weight,,, Functions for Groebner basis computation
2830: @subsection @code{dp_set_weight}, @code{dp_set_top_weight}, @code{dp_weyl_set_weight}
2831: @findex dp_set_weight
2832: @findex dp_set_top_weight
2833: @findex dp_weyl_set_weight
2834:
2835: @table @t
2836: @item dp_set_weight([@var{weight}])
2837: \JP :: sugar weight $B$N@_Dj(B, $B;2>H(B
2838: \EG :: Set and show the sugar weight.
2839: @item dp_set_top_weight([@var{weight}])
2840: \JP :: top weight $B$N@_Dj(B, $B;2>H(B
2841: \EG :: Set and show the top weight.
2842: @item dp_weyl_set_weight([@var{weight}])
2843: \JP :: weyl weight $B$N@_Dj(B, $B;2>H(B
2844: \EG :: Set and show the weyl weight.
2845: @end table
2846:
2847: @table @var
2848: @item return
2849: \JP $B%Y%/%H%k(B
2850: \EG a vector
2851: @item weight
2852: \JP $B@0?t$N%j%9%H$^$?$O%Y%/%H%k(B
2853: \EG a list or vector of integers
2854: @end table
2855:
2856: @itemize @bullet
2857: \BJP
2858: @item
2859: @code{dp_set_weight} $B$O(B sugar weight $B$r(B @var{weight} $B$K@_Dj$9$k(B. $B0z?t$,$J$$;~(B,
2860: $B8=:_@_Dj$5$l$F$$$k(B sugar weight $B$rJV$9(B. sugar weight $B$O@5@0?t$r@.J,$H$9$k%Y%/%H%k$G(B,
2861: $B3FJQ?t$N=E$_$rI=$9(B. $B<!?t$D$-=g=x$K$*$$$F(B, $BC19`<0$N<!?t$r7W;;$9$k:]$KMQ$$$i$l$k(B.
2862: $B@F<!2=JQ?tMQ$K(B, $BKvHx$K(B 1 $B$rIU$12C$($F$*$/$H0BA4$G$"$k(B.
2863: @item
2864: @code{dp_set_top_weight} $B$O(B top weight $B$r(B @var{weight} $B$K@_Dj$9$k(B. $B0z?t$,$J$$;~(B,
2865: $B8=:_@_Dj$5$l$F$$$k(B top weight $B$rJV$9(B. top weight $B$,@_Dj$5$l$F$$$k$H$-(B,
2866: $B$^$:(B top weight $B$K$h$kC19`<0Hf3S$r@h$K9T$&(B. tie breaker $B$H$7$F8=:_@_Dj$5$l$F$$$k(B
2867: $B9`=g=x$,MQ$$$i$l$k$,(B, $B$3$NHf3S$K$O(B top weight $B$OMQ$$$i$l$J$$(B.
2868:
2869: @item
2870: @code{dp_weyl_set_weight} $B$O(B weyl weight $B$r(B @var{weight} $B$K@_Dj$9$k(B. $B0z?t$,$J$$;~(B,
2871: $B8=:_@_Dj$5$l$F$$$k(B weyl weight $B$rJV$9(B. weyl weight w $B$r@_Dj$9$k$H(B,
2872: $B9`=g=x7?(B 11 $B$G$N7W;;$K$*$$$F(B, (-w,w) $B$r(B top weight, tie breaker $B$r(B graded reverse lex
2873: $B$H$7$?9`=g=x$,@_Dj$5$l$k(B.
2874: \E
2875: \BEG
2876: @item
2877: @code{dp_set_weight} sets the sugar weight=@var{weight}. It returns the current sugar weight.
2878: A sugar weight is a vector with positive integer components and it represents the weights of variables.
2879: It is used for computing the weight of a monomial in a graded ordering.
2880: It is recommended to append a component 1 at the end of the weight vector for a homogenizing variable.
2881: @item
2882: @code{dp_set_top_weight} sets the top weight=@var{weight}. It returns the current top weight.
2883: It a top weight is set, the weights of monomials under the top weight are firstly compared.
2884: If the the weights are equal then the current term ordering is applied as a tie breaker, but
2885: the top weight is not used in the tie breaker.
2886:
2887: @item
2888: @code{dp_weyl_set_weight} sets the weyl weigh=@var{weight}. It returns the current weyl weight.
2889: If a weyl weight w is set, in the comparsion by the term order type 11, a term order with
2890: the top weight=(-w,w) and the tie breaker=graded reverse lex is applied.
2891: \E
2892: @end itemize
2893:
2894: @table @t
2895: \JP @item $B;2>H(B
2896: \EG @item References
2897: @fref{Weight}
2898: @end table
2899:
2900:
1.2 noro 2901: \JP @node dp_ptod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2902: \EG @node dp_ptod,,, Functions for Groebner basis computation
1.1 noro 2903: @subsection @code{dp_ptod}
2904: @findex dp_ptod
2905:
2906: @table @t
2907: @item dp_ptod(@var{poly},@var{vlist})
1.2 noro 2908: \JP :: $BB?9`<0$rJ,;6I=8=B?9`<0$KJQ49$9$k(B.
2909: \EG :: Converts an ordinary polynomial into a distributed polynomial.
1.1 noro 2910: @end table
2911:
2912: @table @var
2913: @item return
1.2 noro 2914: \JP $BJ,;6I=8=B?9`<0(B
2915: \EG distributed polynomial
1.1 noro 2916: @item poly
1.2 noro 2917: \JP $BB?9`<0(B
2918: \EG polynomial
1.1 noro 2919: @item vlist
1.2 noro 2920: \JP $B%j%9%H(B
2921: \EG list
1.1 noro 2922: @end table
2923:
2924: @itemize @bullet
1.2 noro 2925: \BJP
1.1 noro 2926: @item
2927: $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.
2928: @item
2929: @var{vlist} $B$K4^$^$l$J$$ITDj85$O(B, $B78?tBN$KB0$9$k$H$7$FJQ49$5$l$k(B.
1.2 noro 2930: \E
2931: \BEG
2932: @item
2933: According to the variable ordering @var{vlist} and current
2934: type of term ordering, this function converts an ordinary
2935: polynomial into a distributed polynomial.
2936: @item
2937: Indeterminates not included in @var{vlist} are regarded to belong to
2938: the coefficient field.
2939: \E
1.1 noro 2940: @end itemize
2941:
2942: @example
2943: [50] dp_ord(0);
2944: 1
2945: [51] dp_ptod((x+y+z)^2,[x,y,z]);
2946: (1)*<<2,0,0>>+(2)*<<1,1,0>>+(1)*<<0,2,0>>+(2)*<<1,0,1>>+(2)*<<0,1,1>>
2947: +(1)*<<0,0,2>>
2948: [52] dp_ptod((x+y+z)^2,[x,y]);
1.5 noro 2949: (1)*<<2,0>>+(2)*<<1,1>>+(1)*<<0,2>>+(2*z)*<<1,0>>+(2*z)*<<0,1>>
2950: +(z^2)*<<0,0>>
1.1 noro 2951: @end example
2952:
2953: @table @t
1.2 noro 2954: \JP @item $B;2>H(B
2955: \EG @item References
1.1 noro 2956: @fref{dp_dtop},
2957: @fref{dp_ord}.
2958: @end table
2959:
1.23 noro 2960: \JP @node dpm_dptodpm,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
2961: \EG @node dpm_dptodpm,,, Functions for Groebner basis computation
2962: @subsection @code{dpm_dptodpm}
2963: @findex dpm_dptodpm
2964:
2965: @table @t
2966: @item dpm_dptodpm(@var{dpoly},@var{pos})
2967: \JP :: $BJ,;6I=8=B?9`<0$r2C72B?9`<0$KJQ49$9$k(B.
2968: \EG :: Converts a distributed polynomial into a module polynomial.
2969: @end table
2970:
2971: @table @var
2972: @item return
2973: \JP $B2C72B?9`<0(B
2974: \EG module polynomial
2975: @item dpoly
2976: \JP $BJ,;6I=8=B?9`<0(B
2977: \EG distributed polynomial
2978: @item pos
2979: \JP $B@5@0?t(B
2980: \EG positive integer
2981: @end table
2982:
2983: @itemize @bullet
2984: \BJP
2985: @item
2986: $BJ,;6I=8=B?9`<0$r2C72B?9`<0$KJQ49$9$k(B.
2987: @item
2988: $B=PNO$O2C72B?9`<0(B @code{dpoly e_pos} $B$G$"$k(B.
2989: \E
2990: \BEG
2991: @item
2992: This function converts a distributed polynomial into a module polynomial.
2993: @item
2994: The output is @code{dpoly e_pos}.
2995: \E
2996: @end itemize
2997:
2998: @example
2999: [50] dp_ord([0,0])$
3000: [51] D=dp_ptod((x+y+z)^2,[x,y,z]);
3001: (1)*<<2,0,0>>+(2)*<<1,1,0>>+(1)*<<0,2,0>>+(2)*<<1,0,1>>+(2)*<<0,1,1>>
3002: +(1)*<<0,0,2>>
3003: [52] dp_dptodpm(D,2);
3004: (1)*<<2,0,0:2>>+(2)*<<1,1,0:2>>+(1)*<<0,2,0:2>>+(2)*<<1,0,1:2>>
3005: +(2)*<<0,1,1:2>>+(1)*<<0,0,2:2>>
3006: @end example
3007:
3008: @table @t
3009: \JP @item $B;2>H(B
3010: \EG @item References
3011: @fref{dp_ptod},
3012: @fref{dp_ord}.
3013: @end table
3014:
3015: \JP @node dpm_ltod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3016: \EG @node dpm_ltod,,, Functions for Groebner basis computation
3017: @subsection @code{dpm_ltod}
3018: @findex dpm_ltod
3019:
3020: @table @t
3021: @item dpm_dptodpm(@var{plist},@var{vlist})
3022: \JP :: $BB?9`<0%j%9%H$r2C72B?9`<0$KJQ49$9$k(B.
3023: \EG :: Converts a list of polynomials into a module polynomial.
3024: @end table
3025:
3026: @table @var
3027: @item return
3028: \JP $B2C72B?9`<0(B
3029: \EG module polynomial
3030: @item plist
3031: \JP $BB?9`<0%j%9%H(B
3032: \EG list of polynomials
3033: @item vlist
3034: \JP $BJQ?t%j%9%H(B
3035: \EG list of variables
3036: @end table
3037:
3038: @itemize @bullet
3039: \BJP
3040: @item
3041: $BB?9`<0%j%9%H$r2C72B?9`<0$KJQ49$9$k(B.
3042: @item
3043: @code{[p1,...,pm]} $B$O(B @code{p1 e1+...+pm em} $B$KJQ49$5$l$k(B.
3044: \E
3045: \BEG
3046: @item
3047: This function converts a list of polynomials into a module polynomial.
3048: @item
3049: @code{[p1,...,pm]} is converted into @code{p1 e1+...+pm em}.
3050: \E
3051: @end itemize
3052:
3053: @example
3054: [2126] dp_ord([0,0])$
3055: [2127] dpm_ltod([x^2+y^2,x,y-z],[x,y,z]);
3056: (1)*<<2,0,0:1>>+(1)*<<0,2,0:1>>+(1)*<<1,0,0:2>>+(1)*<<0,1,0:3>>
3057: +(-1)*<<0,0,1:3>>
3058: @end example
3059:
3060: @table @t
3061: \JP @item $B;2>H(B
3062: \EG @item References
3063: @fref{dpm_dtol},
3064: @fref{dp_ord}.
3065: @end table
3066:
3067: \JP @node dpm_dtol,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3068: \EG @node dpm_dtol,,, Functions for Groebner basis computation
3069: @subsection @code{dpm_dtol}
3070: @findex dpm_dtol
3071:
3072: @table @t
3073: @item dpm_dptodpm(@var{poly},@var{vlist})
3074: \JP :: $B2C72B?9`<0$rB?9`<0%j%9%H$KJQ49$9$k(B.
3075: \EG :: Converts a module polynomial into a list of polynomials.
3076: @end table
3077:
3078: @table @var
3079: @item return
3080: \JP $BB?9`<0%j%9%H(B
3081: \EG list of polynomials
3082: @item poly
3083: \JP $B2C72B?9`<0(B
3084: \EG module polynomial
3085: @item vlist
3086: \JP $BJQ?t%j%9%H(B
3087: \EG list of variables
3088: @end table
3089:
3090: @itemize @bullet
3091: \BJP
3092: @item
3093: $B2C72B?9`<0$rB?9`<0%j%9%H$KJQ49$9$k(B.
3094: @item
3095: @code{p1 e1+...+pm em} $B$O(B @code{[p1,...,pm]} $B$KJQ49$5$l$k(B.
3096: @item
3097: $B=PNO%j%9%H$ND9$5$O(B, @code{poly} $B$K4^$^$l$kI8=`4pDl$N:GBg%$%s%G%C%/%9$H$J$k(B.
3098: \E
3099: \BEG
3100: @item
3101: This function converts a module polynomial into a list of polynomials.
3102: @item
3103: @code{p1 e1+...+pm em} is converted into @code{[p1,...,pm]}.
3104: @item
3105: The length of the output list is equal to the largest index among those of the standard bases
3106: containd in @code{poly}.
3107: \E
3108: @end itemize
3109:
3110: @example
3111: [2126] dp_ord([0,0])$
3112: [2127] D=(1)*<<2,0,0:1>>+(1)*<<0,2,0:1>>+(1)*<<1,0,0:2>>+(1)*<<0,1,0:3>>
3113: +(-1)*<<0,0,1:3>>$
3114: [2128] dpm_dtol(D,[x,y,z]);
3115: [x^2+y^2,x,y-z]
3116: @end example
3117:
3118: @table @t
3119: \JP @item $B;2>H(B
3120: \EG @item References
3121: @fref{dpm_ltod},
3122: @fref{dp_ord}.
3123: @end table
3124:
1.2 noro 3125: \JP @node dp_dtop,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3126: \EG @node dp_dtop,,, Functions for Groebner basis computation
1.1 noro 3127: @subsection @code{dp_dtop}
3128: @findex dp_dtop
3129:
3130: @table @t
3131: @item dp_dtop(@var{dpoly},@var{vlist})
1.2 noro 3132: \JP :: $BJ,;6I=8=B?9`<0$rB?9`<0$KJQ49$9$k(B.
3133: \EG :: Converts a distributed polynomial into an ordinary polynomial.
1.1 noro 3134: @end table
3135:
3136: @table @var
3137: @item return
1.2 noro 3138: \JP $BB?9`<0(B
3139: \EG polynomial
1.1 noro 3140: @item dpoly
1.2 noro 3141: \JP $BJ,;6I=8=B?9`<0(B
3142: \EG distributed polynomial
1.1 noro 3143: @item vlist
1.2 noro 3144: \JP $B%j%9%H(B
3145: \EG list
1.1 noro 3146: @end table
3147:
3148: @itemize @bullet
1.2 noro 3149: \BJP
1.1 noro 3150: @item
3151: $BJ,;6I=8=B?9`<0$r(B, $BM?$($i$l$?ITDj85%j%9%H$rMQ$$$FB?9`<0$KJQ49$9$k(B.
3152: @item
3153: $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 3154: \E
3155: \BEG
3156: @item
3157: This function converts a distributed polynomial into an ordinary polynomial
3158: according to a list of indeterminates @var{vlist}.
3159: @item
3160: @var{vlist} is such a list that its length coincides with the number of
3161: variables of @var{dpoly}.
3162: \E
1.1 noro 3163: @end itemize
3164:
3165: @example
3166: [53] T=dp_ptod((x+y+z)^2,[x,y]);
1.5 noro 3167: (1)*<<2,0>>+(2)*<<1,1>>+(1)*<<0,2>>+(2*z)*<<1,0>>+(2*z)*<<0,1>>
3168: +(z^2)*<<0,0>>
1.1 noro 3169: [54] P=dp_dtop(T,[a,b]);
3170: z^2+(2*a+2*b)*z+a^2+2*b*a+b^2
3171: @end example
3172:
1.2 noro 3173: \JP @node dp_mod dp_rat,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3174: \EG @node dp_mod dp_rat,,, Functions for Groebner basis computation
1.1 noro 3175: @subsection @code{dp_mod}, @code{dp_rat}
3176: @findex dp_mod
3177: @findex dp_rat
3178:
3179: @table @t
3180: @item dp_mod(@var{p},@var{mod},@var{subst})
1.2 noro 3181: \JP :: $BM-M}?t78?tJ,;6I=8=B?9`<0$NM-8BBN78?t$X$NJQ49(B
3182: \EG :: Converts a disributed polynomial into one with coefficients in a finite field.
1.1 noro 3183: @item dp_rat(@var{p})
1.2 noro 3184: \JP :: $BM-8BBN78?tJ,;6I=8=B?9`<0$NM-M}?t78?t$X$NJQ49(B
3185: \BEG
3186: :: Converts a distributed polynomial with coefficients in a finite field into
3187: one with coefficients in the rationals.
3188: \E
1.1 noro 3189: @end table
3190:
3191: @table @var
3192: @item return
1.2 noro 3193: \JP $BJ,;6I=8=B?9`<0(B
3194: \EG distributed polynomial
1.1 noro 3195: @item p
1.2 noro 3196: \JP $BJ,;6I=8=B?9`<0(B
3197: \EG distributed polynomial
1.1 noro 3198: @item mod
1.2 noro 3199: \JP $BAG?t(B
3200: \EG prime
1.1 noro 3201: @item subst
1.2 noro 3202: \JP $B%j%9%H(B
3203: \EG list
1.1 noro 3204: @end table
3205:
3206: @itemize @bullet
1.2 noro 3207: \BJP
1.1 noro 3208: @item
3209: @code{dp_nf_mod()}, @code{dp_true_nf_mod()} $B$O(B, $BF~NO$H$7$FM-8BBN78?t$N(B
3210: $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
3211: $BM-M}?t78?tJ,;6I=8=B?9`<0$rJQ49$7$FMQ$$$k$3$H$,$G$-$k(B. $B$^$?(B, $BF@$i$l$?(B
3212: $B7k2L$O(B, $BM-8BBN78?tB?9`<0$H$O1i;;$G$-$k$,(B, $BM-M}?t78?tB?9`<0$H$O1i;;$G$-$J$$(B
3213: $B$?$a(B, @code{dp_rat()} $B$K$h$jJQ49$9$kI,MW$,$"$k(B.
3214: @item
3215: $BM-8BBN78?t$N1i;;$K$*$$$F$O(B, $B$"$i$+$8$a(B @code{setmod()} $B$K$h$jM-8BBN$N85$N(B
3216: $B8D?t$r;XDj$7$F$*$/I,MW$,$"$k(B.
3217: @item
3218: @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
3219: $B$7$?8eM-8BBN78?t$KJQ49$9$k$H$$$&A`:n$r9T$&:]$N(B, $BBeF~CM$r;XDj$9$k$b$N$G(B,
3220: @code{[[@var{var},@var{value}],...]} $B$N7A$N%j%9%H$G$"$k(B.
1.2 noro 3221: \E
3222: \BEG
3223: @item
3224: @code{dp_nf_mod()} and @code{dp_true_nf_mod()} require
3225: distributed polynomials with coefficients in a finite field as arguments.
3226: @code{dp_mod()} is used to convert distributed polynomials with rational
3227: number coefficients into appropriate ones.
3228: Polynomials with coefficients in a finite field
3229: cannot be used as inputs of operations with polynomials
3230: with rational number coefficients. @code{dp_rat()} is used for such cases.
3231: @item
3232: The ground finite field must be set in advance by using @code{setmod()}.
3233: @item
3234: @var{subst} is such a list as @code{[[@var{var},@var{value}],...]}.
3235: This is valid when the ground field of the input polynomial is a
3236: rational function field. @var{var}'s are variables in the ground field and
3237: the list means that @var{value} is substituted for @var{var} before
3238: converting the coefficients into elements of a finite field.
3239: \E
1.1 noro 3240: @end itemize
3241:
3242: @example
3243: @end example
3244:
3245: @table @t
1.2 noro 3246: \JP @item $B;2>H(B
3247: \EG @item References
1.18 noro 3248: @fref{dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod dp_weyl_nf dp_weyl_nf_mod},
1.1 noro 3249: @fref{subst psubst},
3250: @fref{setmod}.
3251: @end table
3252:
1.2 noro 3253: \JP @node dp_homo dp_dehomo,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3254: \EG @node dp_homo dp_dehomo,,, Functions for Groebner basis computation
1.1 noro 3255: @subsection @code{dp_homo}, @code{dp_dehomo}
3256: @findex dp_homo
3257: @findex dp_dehomo
3258:
3259: @table @t
3260: @item dp_homo(@var{dpoly})
1.2 noro 3261: \JP :: $BJ,;6I=8=B?9`<0$N@F<!2=(B
3262: \EG :: Homogenize a distributed polynomial
1.1 noro 3263: @item dp_dehomo(@var{dpoly})
1.2 noro 3264: \JP :: $B@F<!J,;6I=8=B?9`<0$NHs@F<!2=(B
3265: \EG :: Dehomogenize a homogenious distributed polynomial
1.1 noro 3266: @end table
3267:
3268: @table @var
3269: @item return
1.2 noro 3270: \JP $BJ,;6I=8=B?9`<0(B
3271: \EG distributed polynomial
1.1 noro 3272: @item dpoly
1.2 noro 3273: \JP $BJ,;6I=8=B?9`<0(B
3274: \EG distributed polynomial
1.1 noro 3275: @end table
3276:
3277: @itemize @bullet
1.2 noro 3278: \BJP
1.1 noro 3279: @item
3280: @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
3281: 1 $B?-$P$7(B, $B:G8e$N@.J,$NCM$r(B @var{d}-@code{deg(@var{t})}
3282: (@var{d} $B$O(B @var{dpoly} $B$NA4<!?t(B) $B$H$7$?J,;6I=8=B?9`<0$rJV$9(B.
3283: @item
3284: @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
3285: $B$r<h$j=|$$$?J,;6B?9`<0$rJV$9(B.
3286: @item
3287: $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
3288: $B@5$7$/@_Dj$9$kI,MW$,$"$k(B.
3289: @item
3290: @code{hgr()} $B$J$I$K$*$$$F(B, $BFbItE*$KMQ$$$i$l$F$$$k(B.
1.2 noro 3291: \E
3292: \BEG
3293: @item
3294: @code{dp_homo()} makes a copy of @var{dpoly}, extends
3295: the length of the exponent vector of each term @var{t} in the copy by 1,
3296: and sets the value of the newly appended
3297: component to @var{d}-@code{deg(@var{t})}, where @var{d} is the total
3298: degree of @var{dpoly}.
3299: @item
3300: @code{dp_dehomo()} make a copy of @var{dpoly} and removes the last component
3301: of each terms in the copy.
3302: @item
3303: Appropriate term orderings must be set when the results are used as inputs
3304: of some operations.
3305: @item
3306: These are used internally in @code{hgr()} etc.
3307: \E
1.1 noro 3308: @end itemize
3309:
3310: @example
3311: [202] X=<<1,2,3>>+3*<<1,2,1>>;
3312: (1)*<<1,2,3>>+(3)*<<1,2,1>>
3313: [203] dp_homo(X);
3314: (1)*<<1,2,3,0>>+(3)*<<1,2,1,2>>
3315: [204] dp_dehomo(@@);
3316: (1)*<<1,2,3>>+(3)*<<1,2,1>>
3317: @end example
3318:
3319: @table @t
1.2 noro 3320: \JP @item $B;2>H(B
3321: \EG @item References
1.1 noro 3322: @fref{gr hgr gr_mod}.
3323: @end table
3324:
1.2 noro 3325: \JP @node dp_ptozp dp_prim,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3326: \EG @node dp_ptozp dp_prim,,, Functions for Groebner basis computation
1.1 noro 3327: @subsection @code{dp_ptozp}, @code{dp_prim}
3328: @findex dp_ptozp
3329: @findex dp_prim
3330:
3331: @table @t
3332: @item dp_ptozp(@var{dpoly})
1.2 noro 3333: \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.
3334: \BEG
3335: :: Converts a distributed polynomial @var{poly} with rational coefficients
3336: into an integral distributed polynomial such that GCD of all its coefficients
3337: is 1.
3338: \E
1.19 noro 3339: @item dp_prim(@var{dpoly})
1.2 noro 3340: \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.
3341: \BEG
3342: :: Converts a distributed polynomial @var{poly} with rational function
3343: coefficients into an integral distributed polynomial such that polynomial
3344: GCD of all its coefficients is 1.
3345: \E
1.1 noro 3346: @end table
3347:
3348: @table @var
3349: @item return
1.2 noro 3350: \JP $BJ,;6I=8=B?9`<0(B
3351: \EG distributed polynomial
1.1 noro 3352: @item dpoly
1.2 noro 3353: \JP $BJ,;6I=8=B?9`<0(B
3354: \EG distributed polynomial
1.1 noro 3355: @end table
3356:
3357: @itemize @bullet
1.2 noro 3358: \BJP
1.1 noro 3359: @item
3360: @code{dp_ptozp()} $B$O(B, @code{ptozp()} $B$KAjEv$9$kA`:n$rJ,;6I=8=B?9`<0$K(B
3361: $BBP$7$F9T$&(B. $B78?t$,B?9`<0$r4^$`>l9g(B, $B78?t$K4^$^$l$kB?9`<06&DL0x;R$O(B
3362: $B<h$j=|$+$J$$(B.
3363: @item
3364: @code{dp_prim()} $B$O(B, $B78?t$,B?9`<0$r4^$`>l9g(B, $B78?t$K4^$^$l$kB?9`<06&DL0x;R(B
3365: $B$r<h$j=|$/(B.
1.2 noro 3366: \E
3367: \BEG
3368: @item
3369: @code{dp_ptozp()} executes the same operation as @code{ptozp()} for
3370: a distributed polynomial. If the coefficients include polynomials,
3371: polynomial contents included in the coefficients are not removed.
3372: @item
3373: @code{dp_prim()} removes polynomial contents.
3374: \E
1.1 noro 3375: @end itemize
3376:
3377: @example
3378: [208] X=dp_ptod(3*(x-y)*(y-z)*(z-x),[x]);
3379: (-3*y+3*z)*<<2>>+(3*y^2-3*z^2)*<<1>>+(-3*z*y^2+3*z^2*y)*<<0>>
3380: [209] dp_ptozp(X);
3381: (-y+z)*<<2>>+(y^2-z^2)*<<1>>+(-z*y^2+z^2*y)*<<0>>
3382: [210] dp_prim(X);
3383: (1)*<<2>>+(-y-z)*<<1>>+(z*y)*<<0>>
3384: @end example
3385:
3386: @table @t
1.2 noro 3387: \JP @item $B;2>H(B
3388: \EG @item References
1.1 noro 3389: @fref{ptozp}.
3390: @end table
3391:
1.18 noro 3392: \JP @node dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod dp_weyl_nf dp_weyl_nf_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3393: \EG @node dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod dp_weyl_nf dp_weyl_nf_mod,,, Functions for Groebner basis computation
1.1 noro 3394: @subsection @code{dp_nf}, @code{dp_nf_mod}, @code{dp_true_nf}, @code{dp_true_nf_mod}
3395: @findex dp_nf
3396: @findex dp_true_nf
3397: @findex dp_nf_mod
3398: @findex dp_true_nf_mod
1.18 noro 3399: @findex dp_weyl_nf
3400: @findex dp_weyl_nf_mod
1.1 noro 3401:
3402: @table @t
3403: @item dp_nf(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce})
1.18 noro 3404: @item dp_weyl_nf(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce})
1.1 noro 3405: @item dp_nf_mod(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce},@var{mod})
1.18 noro 3406: @item dp_weyl_nf_mod(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce},@var{mod})
1.2 noro 3407: \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 3408:
1.2 noro 3409: \BEG
3410: :: Computes the normal form of a distributed polynomial.
3411: (The result may be multiplied by a constant in the ground field.)
3412: \E
1.1 noro 3413: @item dp_true_nf(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce})
3414: @item dp_true_nf_mod(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce},@var{mod})
1.2 noro 3415: \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)
3416: \BEG
3417: :: Computes the normal form of a distributed polynomial. (The true result
3418: is returned in such a list as @code{[numerator, denominator]})
3419: \E
1.1 noro 3420: @end table
3421:
3422: @table @var
3423: @item return
1.2 noro 3424: \JP @code{dp_nf()} : $BJ,;6I=8=B?9`<0(B, @code{dp_true_nf()} : $B%j%9%H(B
3425: \EG @code{dp_nf()} : distributed polynomial, @code{dp_true_nf()} : list
1.1 noro 3426: @item indexlist
1.2 noro 3427: \JP $B%j%9%H(B
3428: \EG list
1.1 noro 3429: @item dpoly
1.2 noro 3430: \JP $BJ,;6I=8=B?9`<0(B
3431: \EG distributed polynomial
1.1 noro 3432: @item dpolyarray
1.2 noro 3433: \JP $BG[Ns(B
3434: \EG array of distributed polynomial
1.1 noro 3435: @item fullreduce
1.2 noro 3436: \JP $B%U%i%0(B
3437: \EG flag
1.1 noro 3438: @item mod
1.2 noro 3439: \JP $BAG?t(B
3440: \EG prime
1.1 noro 3441: @end table
3442:
3443: @itemize @bullet
1.2 noro 3444: \BJP
1.1 noro 3445: @item
3446: $BJ,;6I=8=B?9`<0(B @var{dpoly} $B$N@55,7A$r5a$a$k(B.
3447: @item
1.18 noro 3448: $BL>A0$K(B weyl $B$r4^$`4X?t$O%o%$%kBe?t$K$*$1$k@55,7A7W;;$r9T$&(B. $B0J2<$N@bL@$O(B weyl $B$r4^$`$b$N$KBP$7$F$bF1MM$K@.N)$9$k(B.
3449: @item
1.1 noro 3450: @code{dp_nf_mod()}, @code{dp_true_nf_mod()} $B$NF~NO$O(B, @code{dp_mod()} $B$J$I(B
3451: $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.
3452: @item
3453: $B7k2L$KM-M}?t(B, $BM-M}<0$,4^$^$l$k$N$rHr$1$k$?$a(B, @code{dp_nf()} $B$O(B
3454: $B??$NCM$NDj?tG\$NCM$rJV$9(B. $BM-M}<078?t$N>l9g$N(B @code{dp_nf_mod()} $B$bF1MM(B
3455: $B$G$"$k$,(B, $B78?tBN$,M-8BBN$N>l9g(B @code{dp_nf_mod()} $B$O??$NCM$rJV$9(B.
3456: @item
3457: @code{dp_true_nf()}, @code{dp_true_nf_mod()} $B$O(B,
3458: @code{[@var{nm},@var{dn}]} $B$J$k7A$N%j%9%H$rJV$9(B.
3459: $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
3460: $B?t$^$?$OB?9`<0$G(B @var{nm}/@var{dn} $B$,??$NCM$H$J$k(B.
3461: @item
3462: @var{dpolyarray} $B$OJ,;6I=8=B?9`<0$rMWAG$H$9$k%Y%/%H%k(B,
3463: @var{indexlist} $B$O@55,2=7W;;$KMQ$$$k(B @var{dpolyarray} $B$NMWAG$N%$%s%G%C%/%9(B
3464: $B$N%j%9%H(B.
3465: @item
3466: @var{fullreduce} $B$,(B 0 $B$G$J$$$H$-A4$F$N9`$KBP$7$F4JLs$r9T$&(B. @var{fullreduce}
3467: $B$,(B 0 $B$N$H$-F,9`$N$_$KBP$7$F4JLs$r9T$&(B.
3468: @item
3469: @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.
3470: @item
3471: $B0lHL$K$O(B @var{indexlist} $B$NM?$(J}$K$h$jH!?t$NCM$O0[$J$k2DG=@-$,$"$k$,(B,
3472: $B%0%l%V%J4pDl$KBP$7$F$O0l0UE*$KDj$^$k(B.
3473: @item
3474: $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
3475: $B$KJXMx$G$"$k(B. $BC10l$N1i;;$K4X$7$F$O(B, @code{p_nf}, @code{p_true_nf} $B$r(B
3476: $BMQ$$$k$H$h$$(B.
1.2 noro 3477: \E
3478: \BEG
3479: @item
3480: Computes the normal form of a distributed polynomial.
3481: @item
1.18 noro 3482: Functions whose name contain @code{weyl} compute normal forms in Weyl algebra. The description below also applies to
3483: the functions for Weyl algebra.
3484: @item
1.2 noro 3485: @code{dp_nf_mod()} and @code{dp_true_nf_mod()} require
3486: distributed polynomials with coefficients in a finite field as arguments.
3487: @item
3488: The result of @code{dp_nf()} may be multiplied by a constant in the
3489: ground field in order to make the result integral. The same is true
3490: for @code{dp_nf_mod()}, but it returns the true normal form if
3491: the ground field is a finite field.
3492: @item
3493: @code{dp_true_nf()} and @code{dp_true_nf_mod()} return
3494: such a list as @code{[@var{nm},@var{dn}]}.
3495: Here @var{nm} is a distributed polynomial whose coefficients are integral
3496: in the ground field, @var{dn} is an integral element in the ground
3497: field and @var{nm}/@var{dn} is the true normal form.
3498: @item
3499: @var{dpolyarray} is a vector whose components are distributed polynomials
3500: and @var{indexlist} is a list of indices which is used for the normal form
3501: computation.
3502: @item
3503: When argument @var{fullreduce} has non-zero value,
3504: all terms are reduced. When it has value 0,
3505: only the head term is reduced.
3506: @item
3507: As for the polynomials specified by @var{indexlist}, one specified by
3508: an index placed at the preceding position has priority to be selected.
3509: @item
3510: In general, the result of the function may be different depending on
3511: @var{indexlist}. However, the result is unique for Groebner bases.
3512: @item
3513: These functions are useful when a fixed non-distributed polynomial set
3514: is used as a set of reducers to compute normal forms of many polynomials.
3515: For single computation @code{p_nf} and @code{p_true_nf} are sufficient.
3516: \E
1.1 noro 3517: @end itemize
3518:
3519: @example
3520: [0] load("gr")$
3521: [64] load("katsura")$
3522: [69] K=katsura(4)$
3523: [70] dp_ord(2)$
3524: [71] V=[u0,u1,u2,u3,u4]$
3525: [72] DP1=newvect(length(K),map(dp_ptod,K,V))$
3526: [73] G=gr(K,V,2)$
3527: [74] DP2=newvect(length(G),map(dp_ptod,G,V))$
3528: [75] T=dp_ptod((u0-u1+u2-u3+u4)^2,V)$
3529: [76] dp_dtop(dp_nf([0,1,2,3,4],T,DP1,1),V);
1.5 noro 3530: u4^2+(6*u3+2*u2+6*u1-2)*u4+9*u3^2+(6*u2+18*u1-6)*u3+u2^2
3531: +(6*u1-2)*u2+9*u1^2-6*u1+1
1.1 noro 3532: [77] dp_dtop(dp_nf([4,3,2,1,0],T,DP1,1),V);
3533: -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
3534: [78] dp_dtop(dp_nf([0,1,2,3,4],T,DP2,1),V);
1.5 noro 3535: -11380879768451657780886122972730785203470970010204714556333530492210
3536: 456775930005716505560062087150928400876150217079820311439477560587583
3537: 488*u4^15+...
1.1 noro 3538: [79] dp_dtop(dp_nf([4,3,2,1,0],T,DP2,1),V);
1.5 noro 3539: -11380879768451657780886122972730785203470970010204714556333530492210
3540: 456775930005716505560062087150928400876150217079820311439477560587583
3541: 488*u4^15+...
1.1 noro 3542: [80] @@78==@@79;
3543: 1
3544: @end example
3545:
3546: @table @t
1.2 noro 3547: \JP @item $B;2>H(B
3548: \EG @item References
1.1 noro 3549: @fref{dp_dtop},
3550: @fref{dp_ord},
3551: @fref{dp_mod dp_rat},
3552: @fref{p_nf p_nf_mod p_true_nf p_true_nf_mod}.
3553: @end table
3554:
1.23 noro 3555: \JP @node dpm_nf dpm_nf_and_quotient,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3556: \EG @node dpm_nf dpm_nf_and_quotient,,, Functions for Groebner basis computation
3557: @subsection @code{dpm_nf}, @code{dpm_nf_and_quotient}
3558: @findex dpm_nf
3559: @findex dpm_nf_and_quotient
3560:
3561: @table @t
3562: @item dpm_nf([@var{indexlist},]@var{dpoly},@var{dpolyarray},@var{fullreduce})
3563: \JP :: $B2C72B?9`<0$N@55,7A$r5a$a$k(B. ($B7k2L$ODj?tG\$5$l$F$$$k2DG=@-$"$j(B)
3564:
3565: \BEG
3566: :: Computes the normal form of a module polynomial.
3567: (The result may be multiplied by a constant in the ground field.)
3568: \E
3569: @item dpm_nf_and_quotient([@var{indexlist},]@var{dpoly},@var{dpolyarray})
3570: \JP :: $B2C72B?9`<0$N@55,7A$H>&$r5a$a$k(B.
3571: \BEG
3572: :: Computes the normal form of a module polynomial and the quotient.
3573: \E
3574: @end table
3575:
3576: @table @var
3577: @item return
3578: \JP @code{dpm_nf()} : $B2C72B?9`<0(B, @code{dpm_nf_and_quotient()} : $B%j%9%H(B
3579: \EG @code{dpm_nf()} : module polynomial, @code{dpm_nf_and_quotient()} : list
3580: @item indexlist
3581: \JP $B%j%9%H(B
3582: \EG list
3583: @item dpoly
3584: \JP $B2C72B?9`<0(B
3585: \EG module polynomial
3586: @item dpolyarray
3587: \JP $BG[Ns(B
3588: \EG array of module polynomial
3589: @end table
3590:
3591: @itemize @bullet
3592: \BJP
3593: @item
3594: $B2C72B?9`<0(B @var{dpoly} $B$N@55,7A$r5a$a$k(B.
3595: @item
3596: $B7k2L$KM-M}?t(B, $BM-M}<0$,4^$^$l$k$N$rHr$1$k$?$a(B, @code{dpm_nf()} $B$O(B
3597: $B??$NCM$NDj?tG\$NCM$rJV$9(B.
3598: @item
3599: @var{dpolyarray} $B$O2C72B?9`<0$rMWAG$H$9$k%Y%/%H%k(B,
3600: @var{indexlist} $B$O@55,2=7W;;$KMQ$$$k(B @var{dpolyarray} $B$NMWAG$N%$%s%G%C%/%9(B
3601: @item
3602: @var{indexlist} $B$,M?$($i$l$F$$$k>l9g(B, @var{dpolyarray} $B$NCf$G(B, @var{indexlist} $B$G;XDj$5$l$?$b$N$N$_$,(B, $BA0$NJ}$+$iM%@hE*$K;H$o$l$k(B.
3603: @var{indexlist} $B$,M?$($i$l$F$$$J$$>l9g$K$O(B, @var{dpolyarray} $B$NCf$NA4$F$NB?9`<0$,A0$NJ}$+$iM%@hE*$K;H$o$l$k(B.
3604: @item
3605: @code{dpm_nf_and_quotient()} $B$O(B,
3606: @code{[@var{nm},@var{dn},@var{quo}]} $B$J$k7A$N%j%9%H$rJV$9(B.
3607: $B$?$@$7(B, @var{nm} $B$O78?t$KJ,?t$r4^$^$J$$2C72B?9`<0(B, @var{dn} $B$O(B
3608: $B?t$^$?$OB?9`<0$G(B @var{nm}/@var{dn} $B$,??$NCM$H$J$k(B.
3609: @var{quo} $B$O=|;;$N>&$rI=$9G[Ns$G(B, @var{dn}@var{dpoly}=@var{nm}+@var{quo[0]dpolyarray[0]+...} $B$,@.$jN)$D(B.
3610: $B$N%j%9%H(B.
3611: @item
3612: @var{fullreduce} $B$,(B 0 $B$G$J$$$H$-A4$F$N9`$KBP$7$F4JLs$r9T$&(B. @var{fullreduce}
3613: $B$,(B 0 $B$N$H$-F,9`$N$_$KBP$7$F4JLs$r9T$&(B.
3614: \E
3615: \BEG
3616: @item
3617: Computes the normal form of a module polynomial.
3618: @item
3619: The result of @code{dpm_nf()} may be multiplied by a constant in the
3620: ground field in order to make the result integral.
3621: @item
3622: @var{dpolyarray} is a vector whose components are module polynomials
3623: and @var{indexlist} is a list of indices which is used for the normal form
3624: computation.
3625: @item
3626: If @var{indexlist} is given, only the polynomials in @var{dpolyarray} specified in @var{indexlist}
3627: is used in the division. An index placed at the preceding position has priority to be selected.
3628: If @var{indexlist} is not given, all the polynomials in @var{dpolyarray} are used.
3629: @item
3630: @code{dpm_nf_and_quotient()} returns
3631: such a list as @code{[@var{nm},@var{dn},@var{quo}]}.
3632: Here @var{nm} is a module polynomial whose coefficients are integral
3633: in the ground field, @var{dn} is an integral element in the ground
3634: field and @var{nm}/@var{dn} is the true normal form.
3635: @var{quo} is an array containing the quotients of the division satisfying
3636: @var{dn}@var{dpoly}=@var{nm}+@var{quo[0]dpolyarray[0]+...}.
3637: @item
3638: When argument @var{fullreduce} has non-zero value,
3639: all terms are reduced. When it has value 0,
3640: only the head term is reduced.
3641: \E
3642: @end itemize
3643:
3644: @example
3645: [2126] dp_ord([1,0])$
3646: [2127] S=ltov([(1)*<<0,0,2,0:1>>+(1)*<<0,0,1,1:1>>+(1)*<<0,0,0,2:1>>
3647: +(-1)*<<3,0,0,0:2>>+(-1)*<<0,0,2,1:2>>+(-1)*<<0,0,1,2:2>>
3648: +(1)*<<3,0,1,0:3>>+(1)*<<3,0,0,1:3>>+(1)*<<0,0,2,2:3>>,
3649: (-1)*<<0,1,0,0:1>>+(-1)*<<0,0,1,0:1>>+(-1)*<<0,0,0,1:1>>
3650: +(-1)*<<3,0,0,0:3>>+(1)*<<0,1,1,1:3>>,(1)*<<0,1,0,0:2>>
3651: +(1)*<<0,0,1,0:2>>+(1)*<<0,0,0,1:2>>+(-1)*<<0,1,1,0:3>>
3652: +(-1)*<<0,1,0,1:3>>+(-1)*<<0,0,1,1:3>>])$
3653: [2128] U=dpm_sp(S[0],S[1]);
3654: (1)*<<0,0,3,0:1>>+(-1)*<<0,1,1,1:1>>+(1)*<<0,0,2,1:1>>
3655: +(-1)*<<0,1,0,2:1>>+(1)*<<3,1,0,0:2>>+(1)*<<0,1,2,1:2>>
3656: +(1)*<<0,1,1,2:2>>+(-1)*<<3,1,1,0:3>>+(1)*<<3,0,2,0:3>>
3657: +(-1)*<<3,1,0,1:3>>+(-1)*<<0,1,3,1:3>>+(-1)*<<0,1,2,2:3>>
3658: [2129] dpm_nf(U,S,1);
3659: 0
3660: [2130] L=dpm_nf_and_quotient(U,S)$
3661: [2131] Q=L[2]$
3662: [2132] D=L[1]$
3663: [2133] D*U-(Q[1]*S[1]+Q[2]*S[2]);
3664: 0
3665: @end example
3666:
3667: @table @t
3668: \JP @item $B;2>H(B
3669: \EG @item References
3670: @fref{dpm_sp},
3671: @fref{dp_ord}.
3672: @end table
3673:
3674:
1.2 noro 3675: \JP @node dp_hm dp_ht dp_hc dp_rest,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3676: \EG @node dp_hm dp_ht dp_hc dp_rest,,, Functions for Groebner basis computation
1.1 noro 3677: @subsection @code{dp_hm}, @code{dp_ht}, @code{dp_hc}, @code{dp_rest}
3678: @findex dp_hm
3679: @findex dp_ht
3680: @findex dp_hc
3681: @findex dp_rest
3682:
3683: @table @t
3684: @item dp_hm(@var{dpoly})
1.2 noro 3685: \JP :: $BF,C19`<0$r<h$j=P$9(B.
3686: \EG :: Gets the head monomial.
1.1 noro 3687: @item dp_ht(@var{dpoly})
1.2 noro 3688: \JP :: $BF,9`$r<h$j=P$9(B.
3689: \EG :: Gets the head term.
1.1 noro 3690: @item dp_hc(@var{dpoly})
1.2 noro 3691: \JP :: $BF,78?t$r<h$j=P$9(B.
3692: \EG :: Gets the head coefficient.
1.1 noro 3693: @item dp_rest(@var{dpoly})
1.2 noro 3694: \JP :: $BF,C19`<0$r<h$j=|$$$?;D$j$rJV$9(B.
3695: \EG :: Gets the remainder of the polynomial where the head monomial is removed.
1.1 noro 3696: @end table
3697:
3698: @table @var
1.2 noro 3699: \BJP
1.1 noro 3700: @item return
3701: @code{dp_hm()}, @code{dp_ht()}, @code{dp_rest()} : $BJ,;6I=8=B?9`<0(B,
3702: @code{dp_hc()} : $B?t$^$?$OB?9`<0(B
3703: @item dpoly
3704: $BJ,;6I=8=B?9`<0(B
1.2 noro 3705: \E
3706: \BEG
3707: @item return
3708: @code{dp_hm()}, @code{dp_ht()}, @code{dp_rest()} : distributed polynomial
3709: @code{dp_hc()} : number or polynomial
3710: @item dpoly
3711: distributed polynomial
3712: \E
1.1 noro 3713: @end table
3714:
3715: @itemize @bullet
1.2 noro 3716: \BJP
1.1 noro 3717: @item
3718: $B$3$l$i$O(B, $BJ,;6I=8=B?9`<0$N3FItJ,$r<h$j=P$9$?$a$NH!?t$G$"$k(B.
3719: @item
3720: $BJ,;6I=8=B?9`<0(B @var{p} $B$KBP$7<!$,@.$jN)$D(B.
1.2 noro 3721: \E
3722: \BEG
3723: @item
3724: These are used to get various parts of a distributed polynomial.
3725: @item
3726: The next equations hold for a distributed polynomial @var{p}.
3727: \E
1.1 noro 3728: @table @code
3729: @item @var{p} = dp_hm(@var{p}) + dp_rest(@var{p})
3730: @item dp_hm(@var{p}) = dp_hc(@var{p}) dp_ht(@var{p})
3731: @end table
3732: @end itemize
3733:
3734: @example
3735: [87] dp_ord(0)$
3736: [88] X=ptozp((a46^2+7/10*a46+7/48)*u3^4-50/27*a46^2-35/27*a46-49/216)$
3737: [89] T=dp_ptod(X,[u3,u4,a46])$
3738: [90] dp_hm(T);
3739: (2160)*<<4,0,2>>
3740: [91] dp_ht(T);
3741: (1)*<<4,0,2>>
3742: [92] dp_hc(T);
3743: 2160
3744: [93] dp_rest(T);
3745: (1512)*<<4,0,1>>+(315)*<<4,0,0>>+(-4000)*<<0,0,2>>+(-2800)*<<0,0,1>>
3746: +(-490)*<<0,0,0>>
3747: @end example
3748:
1.23 noro 3749: \JP @node dpm_hm dpm_ht dpm_hc dpm_hp dpm_rest,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3750: \EG @node dpm_hm dpm_ht dpm_hc dpm_hp dpm_rest,,, Functions for Groebner basis computation
3751: @subsection @code{dpm_hm}, @code{dpm_ht}, @code{dpm_hc}, @code{dpm_hp}, @code{dpm_rest}
3752: @findex dpm_hm
3753: @findex dpm_ht
3754: @findex dpm_hc
3755: @findex dpm_hp
3756: @findex dpm_rest
3757:
3758: @table @t
3759: @item dpm_hm(@var{dpoly})
3760: \JP :: $B2C72B?9`<0$NF,C19`<0$r<h$j=P$9(B.
3761: \EG :: Gets the head monomial of a module polynomial.
3762: @item dpm_ht(@var{dpoly})
3763: \JP :: $B2C72B?9`<0$NF,9`$r<h$j=P$9(B.
3764: \EG :: Gets the head term of a module polynomial.
3765: @item dpm_hc(@var{dpoly})
3766: \JP :: $B2C72B?9`<0$NF,78?t$r<h$j=P$9(B.
3767: \EG :: Gets the head coefficient of a module polynomial.
3768: @item dpm_hp(@var{dpoly})
3769: \JP :: $B2C72B?9`<0$NF,0LCV$r<h$j=P$9(B.
3770: \EG :: Gets the head position of a module polynomial.
3771: @item dpm_rest(@var{dpoly})
3772: \JP :: $B2C72B?9`<0$NF,C19`<0$r<h$j=|$$$?;D$j$rJV$9(B.
3773: \EG :: Gets the remainder of a module polynomial where the head monomial is removed.
3774: @end table
3775:
3776: @table @var
3777: \BJP
3778: @item return
3779: @code{dp_hm()}, @code{dp_ht()}, @code{dp_rest()} : $B2C72B?9`<0(B,
3780: @code{dp_hc()} : $B?t$^$?$OB?9`<0(B
3781: @item dpoly
3782: $B2C72B?9`<0(B
3783: \E
3784: \BEG
3785: @item return
3786: @code{dpm_hm()}, @code{dpm_ht()}, @code{dpm_rest()} : module polynomial
3787: @code{dpm_hc()} : monomial
3788: @item dpoly
3789: distributed polynomial
3790: \E
3791: @end table
3792:
3793: @itemize @bullet
3794: \BJP
3795: @item
3796: $B$3$l$i$O(B, $B2C72B?9`<0$N3FItJ,$r<h$j=P$9$?$a$NH!?t$G$"$k(B.
3797: @item
3798: @code{dpm_hc()} $B$O(B, @code{dpm_hm()} $B$N(B, $BI8=`4pDl$K4X$9$k78?t$G$"$kC19`<0$rJV$9(B.
3799: $B%9%+%i!<78?t$r<h$j=P$9$K$O(B, $B$5$i$K(B @code{dp_hc()} $B$r<B9T$9$k(B.
3800: @item
3801: @code{dpm_hp()} $B$O(B, $BF,2C72C19`<0$K4^$^$l$kI8=`4pDl$N%$%s%G%C%/%9$rJV$9(B.
3802: \E
3803: \BEG
3804: @item
3805: These are used to get various parts of a module polynomial.
3806: @item
3807: @code{dpm_hc()} returns the monomial that is the coefficient of @code{dpm_hm()} with respect to the
3808: standard base.
3809: For getting its scalar coefficient apply @code{dp_hc()}.
3810: @item
3811: @code{dpm_hp()} returns the index of the standard base conteind in the head module monomial.
3812: \E
3813: @end itemize
3814:
3815: @example
3816: [2126] dp_ord([1,0]);
3817: [1,0]
3818: [2127] F=2*<<1,2,0:2>>-3*<<1,0,2:3>>+<<2,1,0:2>>;
3819: (1)*<<2,1,0:2>>+(2)*<<1,2,0:2>>+(-3)*<<1,0,2:3>>
3820: [2128] M=dpm_hm(F);
3821: (1)*<<2,1,0:2>>
3822: [2129] C=dpm_hc(F);
3823: (1)*<<2,1,0>>
3824: [2130] R=dpm_rest(F);
3825: (2)*<<1,2,0:2>>+(-3)*<<1,0,2:3>>
3826: [2131] dpm_hp(F);
3827: 2
3828: @end example
3829:
3830:
1.2 noro 3831: \JP @node dp_td dp_sugar,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3832: \EG @node dp_td dp_sugar,,, Functions for Groebner basis computation
1.1 noro 3833: @subsection @code{dp_td}, @code{dp_sugar}
3834: @findex dp_td
3835: @findex dp_sugar
3836:
3837: @table @t
3838: @item dp_td(@var{dpoly})
1.2 noro 3839: \JP :: $BF,9`$NA4<!?t$rJV$9(B.
3840: \EG :: Gets the total degree of the head term.
1.1 noro 3841: @item dp_sugar(@var{dpoly})
1.2 noro 3842: \JP :: $BB?9`<0$N(B @code{sugar} $B$rJV$9(B.
3843: \EG :: Gets the @code{sugar} of a polynomial.
1.1 noro 3844: @end table
3845:
3846: @table @var
3847: @item return
1.2 noro 3848: \JP $B<+A3?t(B
3849: \EG non-negative integer
1.1 noro 3850: @item dpoly
1.2 noro 3851: \JP $BJ,;6I=8=B?9`<0(B
3852: \EG distributed polynomial
1.1 noro 3853: @item onoff
1.2 noro 3854: \JP $B%U%i%0(B
3855: \EG flag
1.1 noro 3856: @end table
3857:
3858: @itemize @bullet
1.2 noro 3859: \BJP
1.1 noro 3860: @item
3861: @code{dp_td()} $B$O(B, $BF,9`$NA4<!?t(B, $B$9$J$o$A3FJQ?t$N;X?t$NOB$rJV$9(B.
3862: @item
3863: $BJ,;6I=8=B?9`<0$,@8@.$5$l$k$H(B, @code{sugar} $B$H8F$P$l$k$"$k@0?t$,IUM?(B
3864: $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.
3865: @item
3866: @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
3867: $B7hDj$9$k$?$a$N=EMW$J;X?K$H$J$k(B.
1.2 noro 3868: \E
3869: \BEG
3870: @item
3871: Function @code{dp_td()} returns the total degree of the head term,
3872: i.e., the sum of all exponent of variables in that term.
3873: @item
3874: Upon creation of a distributed polynomial, an integer called @code{sugar}
3875: is associated. This value is
3876: the total degree of the virtually homogenized one of the original
3877: polynomial.
3878: @item
3879: The quantity @code{sugar} is an important guide to determine the
3880: selection strategy of critical pairs in Groebner basis computation.
3881: \E
1.1 noro 3882: @end itemize
3883:
3884: @example
3885: [74] dp_ord(0)$
3886: [75] X=<<1,2>>+<<0,1>>$
3887: [76] Y=<<1,2>>+<<1,0>>$
3888: [77] Z=X-Y;
3889: (-1)*<<1,0>>+(1)*<<0,1>>
3890: [78] dp_sugar(T);
3891: 3
3892: @end example
3893:
1.2 noro 3894: \JP @node dp_lcm,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3895: \EG @node dp_lcm,,, Functions for Groebner basis computation
1.1 noro 3896: @subsection @code{dp_lcm}
3897: @findex dp_lcm
3898:
3899: @table @t
3900: @item dp_lcm(@var{dpoly1},@var{dpoly2})
1.2 noro 3901: \JP :: $B:G>.8xG\9`$rJV$9(B.
3902: \EG :: Returns the least common multiple of the head terms of the given two polynomials.
1.1 noro 3903: @end table
3904:
3905: @table @var
3906: @item return
1.2 noro 3907: \JP $BJ,;6I=8=B?9`<0(B
3908: \EG distributed polynomial
1.4 noro 3909: @item dpoly1 dpoly2
1.2 noro 3910: \JP $BJ,;6I=8=B?9`<0(B
3911: \EG distributed polynomial
1.1 noro 3912: @end table
3913:
3914: @itemize @bullet
1.2 noro 3915: \BJP
1.1 noro 3916: @item
3917: $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 3918: \E
3919: \BEG
3920: @item
3921: Returns the least common multiple of the head terms of the given
3922: two polynomials, where coefficient is always set to 1.
3923: \E
1.1 noro 3924: @end itemize
3925:
3926: @example
3927: [100] dp_lcm(<<1,2,3,4,5>>,<<5,4,3,2,1>>);
3928: (1)*<<5,4,3,4,5>>
3929: @end example
3930:
3931: @table @t
1.2 noro 3932: \JP @item $B;2>H(B
3933: \EG @item References
1.1 noro 3934: @fref{p_nf p_nf_mod p_true_nf p_true_nf_mod}.
3935: @end table
3936:
1.2 noro 3937: \JP @node dp_redble,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3938: \EG @node dp_redble,,, Functions for Groebner basis computation
1.1 noro 3939: @subsection @code{dp_redble}
3940: @findex dp_redble
3941:
3942: @table @t
3943: @item dp_redble(@var{dpoly1},@var{dpoly2})
1.2 noro 3944: \JP :: $BF,9`$I$&$7$,@0=|2DG=$+$I$&$+D4$Y$k(B.
3945: \EG :: Checks whether one head term is divisible by the other head term.
1.1 noro 3946: @end table
3947:
3948: @table @var
3949: @item return
1.2 noro 3950: \JP $B@0?t(B
3951: \EG integer
1.4 noro 3952: @item dpoly1 dpoly2
1.2 noro 3953: \JP $BJ,;6I=8=B?9`<0(B
3954: \EG distributed polynomial
1.1 noro 3955: @end table
3956:
3957: @itemize @bullet
1.2 noro 3958: \BJP
1.1 noro 3959: @item
3960: @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
3961: 0 $B$rJV$9(B.
3962: @item
3963: $BB?9`<0$N4JLs$r9T$&:](B, $B$I$N9`$r4JLs$G$-$k$+$rC5$9$N$KMQ$$$k(B.
1.2 noro 3964: \E
3965: \BEG
3966: @item
3967: Returns 1 if the head term of @var{dpoly2} divides the head term of
3968: @var{dpoly1}; otherwise 0.
3969: @item
3970: Used for finding candidate terms at reduction of polynomials.
3971: \E
1.1 noro 3972: @end itemize
3973:
3974: @example
3975: [148] C;
3976: (1)*<<1,1,1,0,0>>+(1)*<<0,1,1,1,0>>+(1)*<<1,1,0,0,1>>+(1)*<<1,0,0,1,1>>
3977: [149] T;
3978: (3)*<<2,1,0,0,0>>+(3)*<<1,2,0,0,0>>+(1)*<<0,3,0,0,0>>+(6)*<<1,1,1,0,0>>
3979: [150] for ( ; T; T = dp_rest(T)) print(dp_redble(T,C));
3980: 0
3981: 0
3982: 0
3983: 1
3984: @end example
3985:
3986: @table @t
1.2 noro 3987: \JP @item $B;2>H(B
3988: \EG @item References
1.1 noro 3989: @fref{dp_red dp_red_mod}.
3990: @end table
3991:
1.23 noro 3992: \JP @node dpm_redble,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
3993: \EG @node dpm_redble,,, Functions for Groebner basis computation
3994: @subsection @code{dpm_redble}
3995: @findex dpm_redble
3996:
3997: @table @t
3998: @item dpm_redble(@var{dpoly1},@var{dpoly2})
3999: \JP :: $BF,9`$I$&$7$,@0=|2DG=$+$I$&$+D4$Y$k(B.
4000: \EG :: Checks whether one head term is divisible by the other head term.
4001: @end table
4002:
4003: @table @var
4004: @item return
4005: \JP $B@0?t(B
4006: \EG integer
4007: @item dpoly1 dpoly2
4008: \JP $B2C72B?9`<0(B
4009: \EG module polynomial
4010: @end table
4011:
4012: @itemize @bullet
4013: \BJP
4014: @item
4015: @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
4016: 0 $B$rJV$9(B.
4017: @item
4018: $BB?9`<0$N4JLs$r9T$&:](B, $B$I$N9`$r4JLs$G$-$k$+$rC5$9$N$KMQ$$$k(B.
4019: \E
4020: \BEG
4021: @item
4022: Returns 1 if the head term of @var{dpoly2} divides the head term of
4023: @var{dpoly1}; otherwise 0.
4024: @item
4025: Used for finding candidate terms at reduction of polynomials.
4026: \E
4027: @end itemize
4028:
1.2 noro 4029: \JP @node dp_subd,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4030: \EG @node dp_subd,,, Functions for Groebner basis computation
1.1 noro 4031: @subsection @code{dp_subd}
4032: @findex dp_subd
4033:
4034: @table @t
4035: @item dp_subd(@var{dpoly1},@var{dpoly2})
1.2 noro 4036: \JP :: $BF,9`$N>&C19`<0$rJV$9(B.
4037: \EG :: Returns the quotient monomial of the head terms.
1.1 noro 4038: @end table
4039:
4040: @table @var
4041: @item return
1.2 noro 4042: \JP $BJ,;6I=8=B?9`<0(B
4043: \EG distributed polynomial
1.4 noro 4044: @item dpoly1 dpoly2
1.2 noro 4045: \JP $BJ,;6I=8=B?9`<0(B
4046: \EG distributed polynomial
1.1 noro 4047: @end table
4048:
4049: @itemize @bullet
1.2 noro 4050: \BJP
1.1 noro 4051: @item
4052: @code{dp_ht(@var{dpoly1})/dp_ht(@var{dpoly2})} $B$r5a$a$k(B. $B7k2L$N78?t$O(B 1
4053: $B$G$"$k(B.
4054: @item
4055: $B3d$j@Z$l$k$3$H$,$"$i$+$8$a$o$+$C$F$$$kI,MW$,$"$k(B.
1.2 noro 4056: \E
4057: \BEG
4058: @item
4059: Gets @code{dp_ht(@var{dpoly1})/dp_ht(@var{dpoly2})}.
4060: The coefficient of the result is always set to 1.
4061: @item
4062: Divisibility assumed.
4063: \E
1.1 noro 4064: @end itemize
4065:
4066: @example
4067: [162] dp_subd(<<1,2,3,4,5>>,<<1,1,2,3,4>>);
4068: (1)*<<0,1,1,1,1>>
4069: @end example
4070:
4071: @table @t
1.2 noro 4072: \JP @item $B;2>H(B
4073: \EG @item References
1.1 noro 4074: @fref{dp_red dp_red_mod}.
4075: @end table
4076:
1.2 noro 4077: \JP @node dp_vtoe dp_etov,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4078: \EG @node dp_vtoe dp_etov,,, Functions for Groebner basis computation
1.1 noro 4079: @subsection @code{dp_vtoe}, @code{dp_etov}
4080: @findex dp_vtoe
4081: @findex dp_etov
4082:
4083: @table @t
4084: @item dp_vtoe(@var{vect})
1.2 noro 4085: \JP :: $B;X?t%Y%/%H%k$r9`$KJQ49(B
4086: \EG :: Converts an exponent vector into a term.
1.1 noro 4087: @item dp_etov(@var{dpoly})
1.2 noro 4088: \JP :: $BF,9`$r;X?t%Y%/%H%k$KJQ49(B
4089: \EG :: Convert the head term of a distributed polynomial into an exponent vector.
1.1 noro 4090: @end table
4091:
4092: @table @var
4093: @item return
1.2 noro 4094: \JP @code{dp_vtoe} : $BJ,;6I=8=B?9`<0(B, @code{dp_etov} : $B%Y%/%H%k(B
4095: \EG @code{dp_vtoe} : distributed polynomial, @code{dp_etov} : vector
1.1 noro 4096: @item vect
1.2 noro 4097: \JP $B%Y%/%H%k(B
4098: \EG vector
1.1 noro 4099: @item dpoly
1.2 noro 4100: \JP $BJ,;6I=8=B?9`<0(B
4101: \EG distributed polynomial
1.1 noro 4102: @end table
4103:
4104: @itemize @bullet
1.2 noro 4105: \BJP
1.1 noro 4106: @item
4107: @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.
4108: @item
4109: @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
4110: $B%Y%/%H%k$KJQ49$9$k(B.
1.2 noro 4111: \E
4112: \BEG
4113: @item
4114: @code{dp_vtoe()} generates a term whose exponent vector is @var{vect}.
4115: @item
4116: @code{dp_etov()} generates a vector which is the exponent vector of the
4117: head term of @code{dpoly}.
4118: \E
1.1 noro 4119: @end itemize
4120:
4121: @example
4122: [211] X=<<1,2,3>>;
4123: (1)*<<1,2,3>>
4124: [212] V=dp_etov(X);
4125: [ 1 2 3 ]
4126: [213] V[2]++$
4127: [214] Y=dp_vtoe(V);
4128: (1)*<<1,2,4>>
4129: @end example
4130:
1.2 noro 4131: \JP @node dp_mbase,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4132: \EG @node dp_mbase,,, Functions for Groebner basis computation
1.1 noro 4133: @subsection @code{dp_mbase}
4134: @findex dp_mbase
4135:
4136: @table @t
4137: @item dp_mbase(@var{dplist})
1.2 noro 4138: \JP :: monomial $B4pDl$N7W;;(B
4139: \EG :: Computes the monomial basis
1.1 noro 4140: @end table
4141:
4142: @table @var
4143: @item return
1.2 noro 4144: \JP $BJ,;6I=8=B?9`<0$N%j%9%H(B
4145: \EG list of distributed polynomial
1.1 noro 4146: @item dplist
1.2 noro 4147: \JP $BJ,;6I=8=B?9`<0$N%j%9%H(B
4148: \EG list of distributed polynomial
1.1 noro 4149: @end table
4150:
4151: @itemize @bullet
1.2 noro 4152: \BJP
1.1 noro 4153: @item
4154: $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
4155: $B$G$"$k(B @var{dplist} $B$K$D$$$F(B,
4156: @var{dplist} $B$,(B K[X] $BCf$G@8@.$9$k%$%G%"%k(B I $B$,(B 0 $B<!85$N;~(B,
4157: K $B>eM-8B<!85@~7A6u4V$G$"$k(B K[X]/I $B$N(B monomial $B$K$h$k4pDl$r5a$a$k(B.
4158: @item
4159: $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 4160: \E
4161: \BEG
4162: @item
4163: Assuming that @var{dplist} is a list of distributed polynomials which
4164: is a Groebner basis with respect to the current ordering type and
4165: that the ideal @var{I} generated by @var{dplist} in K[X] is zero-dimensional,
4166: this function computes the monomial basis of a finite dimenstional K-vector
4167: space K[X]/I.
4168: @item
4169: The number of elements in the monomial basis is equal to the
4170: K-dimenstion of K[X]/I.
4171: \E
1.1 noro 4172: @end itemize
4173:
4174: @example
4175: [215] K=katsura(5)$
4176: [216] V=[u5,u4,u3,u2,u1,u0]$
4177: [217] G0=gr(K,V,0)$
4178: [218] H=map(dp_ptod,G0,V)$
4179: [219] map(dp_ptod,dp_mbase(H),V)$
4180: [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,
4181: 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,
4182: u1*u2,u1^2,u4*u0,u3*u0,u2*u0,u1*u0,u0^2,u4,u3,u2,u1,u0,1]
4183: @end example
4184:
4185: @table @t
1.2 noro 4186: \JP @item $B;2>H(B
4187: \EG @item References
1.1 noro 4188: @fref{gr hgr gr_mod}.
4189: @end table
4190:
1.2 noro 4191: \JP @node dp_mag,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4192: \EG @node dp_mag,,, Functions for Groebner basis computation
1.1 noro 4193: @subsection @code{dp_mag}
4194: @findex dp_mag
4195:
4196: @table @t
4197: @item dp_mag(@var{p})
1.2 noro 4198: \JP :: $B78?t$N%S%C%HD9$NOB$rJV$9(B
4199: \EG :: Computes the sum of bit lengths of coefficients of a distributed polynomial.
1.1 noro 4200: @end table
4201:
4202: @table @var
4203: @item return
1.2 noro 4204: \JP $B?t(B
4205: \EG integer
1.1 noro 4206: @item p
1.2 noro 4207: \JP $BJ,;6I=8=B?9`<0(B
4208: \EG distributed polynomial
1.1 noro 4209: @end table
4210:
4211: @itemize @bullet
1.2 noro 4212: \BJP
1.1 noro 4213: @item
4214: $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)
4215: $B$N%S%C%HD9$NAmOB$rJV$9(B.
4216: @item
4217: $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
4218: $B78?tKDD%$,LdBj$H$J$j(B, $BESCf@8@.$5$l$kB?9`<0$,78?tKDD%$r5/$3$7$F$$$k$+$I$&$+(B
4219: $B$NH=Dj$KLrN)$D(B.
4220: @item
4221: @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
4222: $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 4223: \E
4224: \BEG
4225: @item
4226: This function computes the sum of bit lengths of coefficients of a
4227: distributed polynomial @var{p}. If a coefficient is non integral,
4228: the sum of bit lengths of the numerator and the denominator is taken.
4229: @item
4230: This is a measure of the size of a polynomial. Especially for
4231: zero-dimensional system coefficient swells are often serious and
4232: the returned value is useful to detect such swells.
4233: @item
4234: If @code{ShowMag} and @code{Print} for @code{dp_gr_flags()} are on,
4235: values of @code{dp_mag()} for intermediate basis elements are shown.
4236: \E
1.1 noro 4237: @end itemize
4238:
4239: @example
4240: [221] X=dp_ptod((x+2*y)^10,[x,y])$
4241: [222] dp_mag(X);
4242: 115
4243: @end example
4244:
4245: @table @t
1.2 noro 4246: \JP @item $B;2>H(B
4247: \EG @item References
1.1 noro 4248: @fref{dp_gr_flags dp_gr_print}.
4249: @end table
4250:
1.2 noro 4251: \JP @node dp_red dp_red_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4252: \EG @node dp_red dp_red_mod,,, Functions for Groebner basis computation
1.1 noro 4253: @subsection @code{dp_red}, @code{dp_red_mod}
4254: @findex dp_red
4255: @findex dp_red_mod
4256:
4257: @table @t
4258: @item dp_red(@var{dpoly1},@var{dpoly2},@var{dpoly3})
4259: @item dp_red_mod(@var{dpoly1},@var{dpoly2},@var{dpoly3},@var{mod})
1.2 noro 4260: \JP :: $B0l2s$N4JLsA`:n(B
4261: \EG :: Single reduction operation
1.1 noro 4262: @end table
4263:
4264: @table @var
4265: @item return
1.2 noro 4266: \JP $B%j%9%H(B
4267: \EG list
1.4 noro 4268: @item dpoly1 dpoly2 dpoly3
1.2 noro 4269: \JP $BJ,;6I=8=B?9`<0(B
4270: \EG distributed polynomial
1.1 noro 4271: @item vlist
1.2 noro 4272: \JP $B%j%9%H(B
4273: \EG list
1.1 noro 4274: @item mod
1.2 noro 4275: \JP $BAG?t(B
4276: \EG prime
1.1 noro 4277: @end table
4278:
4279: @itemize @bullet
1.2 noro 4280: \BJP
1.1 noro 4281: @item
4282: @var{dpoly1} + @var{dpoly2} $B$J$kJ,;6I=8=B?9`<0$r(B @var{dpoly3} $B$G(B
4283: 1 $B2s4JLs$9$k(B.
4284: @item
4285: @code{dp_red_mod()} $B$NF~NO$O(B, $BA4$FM-8BBN78?t$KJQ49$5$l$F$$$kI,MW$,$"$k(B.
4286: @item
4287: $B4JLs$5$l$k9`$O(B @var{dpoly2} $B$NF,9`$G$"$k(B. $B=>$C$F(B, @var{dpoly2} $B$N(B
4288: $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
4289: $B$J$i$J$$(B.
4290: @item
4291: $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 4292: $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 4293: @item
4294: $B7k2L$O(B, @code{[@var{a dpoly1},@var{a dpoly2 - bt dpoly3}]} $B$J$k%j%9%H$G$"$k(B.
1.2 noro 4295: \E
4296: \BEG
4297: @item
4298: Reduces a distributed polynomial, @var{dpoly1} + @var{dpoly2},
4299: by @var{dpoly3} for single time.
4300: @item
4301: An input for @code{dp_red_mod()} must be converted into a distributed
4302: polynomial with coefficients in a finite field.
4303: @item
4304: This implies that
4305: the divisibility of the head term of @var{dpoly2} by the head term of
4306: @var{dpoly3} is assumed.
4307: @item
4308: When integral coefficients, computation is so carefully performed that
4309: no rational operations appear in the reduction procedure.
4310: It is computed for integers @var{a} and @var{b}, and a term @var{t} as:
1.4 noro 4311: @var{a}(@var{dpoly1} + @var{dpoly2})-@var{bt} @var{dpoly3}.
1.2 noro 4312: @item
4313: The result is a list @code{[@var{a dpoly1},@var{a dpoly2 - bt dpoly3}]}.
4314: \E
1.1 noro 4315: @end itemize
4316:
4317: @example
4318: [157] D=(3)*<<2,1,0,0,0>>+(3)*<<1,2,0,0,0>>+(1)*<<0,3,0,0,0>>;
4319: (3)*<<2,1,0,0,0>>+(3)*<<1,2,0,0,0>>+(1)*<<0,3,0,0,0>>
4320: [158] R=(6)*<<1,1,1,0,0>>;
4321: (6)*<<1,1,1,0,0>>
4322: [159] C=12*<<1,1,1,0,0>>+(1)*<<0,1,1,1,0>>+(1)*<<1,1,0,0,1>>;
4323: (12)*<<1,1,1,0,0>>+(1)*<<0,1,1,1,0>>+(1)*<<1,1,0,0,1>>
4324: [160] dp_red(D,R,C);
1.5 noro 4325: [(6)*<<2,1,0,0,0>>+(6)*<<1,2,0,0,0>>+(2)*<<0,3,0,0,0>>,
4326: (-1)*<<0,1,1,1,0>>+(-1)*<<1,1,0,0,1>>]
1.1 noro 4327: @end example
4328:
4329: @table @t
1.2 noro 4330: \JP @item $B;2>H(B
4331: \EG @item References
1.1 noro 4332: @fref{dp_mod dp_rat}.
4333: @end table
4334:
1.2 noro 4335: \JP @node dp_sp dp_sp_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4336: \EG @node dp_sp dp_sp_mod,,, Functions for Groebner basis computation
1.1 noro 4337: @subsection @code{dp_sp}, @code{dp_sp_mod}
4338: @findex dp_sp
4339: @findex dp_sp_mod
4340:
4341: @table @t
4342: @item dp_sp(@var{dpoly1},@var{dpoly2})
4343: @item dp_sp_mod(@var{dpoly1},@var{dpoly2},@var{mod})
1.2 noro 4344: \JP :: S-$BB?9`<0$N7W;;(B
4345: \EG :: Computation of an S-polynomial
1.1 noro 4346: @end table
4347:
4348: @table @var
4349: @item return
1.2 noro 4350: \JP $BJ,;6I=8=B?9`<0(B
4351: \EG distributed polynomial
1.4 noro 4352: @item dpoly1 dpoly2
1.2 noro 4353: \JP $BJ,;6I=8=B?9`<0(B
4354: \EG distributed polynomial
1.1 noro 4355: @item mod
1.2 noro 4356: \JP $BAG?t(B
4357: \EG prime
1.1 noro 4358: @end table
4359:
4360: @itemize @bullet
1.2 noro 4361: \BJP
1.1 noro 4362: @item
4363: @var{dpoly1}, @var{dpoly2} $B$N(B S-$BB?9`<0$r7W;;$9$k(B.
4364: @item
4365: @code{dp_sp_mod()} $B$NF~NO$O(B, $BA4$FM-8BBN78?t$KJQ49$5$l$F$$$kI,MW$,$"$k(B.
4366: @item
4367: $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
4368: $BG\$5$l$F$$$k2DG=@-$,$"$k(B.
1.2 noro 4369: \E
4370: \BEG
4371: @item
4372: This function computes the S-polynomial of @var{dpoly1} and @var{dpoly2}.
4373: @item
4374: Inputs of @code{dp_sp_mod()} must be polynomials with coefficients in a
4375: finite field.
4376: @item
4377: The result may be multiplied by a constant in the ground field in order to
4378: make the result integral.
4379: \E
1.1 noro 4380: @end itemize
4381:
4382: @example
4383: [227] X=dp_ptod(x^2*y+x*y,[x,y]);
4384: (1)*<<2,1>>+(1)*<<1,1>>
4385: [228] Y=dp_ptod(x*y^2+x*y,[x,y]);
4386: (1)*<<1,2>>+(1)*<<1,1>>
4387: [229] dp_sp(X,Y);
4388: (-1)*<<2,1>>+(1)*<<1,2>>
4389: @end example
4390:
4391: @table @t
1.2 noro 4392: \JP @item $B;2>H(B
4393: \EG @item References
1.1 noro 4394: @fref{dp_mod dp_rat}.
4395: @end table
1.23 noro 4396:
4397: \JP @node dpm_sp,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4398: \EG @node dmp_sp,,, Functions for Groebner basis computation
4399: @subsection @code{dpm_sp}
4400: @findex dpm_sp
4401:
4402: @table @t
4403: @item dpm_sp(@var{dpoly1},@var{dpoly2}[|coef=1])
4404: \JP :: S-$BB?9`<0$N7W;;(B
4405: \EG :: Computation of an S-polynomial
4406: @end table
4407:
4408: @table @var
4409: @item return
4410: \JP $B2C72B?9`<0$^$?$O%j%9%H(B
4411: \EG module polynomial or list
4412: @item dpoly1 dpoly2
4413: \JP $B2C72B?9`<0(B
4414: \EG module polynomial
4415: \JP $BJ,;6I=8=B?9`<0(B
4416: @end table
4417:
4418: @itemize @bullet
4419: \BJP
4420: @item
4421: @var{dpoly1}, @var{dpoly2} $B$N(B S-$BB?9`<0$r7W;;$9$k(B.
4422: @item
4423: $B%*%W%7%g%s(B @var{coef=1} $B$,;XDj$5$l$F$$$k>l9g(B, @code{[S,t1,t2]} $B$J$k%j%9%H$rJV$9(B.
4424: $B$3$3$G(B, @code{t1}, @code{t2} $B$O(BS-$BB?9`<0$r:n$k:]$N78?tC19`<0$G(B @code{S=t1 dpoly1-t2 dpoly2}
4425: $B$rK~$?$9(B.
4426: \E
4427: \BEG
4428: @item
4429: This function computes the S-polynomial of @var{dpoly1} and @var{dpoly2}.
4430: @item
4431: If an option @var{coef=1} is specified, it returns a list @code{[S,t1,t2]},
4432: where @code{S} is the S-polynmial and @code{t1}, @code{t2} are monomials satisfying @code{S=t1 dpoly1-t2 dpoly2}.
4433: \E
4434: @end itemize
4435:
1.2 noro 4436: \JP @node p_nf p_nf_mod p_true_nf p_true_nf_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4437: \EG @node p_nf p_nf_mod p_true_nf p_true_nf_mod,,, Functions for Groebner basis computation
1.1 noro 4438: @subsection @code{p_nf}, @code{p_nf_mod}, @code{p_true_nf}, @code{p_true_nf_mod}
4439: @findex p_nf
4440: @findex p_nf_mod
4441: @findex p_true_nf
4442: @findex p_true_nf_mod
4443:
4444: @table @t
4445: @item p_nf(@var{poly},@var{plist},@var{vlist},@var{order})
4446: @itemx p_nf_mod(@var{poly},@var{plist},@var{vlist},@var{order},@var{mod})
1.2 noro 4447: \JP :: $BI=8=B?9`<0$N@55,7A$r5a$a$k(B. ($B7k2L$ODj?tG\$5$l$F$$$k2DG=@-$"$j(B)
4448: \BEG
4449: :: Computes the normal form of the given polynomial.
4450: (The result may be multiplied by a constant.)
4451: \E
1.1 noro 4452: @item p_true_nf(@var{poly},@var{plist},@var{vlist},@var{order})
4453: @itemx p_true_nf_mod(@var{poly},@var{plist},@var{vlist},@var{order},@var{mod})
1.2 noro 4454: \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)
4455: \BEG
4456: :: Computes the normal form of the given polynomial. (The result is returned
4457: as a form of @code{[numerator, denominator]})
4458: \E
1.1 noro 4459: @end table
4460:
4461: @table @var
4462: @item return
1.2 noro 4463: \JP @code{p_nf} : $BB?9`<0(B, @code{p_true_nf} : $B%j%9%H(B
4464: \EG @code{p_nf} : polynomial, @code{p_true_nf} : list
1.1 noro 4465: @item poly
1.2 noro 4466: \JP $BB?9`<0(B
4467: \EG polynomial
1.4 noro 4468: @item plist vlist
1.2 noro 4469: \JP $B%j%9%H(B
4470: \EG list
1.1 noro 4471: @item order
1.2 noro 4472: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
4473: \EG number, list or matrix
1.1 noro 4474: @item mod
1.2 noro 4475: \JP $BAG?t(B
4476: \EG prime
1.1 noro 4477: @end table
4478:
4479: @itemize @bullet
1.2 noro 4480: \BJP
1.1 noro 4481: @item
4482: @samp{gr} $B$GDj5A$5$l$F$$$k(B.
4483: @item
4484: $BB?9`<0$N(B, $BB?9`<0%j%9%H$K$h$k@55,7A$r5a$a$k(B.
4485: @item
4486: @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()}, @code{dp_true_nf_mod}
4487: $B$KBP$9$k%$%s%?%U%'!<%9$G$"$k(B.
4488: @item
4489: @var{poly} $B$*$h$S(B @var{plist} $B$O(B, $BJQ?t=g=x(B @var{vlist} $B$*$h$S(B
4490: $BJQ?t=g=x7?(B @var{otype} $B$K=>$C$FJ,;6I=8=B?9`<0$KJQ49$5$l(B,
4491: @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()},
4492: @code{dp_true_nf_mod()} $B$KEO$5$l$k(B.
4493: @item
4494: @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()},
4495: @code{dp_true_nf_mod()} $B$O(B @var{fullreduce} $B$,(B 1 $B$G8F$S=P$5$l$k(B.
4496: @item
4497: $B7k2L$OB?9`<0$KJQ49$5$l$F=PNO$5$l$k(B.
4498: @item
4499: @code{p_true_nf()}, @code{p_true_nf_mod()} $B$N=PNO$K4X$7$F$O(B,
4500: @code{dp_true_nf()}, @code{dp_true_nf_mod()} $B$N9`$r;2>H(B.
1.2 noro 4501: \E
4502: \BEG
4503: @item
4504: Defined in the package @samp{gr}.
4505: @item
4506: Obtains the normal form of a polynomial by a polynomial list.
4507: @item
4508: These are interfaces to @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()},
4509: @code{dp_true_nf_mod}
4510: @item
4511: The polynomial @var{poly} and the polynomials in @var{plist} is
4512: converted, according to the variable ordering @var{vlist} and
4513: type of term ordering @var{otype}, into their distributed polynomial
4514: counterparts and passed to @code{dp_nf()}.
4515: @item
4516: @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()} and
4517: @code{dp_true_nf_mod()}
4518: is called with value 1 for @var{fullreduce}.
4519: @item
4520: The result is converted back into an ordinary polynomial.
4521: @item
4522: As for @code{p_true_nf()}, @code{p_true_nf_mod()}
4523: refer to @code{dp_true_nf()} and @code{dp_true_nf_mod()}.
4524: \E
1.1 noro 4525: @end itemize
4526:
4527: @example
4528: [79] K = katsura(5)$
4529: [80] V = [u5,u4,u3,u2,u1,u0]$
4530: [81] G = hgr(K,V,2)$
4531: [82] p_nf(K[1],G,V,2);
4532: 0
4533: [83] L = p_true_nf(K[1]+1,G,V,2);
4534: [-1503...,-1503...]
4535: [84] L[0]/L[1];
4536: 1
4537: @end example
4538:
4539: @table @t
1.2 noro 4540: \JP @item $B;2>H(B
4541: \EG @item References
1.1 noro 4542: @fref{dp_ptod},
4543: @fref{dp_dtop},
4544: @fref{dp_ord},
1.19 noro 4545: @fref{dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod dp_weyl_nf dp_weyl_nf_mod}.
1.1 noro 4546: @end table
4547:
1.2 noro 4548: \JP @node p_terms,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4549: \EG @node p_terms,,, Functions for Groebner basis computation
1.1 noro 4550: @subsection @code{p_terms}
4551: @findex p_terms
4552:
4553: @table @t
4554: @item p_terms(@var{poly},@var{vlist},@var{order})
1.2 noro 4555: \JP :: $BB?9`<0$K$"$i$o$l$kC19`$r%j%9%H$K$9$k(B.
4556: \EG :: Monomials appearing in the given polynomial is collected into a list.
1.1 noro 4557: @end table
4558:
4559: @table @var
4560: @item return
1.2 noro 4561: \JP $B%j%9%H(B
4562: \EG list
1.1 noro 4563: @item poly
1.2 noro 4564: \JP $BB?9`<0(B
4565: \EG polynomial
1.1 noro 4566: @item vlist
1.2 noro 4567: \JP $B%j%9%H(B
4568: \EG list
1.1 noro 4569: @item order
1.2 noro 4570: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
4571: \EG number, list or matrix
1.1 noro 4572: @end table
4573:
4574: @itemize @bullet
1.2 noro 4575: \BJP
1.1 noro 4576: @item
4577: @samp{gr} $B$GDj5A$5$l$F$$$k(B.
4578: @item
4579: $BB?9`<0$rC19`$KE83+$7$?;~$K8=$l$k9`$r%j%9%H$K$7$FJV$9(B.
4580: @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
4581: $B$,%j%9%H$N@hF,$KMh$k$h$&$K%=!<%H$5$l$k(B.
4582: @item
4583: $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
4584: $B$$$k$N$+$r8+$k$?$a$J$I$KMQ$$$k(B.
1.2 noro 4585: \E
4586: \BEG
4587: @item
4588: Defined in the package @samp{gr}.
4589: @item
4590: This returns a list which contains all non-zero monomials in the given
4591: polynomial. The monomials are ordered according to the current
4592: type of term ordering and @var{vlist}.
4593: @item
4594: Since polynomials in a Groebner base often have very large coefficients,
4595: examining a polynomial as it is may sometimes be difficult to perform.
4596: For such a case, this function enables to examine which term is really
4597: exists.
4598: \E
1.1 noro 4599: @end itemize
4600:
4601: @example
4602: [233] G=gr(katsura(5),[u5,u4,u3,u2,u1,u0],2)$
4603: [234] p_terms(G[0],[u5,u4,u3,u2,u1,u0],2);
1.5 noro 4604: [u5,u0^31,u0^30,u0^29,u0^28,u0^27,u0^26,u0^25,u0^24,u0^23,u0^22,
4605: u0^21,u0^20,u0^19,u0^18,u0^17,u0^16,u0^15,u0^14,u0^13,u0^12,u0^11,
4606: u0^10,u0^9,u0^8,u0^7,u0^6,u0^5,u0^4,u0^3,u0^2,u0,1]
1.1 noro 4607: @end example
4608:
1.2 noro 4609: \JP @node gb_comp,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4610: \EG @node gb_comp,,, Functions for Groebner basis computation
1.1 noro 4611: @subsection @code{gb_comp}
4612: @findex gb_comp
4613:
4614: @table @t
4615: @item gb_comp(@var{plist1}, @var{plist2})
1.2 noro 4616: \JP :: $BB?9`<0%j%9%H$,(B, $BId9f$r=|$$$F=89g$H$7$FEy$7$$$+$I$&$+D4$Y$k(B.
4617: \EG :: Checks whether two polynomial lists are equal or not as a set
1.1 noro 4618: @end table
4619:
4620: @table @var
1.2 noro 4621: \JP @item return 0 $B$^$?$O(B 1
4622: \EG @item return 0 or 1
1.4 noro 4623: @item plist1 plist2
1.1 noro 4624: @end table
4625:
4626: @itemize @bullet
1.2 noro 4627: \BJP
1.1 noro 4628: @item
4629: @var{plist1}, @var{plist2} $B$K$D$$$F(B, $BId9f$r=|$$$F=89g$H$7$FEy$7$$$+$I$&$+(B
4630: $BD4$Y$k(B.
4631: @item
4632: $B0[$J$kJ}K!$G5a$a$?%0%l%V%J4pDl$O(B, $B4pDl$N=g=x(B, $BId9f$,0[$J$k>l9g$,$"$j(B,
4633: $B$=$l$i$,Ey$7$$$+$I$&$+$rD4$Y$k$?$a$KMQ$$$k(B.
1.2 noro 4634: \E
4635: \BEG
4636: @item
4637: This function checks whether @var{plist1} and @var{plist2} are equal or
4638: not as a set .
4639: @item
4640: For the same input and the same term ordering different
4641: functions for Groebner basis computations may produce different outputs
4642: as lists. This function compares such lists whether they are equal
4643: as a generating set of an ideal.
4644: \E
1.1 noro 4645: @end itemize
4646:
4647: @example
4648: [243] C=cyclic(6)$
4649: [244] V=[c0,c1,c2,c3,c4,c5]$
4650: [245] G0=gr(C,V,0)$
4651: [246] G=tolex(G0,V,0,V)$
4652: [247] GG=lex_tl(C,V,0,V,0)$
4653: [248] gb_comp(G,GG);
4654: 1
4655: @end example
4656:
1.2 noro 4657: \JP @node katsura hkatsura cyclic hcyclic,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4658: \EG @node katsura hkatsura cyclic hcyclic,,, Functions for Groebner basis computation
1.1 noro 4659: @subsection @code{katsura}, @code{hkatsura}, @code{cyclic}, @code{hcyclic}
4660: @findex katsura
4661: @findex hkatsura
4662: @findex cyclic
4663: @findex hcyclic
4664:
4665: @table @t
4666: @item katsura(@var{n})
4667: @item hkatsura(@var{n})
4668: @item cyclic(@var{n})
4669: @item hcyclic(@var{n})
1.2 noro 4670: \JP :: $BB?9`<0%j%9%H$N@8@.(B
4671: \EG :: Generates a polynomial list of standard benchmark.
1.1 noro 4672: @end table
4673:
4674: @table @var
4675: @item return
1.2 noro 4676: \JP $B%j%9%H(B
4677: \EG list
1.1 noro 4678: @item n
1.2 noro 4679: \JP $B@0?t(B
4680: \EG integer
1.1 noro 4681: @end table
4682:
4683: @itemize @bullet
1.2 noro 4684: \BJP
1.1 noro 4685: @item
4686: @code{katsura()} $B$O(B @samp{katsura}, @code{cyclic()} $B$O(B @samp{cyclic}
4687: $B$GDj5A$5$l$F$$$k(B.
4688: @item
4689: $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},
4690: @code{cyclic} $B$*$h$S$=$N@F<!2=$r@8@.$9$k(B.
4691: @item
4692: @code{cyclic} $B$O(B @code{Arnborg}, @code{Lazard}, @code{Davenport} $B$J$I$N(B
4693: $BL>$G8F$P$l$k$3$H$b$"$k(B.
1.2 noro 4694: \E
4695: \BEG
4696: @item
4697: Function @code{katsura()} is defined in @samp{katsura}, and
4698: function @code{cyclic()} in @samp{cyclic}.
4699: @item
4700: These functions generate a series of polynomial sets, respectively,
4701: which are often used for testing and bench marking:
4702: @code{katsura}, @code{cyclic} and their homogenized versions.
4703: @item
4704: Polynomial set @code{cyclic} is sometimes called by other name:
4705: @code{Arnborg}, @code{Lazard}, and @code{Davenport}.
4706: \E
1.1 noro 4707: @end itemize
4708:
4709: @example
4710: [74] load("katsura")$
4711: [79] load("cyclic")$
4712: [89] katsura(5);
4713: [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 4714: 2*u3*u0+2*u1*u4-u3+(2*u1+2*u5)*u2,2*u2*u0+2*u2*u4+(2*u1+2*u5)*u3
4715: -u2+u1^2,2*u1*u0+(2*u3+2*u5)*u4+2*u2*u3+2*u1*u2-u1,
1.1 noro 4716: u0^2-u0+2*u4^2+2*u3^2+2*u2^2+2*u1^2+2*u5^2]
4717: [90] hkatsura(5);
4718: [-t+u0+2*u4+2*u3+2*u2+2*u1+2*u5,
4719: -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,
4720: -u2*t+2*u2*u0+2*u2*u4+(2*u1+2*u5)*u3+u1^2,
4721: -u1*t+2*u1*u0+(2*u3+2*u5)*u4+2*u2*u3+2*u1*u2,
4722: -u0*t+u0^2+2*u4^2+2*u3^2+2*u2^2+2*u1^2+2*u5^2]
4723: [91] cyclic(6);
4724: [c5*c4*c3*c2*c1*c0-1,
4725: ((((c4+c5)*c3+c5*c4)*c2+c5*c4*c3)*c1+c5*c4*c3*c2)*c0+c5*c4*c3*c2*c1,
4726: (((c3+c5)*c2+c5*c4)*c1+c5*c4*c3)*c0+c4*c3*c2*c1+c5*c4*c3*c2,
4727: ((c2+c5)*c1+c5*c4)*c0+c3*c2*c1+c4*c3*c2+c5*c4*c3,
4728: (c1+c5)*c0+c2*c1+c3*c2+c4*c3+c5*c4,c0+c1+c2+c3+c4+c5]
4729: [92] hcyclic(6);
4730: [-c^6+c5*c4*c3*c2*c1*c0,
4731: ((((c4+c5)*c3+c5*c4)*c2+c5*c4*c3)*c1+c5*c4*c3*c2)*c0+c5*c4*c3*c2*c1,
4732: (((c3+c5)*c2+c5*c4)*c1+c5*c4*c3)*c0+c4*c3*c2*c1+c5*c4*c3*c2,
4733: ((c2+c5)*c1+c5*c4)*c0+c3*c2*c1+c4*c3*c2+c5*c4*c3,
4734: (c1+c5)*c0+c2*c1+c3*c2+c4*c3+c5*c4,c0+c1+c2+c3+c4+c5]
4735: @end example
4736:
4737: @table @t
1.2 noro 4738: \JP @item $B;2>H(B
4739: \EG @item References
1.1 noro 4740: @fref{dp_dtop}.
4741: @end table
4742:
1.3 noro 4743: \JP @node primadec primedec,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4744: \EG @node primadec primedec,,, Functions for Groebner basis computation
4745: @subsection @code{primadec}, @code{primedec}
4746: @findex primadec
4747: @findex primedec
4748:
4749: @table @t
4750: @item primadec(@var{plist},@var{vlist})
4751: @item primedec(@var{plist},@var{vlist})
4752: \JP :: $B%$%G%"%k$NJ,2r(B
4753: \EG :: Computes decompositions of ideals.
4754: @end table
4755:
4756: @table @var
4757: @item return
4758: @itemx plist
4759: \JP $BB?9`<0%j%9%H(B
4760: \EG list of polynomials
4761: @item vlist
4762: \JP $BJQ?t%j%9%H(B
4763: \EG list of variables
4764: @end table
4765:
4766: @itemize @bullet
4767: \BJP
4768: @item
4769: @code{primadec()}, @code{primedec} $B$O(B @samp{primdec} $B$GDj5A$5$l$F$$$k(B.
4770: @item
4771: @code{primadec()}, @code{primedec()} $B$O$=$l$>$lM-M}?tBN>e$G$N%$%G%"%k$N(B
4772: $B=`AGJ,2r(B, $B:,4p$NAG%$%G%"%kJ,2r$r9T$&(B.
4773: @item
4774: $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.
4775: @item
4776: @code{primadec} $B$O(B @code{[$B=`AG@.J,(B, $BIUB0AG%$%G%"%k(B]} $B$N%j%9%H$rJV$9(B.
4777: @item
4778: @code{primadec} $B$O(B $BAG0x;R$N%j%9%H$rJV$9(B.
4779: @item
4780: $B7k2L$K$*$$$F(B, $BB?9`<0%j%9%H$H$7$FI=<($5$l$F$$$k3F%$%G%"%k$OA4$F(B
4781: $B%0%l%V%J4pDl$G$"$k(B. $BBP1~$9$k9`=g=x$O(B, $B$=$l$>$l(B
4782: $BJQ?t(B @code{PRIMAORD}, @code{PRIMEORD} $B$K3JG<$5$l$F$$$k(B.
4783: @item
4784: @code{primadec} $B$O(B @code{[Shimoyama,Yokoyama]} $B$N=`AGJ,2r%"%k%4%j%:%`(B
4785: $B$r<BAu$7$F$$$k(B.
4786: @item
4787: $B$b$7AG0x;R$N$_$r5a$a$?$$$J$i(B, @code{primedec} $B$r;H$&J}$,$h$$(B.
4788: $B$3$l$O(B, $BF~NO%$%G%"%k$,:,4p%$%G%"%k$G$J$$>l9g$K(B, @code{primadec}
4789: $B$N7W;;$KM>J,$J%3%9%H$,I,MW$H$J$k>l9g$,$"$k$+$i$G$"$k(B.
4790: \E
4791: \BEG
4792: @item
4793: Function @code{primadec()} and @code{primedec} are defined in @samp{primdec}.
4794: @item
4795: @code{primadec()}, @code{primedec()} are the function for primary
4796: ideal decomposition and prime decomposition of the radical over the
4797: rationals respectively.
4798: @item
4799: The arguments are a list of polynomials and a list of variables.
4800: These functions accept ideals with rational function coefficients only.
4801: @item
4802: @code{primadec} returns the list of pair lists consisting a primary component
4803: and its associated prime.
4804: @item
4805: @code{primedec} returns the list of prime components.
4806: @item
4807: Each component is a Groebner basis and the corresponding term order
4808: is indicated by the global variables @code{PRIMAORD}, @code{PRIMEORD}
4809: respectively.
4810: @item
4811: @code{primadec} implements the primary decompostion algorithm
4812: in @code{[Shimoyama,Yokoyama]}.
4813: @item
4814: If one only wants to know the prime components of an ideal, then
4815: use @code{primedec} because @code{primadec} may need additional costs
4816: if an input ideal is not radical.
4817: \E
4818: @end itemize
4819:
4820: @example
4821: [84] load("primdec")$
4822: [102] primedec([p*q*x-q^2*y^2+q^2*y,-p^2*x^2+p^2*x+p*q*y,
4823: (q^3*y^4-2*q^3*y^3+q^3*y^2)*x-q^3*y^4+q^3*y^3,
4824: -q^3*y^4+2*q^3*y^3+(-q^3+p*q^2)*y^2],[p,q,x,y]);
4825: [[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]]
4826: [103] primadec([x,z*y,w*y^2,w^2*y-z^3,y^3],[x,y,z,w]);
4827: [[[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]]]
4828: @end example
4829:
4830: @table @t
4831: \JP @item $B;2>H(B
4832: \EG @item References
4833: @fref{fctr sqfr},
4834: \JP @fref{$B9`=g=x$N@_Dj(B}.
4835: \EG @fref{Setting term orderings}.
4836: @end table
1.5 noro 4837:
4838: \JP @node primedec_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4839: \EG @node primedec_mod,,, Functions for Groebner basis computation
4840: @subsection @code{primedec_mod}
4841: @findex primedec_mod
4842:
4843: @table @t
4844: @item primedec_mod(@var{plist},@var{vlist},@var{ord},@var{mod},@var{strategy})
4845: \JP :: $B%$%G%"%k$NJ,2r(B
4846: \EG :: Computes decompositions of ideals over small finite fields.
4847: @end table
4848:
4849: @table @var
4850: @item return
4851: @itemx plist
4852: \JP $BB?9`<0%j%9%H(B
4853: \EG list of polynomials
4854: @item vlist
4855: \JP $BJQ?t%j%9%H(B
4856: \EG list of variables
4857: @item ord
4858: \JP $B?t(B, $B%j%9%H$^$?$O9TNs(B
4859: \EG number, list or matrix
4860: @item mod
4861: \JP $B@5@0?t(B
4862: \EG positive integer
4863: @item strategy
4864: \JP $B@0?t(B
4865: \EG integer
4866: @end table
4867:
4868: @itemize @bullet
4869: \BJP
4870: @item
4871: @code{primedec_mod()} $B$O(B @samp{primdec_mod}
4872: $B$GDj5A$5$l$F$$$k(B. @code{[Yokoyama]} $B$NAG%$%G%"%kJ,2r%"%k%4%j%:%`(B
4873: $B$r<BAu$7$F$$$k(B.
4874: @item
4875: @code{primedec_mod()} $B$OM-8BBN>e$G$N%$%G%"%k$N(B
4876: $B:,4p$NAG%$%G%"%kJ,2r$r9T$$(B, $BAG%$%G%"%k$N%j%9%H$rJV$9(B.
4877: @item
4878: @code{primedec_mod()} $B$O(B, GF(@var{mod}) $B>e$G$NJ,2r$rM?$($k(B.
4879: $B7k2L$N3F@.J,$N@8@.85$O(B, $B@0?t78?tB?9`<0$G$"$k(B.
4880: @item
4881: $B7k2L$K$*$$$F(B, $BB?9`<0%j%9%H$H$7$FI=<($5$l$F$$$k3F%$%G%"%k$OA4$F(B
4882: [@var{vlist},@var{ord}] $B$G;XDj$5$l$k9`=g=x$K4X$9$k%0%l%V%J4pDl$G$"$k(B.
4883: @item
4884: @var{strategy} $B$,(B 0 $B$G$J$$$H$-(B, incremental $B$K(B component $B$N6&DL(B
4885: $BItJ,$r7W;;$9$k$3$H$K$h$k(B early termination $B$r9T$&(B. $B0lHL$K(B,
4886: $B%$%G%"%k$N<!85$,9b$$>l9g$KM-8z$@$,(B, 0 $B<!85$N>l9g$J$I(B, $B<!85$,>.$5$$(B
4887: $B>l9g$K$O(B overhead $B$,Bg$-$$>l9g$,$"$k(B.
1.7 noro 4888: @item
4889: $B7W;;ESCf$GFbIt>pJs$r8+$?$$>l9g$K$O!"(B
4890: $BA0$b$C$F(B @code{dp_gr_print(2)} $B$r<B9T$7$F$*$1$P$h$$(B.
1.5 noro 4891: \E
4892: \BEG
4893: @item
4894: Function @code{primedec_mod()}
4895: is defined in @samp{primdec_mod} and implements the prime decomposition
4896: algorithm in @code{[Yokoyama]}.
4897: @item
4898: @code{primedec_mod()}
4899: is the function for prime ideal decomposition
4900: of the radical of a polynomial ideal over small finite field,
4901: and they return a list of prime ideals, which are associated primes
4902: of the input ideal.
4903: @item
4904: @code{primedec_mod()} gives the decomposition over GF(@var{mod}).
4905: The generators of each resulting component consists of integral polynomials.
4906: @item
4907: Each resulting component is a Groebner basis with respect to
4908: a term order specified by [@var{vlist},@var{ord}].
4909: @item
4910: If @var{strategy} is non zero, then the early termination strategy
4911: is tried by computing the intersection of obtained components
4912: incrementally. In general, this strategy is useful when the krull
4913: dimension of the ideal is high, but it may add some overhead
4914: if the dimension is small.
1.7 noro 4915: @item
4916: If you want to see internal information during the computation,
4917: execute @code{dp_gr_print(2)} in advance.
1.5 noro 4918: \E
4919: @end itemize
4920:
4921: @example
4922: [0] load("primdec_mod")$
4923: [246] PP444=[x^8+x^2+t,y^8+y^2+t,z^8+z^2+t]$
4924: [247] primedec_mod(PP444,[x,y,z,t],0,2,1);
4925: [[y+z,x+z,z^8+z^2+t],[x+y,y^2+y+z^2+z+1,z^8+z^2+t],
4926: [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],
4927: [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],
4928: [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],
4929: [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]]
4930: [248]
4931: @end example
4932:
4933: @table @t
4934: \JP @item $B;2>H(B
4935: \EG @item References
4936: @fref{modfctr},
1.6 noro 4937: @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 4938: \JP @fref{$B9`=g=x$N@_Dj(B}.
1.7 noro 4939: \EG @fref{Setting term orderings},
4940: @fref{dp_gr_flags dp_gr_print}.
1.5 noro 4941: @end table
4942:
1.10 noro 4943: \JP @node bfunction bfct generic_bfct ann ann0,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B
4944: \EG @node bfunction bfct generic_bfct ann ann0,,, Functions for Groebner basis computation
4945: @subsection @code{bfunction}, @code{bfct}, @code{generic_bfct}, @code{ann}, @code{ann0}
1.6 noro 4946: @findex bfunction
1.9 noro 4947: @findex bfct
1.6 noro 4948: @findex generic_bfct
1.10 noro 4949: @findex ann
4950: @findex ann0
1.5 noro 4951:
1.6 noro 4952: @table @t
4953: @item bfunction(@var{f})
1.10 noro 4954: @itemx bfct(@var{f})
4955: @itemx generic_bfct(@var{plist},@var{vlist},@var{dvlist},@var{weight})
4956: \JP :: @var{b} $B4X?t$N7W;;(B
4957: \EG :: Computes the global @var{b} function of a polynomial or an ideal
4958: @item ann(@var{f})
4959: @itemx ann0(@var{f})
4960: \JP :: $BB?9`<0$N%Y%-$N(B annihilator $B$N7W;;(B
4961: \EG :: Computes the annihilator of a power of polynomial
1.6 noro 4962: @end table
1.10 noro 4963:
1.6 noro 4964: @table @var
4965: @item return
1.10 noro 4966: \JP $BB?9`<0$^$?$O%j%9%H(B
4967: \EG polynomial or list
4968: @item f
1.6 noro 4969: \JP $BB?9`<0(B
4970: \EG polynomial
4971: @item plist
4972: \JP $BB?9`<0%j%9%H(B
4973: \EG list of polynomials
4974: @item vlist dvlist
4975: \JP $BJQ?t%j%9%H(B
4976: \EG list of variables
4977: @end table
1.5 noro 4978:
1.6 noro 4979: @itemize @bullet
4980: \BJP
4981: @item @samp{bfct} $B$GDj5A$5$l$F$$$k(B.
1.10 noro 4982: @item @code{bfunction(@var{f})}, @code{bfct(@var{f})} $B$OB?9`<0(B @var{f} $B$N(B global @var{b} $B4X?t(B @code{b(s)} $B$r(B
1.6 noro 4983: $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]}
4984: $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
4985: $BB?9`<0(B @code{b(s)} $B$NCf$G(B, $B<!?t$,:G$bDc$$$b$N$G$"$k(B.
4986: @item @code{generic_bfct(@var{f},@var{vlist},@var{dvlist},@var{weight})}
4987: $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,
1.10 noro 4988: $B%&%'%$%H(B @var{weight} $B$K4X$9$k(B global @var{b} $B4X?t$r7W;;$9$k(B.
1.6 noro 4989: @var{vlist} $B$O(B @code{x}-$BJQ?t(B, @var{vlist} $B$OBP1~$9$k(B @code{D}-$BJQ?t(B
4990: $B$r=g$KJB$Y$k(B.
1.9 noro 4991: @item @code{bfunction} $B$H(B @code{bfct} $B$G$OMQ$$$F$$$k%"%k%4%j%:%`$,(B
1.11 noro 4992: $B0[$J$k(B. $B$I$A$i$,9bB.$+$OF~NO$K$h$k(B.
1.10 noro 4993: @item @code{ann(@var{f})} $B$O(B, @code{@var{f}^s} $B$N(B annihilator ideal
4994: $B$N@8@.7O$rJV$9(B. @code{ann(@var{f})} $B$O(B, @code{[@var{a},@var{list}]}
4995: $B$J$k%j%9%H$rJV$9(B. $B$3$3$G(B, @var{a} $B$O(B @var{f} $B$N(B @var{b} $B4X?t$N:G>.@0?t:,(B,
4996: @var{list} $B$O(B @code{ann(@var{f})} $B$N7k2L$N(B @code{s}$ $B$K(B, @var{a} $B$r(B
4997: $BBeF~$7$?$b$N$G$"$k(B.
1.7 noro 4998: @item $B>\:Y$K$D$$$F$O(B, [Saito,Sturmfels,Takayama] $B$r8+$h(B.
1.6 noro 4999: \E
5000: \BEG
5001: @item These functions are defined in @samp{bfct}.
1.10 noro 5002: @item @code{bfunction(@var{f})} and @code{bfct(@var{f})} compute the global @var{b}-function @code{b(s)} of
1.6 noro 5003: a polynomial @var{f}.
5004: @code{b(s)} is a polynomial of the minimal degree
5005: such that there exists @code{P(x,s)} in D[s], which is a polynomial
5006: ring over Weyl algebra @code{D}, and @code{P(x,s)f^(s+1)=b(s)f^s} holds.
5007: @item @code{generic_bfct(@var{f},@var{vlist},@var{dvlist},@var{weight})}
1.10 noro 5008: computes the global @var{b}-function of a left ideal @code{I} in @code{D}
1.6 noro 5009: generated by @var{plist}, with respect to @var{weight}.
5010: @var{vlist} is the list of @code{x}-variables,
5011: @var{vlist} is the list of corresponding @code{D}-variables.
1.9 noro 5012: @item @code{bfunction(@var{f})} and @code{bfct(@var{f})} implement
5013: different algorithms and the efficiency depends on inputs.
1.10 noro 5014: @item @code{ann(@var{f})} returns the generator set of the annihilator
5015: ideal of @code{@var{f}^s}.
5016: @code{ann(@var{f})} returns a list @code{[@var{a},@var{list}]},
5017: where @var{a} is the minimal integral root of the global @var{b}-function
5018: of @var{f}, and @var{list} is a list of polynomials obtained by
5019: substituting @code{s} in @code{ann(@var{f})} with @var{a}.
1.7 noro 5020: @item See [Saito,Sturmfels,Takayama] for the details.
1.6 noro 5021: \E
5022: @end itemize
5023:
5024: @example
5025: [0] load("bfct")$
5026: [216] bfunction(x^3+y^3+z^3+x^2*y^2*z^2+x*y*z);
5027: -9*s^5-63*s^4-173*s^3-233*s^2-154*s-40
5028: [217] fctr(@@);
5029: [[-1,1],[s+2,1],[3*s+4,1],[3*s+5,1],[s+1,2]]
5030: [218] F = [4*x^3*dt+y*z*dt+dx,x*z*dt+4*y^3*dt+dy,
5031: x*y*dt+5*z^4*dt+dz,-x^4-z*y*x-y^4-z^5+t]$
5032: [219] generic_bfct(F,[t,z,y,x],[dt,dz,dy,dx],[1,0,0,0]);
5033: 20000*s^10-70000*s^9+101750*s^8-79375*s^7+35768*s^6-9277*s^5
5034: +1278*s^4-72*s^3
1.10 noro 5035: [220] P=x^3-y^2$
5036: [221] ann(P);
5037: [2*dy*x+3*dx*y^2,-3*dx*x-2*dy*y+6*s]
5038: [222] ann0(P);
5039: [-1,[2*dy*x+3*dx*y^2,-3*dx*x-2*dy*y-6]]
1.6 noro 5040: @end example
5041:
5042: @table @t
5043: \JP @item $B;2>H(B
5044: \EG @item References
5045: \JP @fref{Weyl $BBe?t(B}.
5046: \EG @fref{Weyl algebra}.
5047: @end table
1.5 noro 5048:
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