=================================================================== RCS file: /home/cvs/OpenXM/src/asir-doc/parts/groebner.texi,v retrieving revision 1.1.1.1 retrieving revision 1.26 diff -u -p -r1.1.1.1 -r1.26 --- OpenXM/src/asir-doc/parts/groebner.texi 1999/12/08 05:47:44 1.1.1.1 +++ OpenXM/src/asir-doc/parts/groebner.texi 2020/09/08 09:16:57 1.26 @@ -1,236 +1,580 @@ -@node $B%0%l%V%J4pDl$N7W;;(B,,, Top -@chapter $B%0%l%V%J4pDl$N7W;;(B +@comment $OpenXM: OpenXM/src/asir-doc/parts/groebner.texi,v 1.25 2020/09/07 05:16:41 noro Exp $ +\BJP +@node グレブナ基底の計算,,, Top +@chapter グレブナ基底の計算 +\E +\BEG +@node Groebner basis computation,,, Top +@chapter Groebner basis computation +\E @menu -* $BJ,;6I=8=B?9`<0(B:: -* $B%U%!%$%k$NFI$_9~$_(B:: -* $B4pK\E*$JH!?t(B:: -* $B7W;;$*$h$SI=<($N@)8f(B:: -* $B9`=g=x$N@_Dj(B:: -* $BM-M}<0$r78?t$H$9$k%0%l%V%J4pDl7W;;(B:: -* $B4pDlJQ49(B:: -* $B%0%l%V%J4pDl$K4X$9$kH!?t(B:: +\BJP +* 分散表現多項式:: +* 基本的な函数:: +* 計算および表示の制御:: +* 項順序の設定:: +* Weight:: +* 有理式を係数とするグレブナ基底計算:: +* 基底変換:: +* Weyl 代数:: +* 多項式環上の加群:: +* グレブナ基底に関する函数:: +\E +\BEG +* Distributed polynomial:: +* Reading files:: +* Fundamental functions:: +* Controlling Groebner basis computations:: +* Setting term orderings:: +* Weight:: +* Groebner basis computation with rational function coefficients:: +* Change of ordering:: +* Weyl algebra:: +* Module over a polynomial ring:: +* Functions for Groebner basis computation:: +\E @end menu -@node $BJ,;6I=8=B?9`<0(B,,, $B%0%l%V%J4pDl$N7W;;(B -@section $BJ,;6I=8=B?9`<0(B +\BJP +@node 分散表現多項式,,, グレブナ基底の計算 +@section 分散表現多項式 +\E +\BEG +@node Distributed polynomial,,, Groebner basis computation +@section Distributed polynomial +\E @noindent -$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 -(@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 -$B$A(B, $BFCDj$NJQ?t$r$NJQ?t$O(B, $B$=$N(B 1 $BJQ(B -$B?tB?9`<0$N78?t$K(B, $B> @end example -$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 -$B$r<($9(B. $B3FJQ?t$r(B @code{a}, @code{b}, @code{c}, @code{d}, @code{e} $B$H$9$k$H(B -$B$3$N9`$O(B @code{b*c^2*d^3*e^4} $B$rI=$9(B. +\BJP +という形で表示され, また, この形で入力可能である. この例は, 5 変数の項 +を示す. 各変数を @code{a}, @code{b}, @code{c}, @code{d}, @code{e} とすると +この項は @code{b*c^2*d^3*e^4} を表す. +\E +\BEG +and also can be input in such a form. +This example shows a term in 5 variables. If we assume the 5 variables +as @code{a}, @code{b}, @code{c}, @code{d}, and @code{e}, +the term represents @code{b*c^2*d^3*e^4} in the ordinary expression. +\E -@item $B9`=g=x(B (term order) -$BJ,;6I=8=B?9`<0$K$*$1$k9`$O(B, $B 1 +\JP 任意の項 @code{t} に対し @code{t} > 1 +\EG For all @code{t} @code{t} > 1. @item -@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} +\JP @code{t}, @code{s}, @code{u} を項とする時, @code{t} > @code{s} ならば @code{tu} > @code{su} +\EG For all @code{t}, @code{s}, @code{u} @code{t} > @code{s} implies @code{tu} > @code{su}. @end enumerate -$B$3$N@-> @end example -$B$H$$$&7A$GI=<($5$l(B, $B$^$?(B, $B$3$N7A$GF~NO2DG=$G$"$k(B. +\JP という形で表示され, また, この形で入力可能である. +\EG and also can be input in such a form. -@itemx $BF,C19`<0(B (head monomial) -@item $BF,9`(B (head term) -@itemx $BF,78?t(B (head coefficient) -$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 -$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 -$B$H8F$V(B. +\BJP +@item 頭項 (head term) +@itemx 頭単項式 (head monomial) +@itemx 頭係数 (head coefficient) +分散表現多項式における各単項式は, 項順序により整列される. この時順 +序最大の単項式を頭単項式, それに現れる項, 係数をそれぞれ頭項, 頭係数 +と呼ぶ. +\E +\BEG +@item head term +@itemx head monomial +@itemx head coefficient + +Monomials in a distributed polynomial is sorted by a total order. +In such representation, we call the monomial that is maximum +with respect to the order the head monomial, and its term and coefficient +the head term and the head coefficient respectively. +\E @end table -@node $B%U%!%$%k$NFI$_9~$_(B,,, $B%0%l%V%J4pDl$N7W;;(B -@section $B%U%!%$%k$NFI$_9~$_(B - @noindent -$B%0%l%V%J4pDl$r7W;;$9$k$?$a$N4pK\E*$JH!?t$O(B @code{dp_gr_main()} $B$*$h$S(B -@code{dp_gr_mod_main()} $B$J$k(B 2 $B$D$NAH$_9~$_H!?t$G$"$k$,(B, $BDL>o$O(B, $B%Q%i%a%?(B -$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. -$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 -$B$_9~$`$3$H$K$h$j;HMQ2DG=$H$J$k(B. @samp{gr} $B$O(B, @b{Asir} $B$NI8=`(B -$B%i%$%V%i%j%G%#%l%/%H%j$KCV$+$l$F$$$k(B. $B$h$C$F(B, $B4D6-JQ?t(B @code{ASIR_LIBDIR} -$B$rFC$K0[$J$k%Q%9$K@_Dj$7$J$$8B$j(B, $B%U%!%$%kL>$N$_$GFI$_9~$`$3$H$,$G$-$k(B. +ChangeLog +@itemize @bullet +\BJP +@item 分散表現多項式は任意のオブジェクトを係数にもてるようになった. +また加群のk成分の要素を次の形式 <> で表現するようになった (2017-08-31). +\E +\BEG +@item Distributed polynomials accept objects as coefficients. +The k-th element of a free module is expressed as <> (2017-08-31). +\E +@item +1.15 algnum.c, +1.53 ctrl.c, +1.66 dp-supp.c, +1.105 dp.c, +1.73 gr.c, +1.4 reduct.c, +1.16 _distm.c, +1.17 dalg.c, +1.52 dist.c, +1.20 distm.c, +1.8 gmpq.c, +1.238 engine/nd.c, +1.102 ca.h, +1.411 version.h, +1.28 cpexpr.c, +1.42 pexpr.c, +1.20 pexpr_body.c, +1.40 spexpr.c, +1.27 arith.c, +1.77 eval.c, +1.56 parse.h, +1.37 parse.y, +1.8 stdio.c, +1.31 plotf.c +@end itemize +\BJP +@node 基本的な函数,,, グレブナ基底の計算 +@section 基本的な函数 +\E +\BEG +@node Fundamental functions,,, Groebner basis computation +@section Fundamental functions +\E + +@noindent +\BJP +2003 年以前の版においては, グレブナ基底を計算するための基本的な函数は @code{dp_gr_main()} および +@code{dp_gr_mod_main()}, @code{dp_gr_f_main()} + なる 3 つの組み込み函数であった. 通常は, パラメタ +設定などを行ったのちこれらを呼び出すユーザ函数を用いるのが便利である. +これらのユーザ函数は, ファイル @samp{gr} を @code{load()} により読 +み込むことにより使用可能となる. @samp{gr} は, @b{Asir} の標準 +ライブラリディレクトリに置かれている. @example [0] load("gr")$ @end example -@node $B4pK\E*$JH!?t(B,,, $B%0%l%V%J4pDl$N7W;;(B -@section $B4pK\E*$JH!?t(B +現在の版においては, @code{nd_gr}, @code{nd_f4} などの新しい関数が実装されており, +一般にこちらの方が効率よくグレブナー基底が計算できる +(@fref{nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace}). +\E +\BEG +In the vesion before 2003, +facilities for computing Groebner bases are +@code{dp_gr_main()}, @code{dp_gr_mod_main()}and @code{dp_gr_f_main()}. +To call these functions, +it is necessary to set several parameters correctly and it is convenient +to use a set of interface functions provided in the library file +@samp{gr}. +The facilities will be ready to use after you load the package by +@code{load()}. The package @samp{gr} is placed in the standard library +directory of @b{Asir}. + +In the current vesion, new functions such as @code{nd_gr}, @code{nd_f4} are available +and these function can compute Groebner bases more efficiently than old functions +(@fref{nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace}). +\E + @noindent -@samp{gr} $B$G$O?tB?$/$NH!?t$,Dj5A$5$l$F$$$k$,(B, $BD>@\(B -$B%0%l%V%J4pDl$r7W;;$9$k$?$a$N%H%C%W%l%Y%k$Ol9g(B, sugar strategy $B$,78?tKDD%$r0z$-5/$3$9>l9g$,$"$k(B. $B$3$N$h$&$J>l(B -$B9g(B, strategy $B$r@Fl9g$,B?$$(B. +\BJP +入力多項式を斉次化した後 @code{gr()} のグレブナ基底候補生成部により候 +補生成し, 非斉次化, interreduce したものを @code{gr()} のグレブナ基底 +チェック部でチェックする. 0 次元システム (解の個数が有限個の方程式系) +の場合, sugar strategy が係数膨張を引き起こす場合がある. このような場 +合, strategy を斉次化による strategy に置き換えることにより係数膨張を +抑制することができる場合が多い. +\E +\BEG +After homogenizing the input polynomials a candidate of the \gr basis +is computed by trace-lifting. Then the candidate is dehomogenized and +checked whether it is indeed a Groebner basis of the input. Sugar +strategy often causes intermediate coefficient swells. It is +empirically known that the combination of homogenization and supresses +the swells for such cases. +\E @item gr_mod(@var{plist},@var{vlist},@var{order},@var{p}) -Gebauer-Moeller $B$K$h$k(B useless pair elimination criteria, sugar -strategy $B$*$h$S(B Buchberger $B%"%k%4%j%:%`$K$h$k(B GF(p) $B78?t%0%l%V%J4pDl7W(B -$B;;H!?t(B. - +\BJP +Gebauer-Moeller による useless pair elimination criteria, sugar +strategy および Buchberger アルゴリズムによる GF(p) 係数グレブナ基底計 +算函数. +\E +\BEG +Function that computes Groebner bases over GF(@var{p}). The same +algorithm as @code{gr()} is used. +\E @end table -@node $B7W;;$*$h$SI=<($N@)8f(B,,, $B%0%l%V%J4pDl$N7W;;(B -@section $B7W;;$*$h$SI=<($N@)8f(B +\BJP +現在の版においては, これらに相当する機能は @code{nd_gr}, @code{nd_gr_trace} にまとめられている. +詳しくは @fref{nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace} 参照. +\E +\BEG +In the current version, the functions corresponding to these three interfaces are provided +by @code{nd_gr}, @code{nd_gr_trace}. +See @fref{nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace}. +\E +\BJP +@node 計算および表示の制御,,, グレブナ基底の計算 +@section 計算および表示の制御 +\E +\BEG +@node Controlling Groebner basis computations,,, Groebner basis computation +@section Controlling Groebner basis computations +\E + @noindent -$B%0%l%V%J4pDl$N7W;;$K$*$$$F(B, $B$5$^$6$^$J%Q%i%a%?@_Dj$r9T$&$3$H$K$h$j7W;;(B, -$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()} -$B$K$h$j@_Dj;2>H$9$k$3$H$,$G$-$k(B. $BL50z?t$G(B @code{dp_gr_flags()} $B$rA0$HCM$N%j%9%H$GJV$5$l$k(B. +\BJP +グレブナ基底の計算において, さまざまなパラメタ設定を行うことにより計算, +表示を制御することができる. これらは, 組み込み函数 @code{dp_gr_flags()} +により設定参照することができる. 無引数で @code{dp_gr_flags()} を実行する +と, 現在設定されているパラメタが, 名前と値のリストで返される. +\E +\BEG +One can cotrol a Groebner basis computation by setting various parameters. +These parameters can be set and examined by a built-in function +@code{dp_gr_flags()}. Without argument it returns the current settings. +\E @example [100] dp_gr_flags(); -[Demand,0,NoSugar,0,NoCriB,0,NoGC,0,NoMC,0,NoRA,0,NoGCD,0,Top,0,ShowMag,1, -Print,1,Stat,0,Reverse,0,InterReduce,0,Multiple,0] +[Demand,0,NoSugar,0,NoCriB,0,NoGC,0,NoMC,0,NoRA,0,NoGCD,0,Top,0, +ShowMag,1,Print,1,Stat,0,Reverse,0,InterReduce,0,Multiple,0] [101] @end example -$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 -$B$$$&(B. $B$3$l$i$N%Q%i%a%?$N=i4|CM$OA4$F(B 0 (off) $B$G$"$k(B. +\BJP +以下で, 各パラメタの意味を説明する. on の場合とは, パラメタが 0 でない場合を +いう. これらのパラメタの初期値は全て 0 (off) である. +\E +\BEG +The return value is a list which contains the names of parameters and their +values. The meaning of the parameters are as follows. `on' means that the +parameter is not zero. +\E - @table @code @item NoSugar -on $B$N>l9g(B, sugar strategy $B$NBe$o$j$K(B Buchberger$B$N(B normal strategy $B$,MQ(B -$B$$$i$l$k(B. +\BJP +on の場合, sugar strategy の代わりに Buchbergerの normal strategy が用 +いられる. +\E +\BEG +If `on', Buchberger's normal strategy is used instead of sugar strategy. +\E @item NoCriB -on $B$N>l9g(B, $BITI,MWBP8!=P5,=`$N$&$A(B, $B5,=`(B B $B$rE,MQ$7$J$$(B. +\JP on の場合, 不必要対検出規準のうち, 規準 B を適用しない. +\EG If `on', criterion B among the Gebauer-Moeller's criteria is not applied. @item NoGC -on $B$N>l9g(B, $B7k2L$,%0%l%V%J4pDl$K$J$C$F$$$k$+$I$&$+$N%A%'%C%/$r9T$o$J$$(B. +\JP on の場合, 結果がグレブナ基底になっているかどうかのチェックを行わない. +\BEG +If `on', the check that a Groebner basis candidate is indeed a Groebner basis, +is not executed. +\E @item NoMC -on $B$N>l9g(B, $B7k2L$,F~NO%$%G%"%k$HF1Ey$N%$%G%"%k$G$"$k$+$I$&$+$N%A%'%C%/(B -$B$r9T$o$J$$(B. +\BJP +on の場合, 結果が入力イデアルと同等のイデアルであるかどうかのチェック +を行わない. +\E +\BEG +If `on', the check that the resulting polynomials generates the same ideal as +the ideal generated by the input, is not executed. +\E @item NoRA -on $B$N>l9g(B, $B7k2L$r(B reduced $B%0%l%V%J4pDl$K$9$k$?$a$N(B -interreduce $B$r9T$o$J$$(B. +\BJP +on の場合, 結果を reduced グレブナ基底にするための +interreduce を行わない. +\E +\BEG +If `on', the interreduction, which makes the Groebner basis reduced, is not +executed. +\E @item NoGCD -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, -$B78?t$N(B content $B$r$H$i$J$$(B. +\BJP +on の場合, 有理式係数のグレブナ基底計算において, 生成された多項式の, +係数の content をとらない. +\E +\BEG +If `on', content removals are not executed during a Groebner basis computation +over a rational function field. +\E @item Top -on $B$N>l9g(B, normal form $B7W;;$K$*$$$FF,9`>C5n$N$_$r9T$&(B. +\JP on の場合, normal form 計算において頭項消去のみを行う. +\EG If `on', Only the head term of the polynomial being reduced is reduced. -@item Interreduce -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 -$B$h$k(B normal form $B$GCV$-49$($k(B. +@comment @item Interreduce +@comment \BJP +@comment on の場合, 多項式を生成する毎に, それまで生成された基底をその多項式に +@comment よる normal form で置き換える. +@comment \E +@comment \BEG +@comment If `on', intermediate basis elements are reduced by using a newly generated +@comment basis element. +@comment \E @item Reverse -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 -$B@h$7$FA*$V(B. +\BJP +on の場合, normal form 計算の際の reducer を, 新しく生成されたものを優 +先して選ぶ. +\E +\BEG +If `on', the selection strategy of reducer in a normal form computation +is such that a newer reducer is used first. +\E @item Print -on $B$N>l9g(B, $B%0%l%V%J4pDl7W;;$NESCf$K$*$1$k$5$^$6$^$J>pJs$rI=<($9$k(B. +\JP on の場合, グレブナ基底計算の途中におけるさまざまな情報を表示する. +\BEG +If `on', various informations during a Groebner basis computation is +displayed. +\E +@item PrintShort +\JP on で、Print が off の場合, グレブナ基底計算の途中の情報を短縮形で表示する. +\BEG +If `on' and Print is `off', short information during a Groebner basis computation is +displayed. +\E + @item Stat -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 -$B$l$k%G!<%?$NFb(B, $B=87W%G!<%?$N$_$,I=<($5$l$k(B. +\BJP +on で @code{Print} が off ならば, @code{Print} が on のとき表示さ +れるデータの内, 集計データのみが表示される. +\E +\BEG +If `on', a summary of informations is shown after a Groebner basis +computation. Note that the summary is always shown if @code{Print} is `on'. +\E @item ShowMag -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 -$B78?t$N%S%C%HD9$NOB$rI=<($7(B, $B:G8e$K(B, $B$=$l$i$NOB$N:GBgCM$rI=<($9$k(B. +\BJP +on で @code{Print} が on ならば, 生成が生成される毎に, その多項式の +係数のビット長の和を表示し, 最後に, それらの和の最大値を表示する. +\E +\BEG +If `on' and @code{Print} is `on', the sum of bit length of +coefficients of a generated basis element, which we call @var{magnitude}, +is shown after every normal computation. After comleting the +computation the maximal value among the sums is shown. +\E -@item Multiple -0 $B$G$J$$@0?t$N;~(B, $BM-M}?t>e$N@55,7A7W;;$K$*$$$F(B, $B78?t$N%S%C%HD9$NOB$,(B -@code{Multiple} $BG\$K$J$k$4$H$K78?tA4BN$N(B GCD $B$,7W;;$5$l(B, $B$=$N(B GCD $B$G(B -$B3d$C$?B?9`<0$r4JLs$9$k(B. @code{Multiple} $B$,(B 1 $B$J$i$P(B, $B4JLs$9$k$4$H$K(B -GCD $B7W;;$,9T$o$l0lHL$K$O8zN($,0-$/$J$k$,(B, @code{Multiple} $B$r(B 2 $BDxEY(B -$B$H$9$k$H(B, $B5pBg$J@0?t$,78?t$K8=$l$k>l9g(B, $B8zN($,NI$/$J$k>l9g$,$"$k(B. +@item Content +@itemx Multiple +\BJP +0 でない有理数の時, 有理数上の正規形計算において, 係数のビット長の和が +@code{Content} 倍になるごとに係数全体の GCD が計算され, その GCD で +割った多項式を簡約する. @code{Content} が 1 ならば, 簡約するごとに +GCD 計算が行われ一般には効率が悪くなるが, @code{Content} を 2 程度 +とすると, 巨大な整数が係数に現れる場合, 効率が良くなる場合がある. +backward compatibility のため、@code{Multiple} で整数値を指定できる. +\E +\BEG +If a non-zero rational number, in a normal form computation +over the rationals, the integer content of the polynomial being +reduced is removed when its magnitude becomes @code{Content} times +larger than a registered value, which is set to the magnitude of the +input polynomial. After each content removal the registered value is +set to the magnitude of the resulting polynomial. @code{Content} is +equal to 1, the simiplification is done after every normal form computation. +It is empirically known that it is often efficient to set @code{Content} to 2 +for the case where large integers appear during the computation. +An integer value can be set by the keyword @code{Multiple} for +backward compatibility. +\E @item Demand -$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 -$BCf$K$*$+$l$:(B, $B$=$N%G%#%l%/%H%jCf$K%P%$%J%j%G!<%?$H$7$FCV$+$l(B, $B$=$NB?9`(B -$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 -$B9`<0$O(B, $BFbIt$G$N%$%s%G%C%/%9$r%U%!%$%kL>$K;}$D%U%!%$%k$K3JG<$5$l$k(B. -$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 -$B$?$a(B, $B%f!<%6$,@UG$$r;}$C$F>C5n$9$kI,MW$,$"$k(B. + +\BJP +正当なディレクトリ名 (文字列) を値に持つとき, 生成された多項式はメモリ +中におかれず, そのディレクトリ中にバイナリデータとして置かれ, その多項 +式を用いる normal form 計算の際, 自動的にメモリ中にロードされる. 各多 +項式は, 内部でのインデックスをファイル名に持つファイルに格納される. +ここで指定されたディレクトリに書かれたファイルは自動的には消去されない +ため, ユーザが責任を持って消去する必要がある. +\E +\BEG +If the value (a character string) is a valid directory name, then +generated basis elements are put in the directory and are loaded on +demand during normal form computations. Each elements is saved in the +binary form and its name coincides with the index internally used in +the computation. These binary files are not removed automatically +and one should remove them by hand. +\E @end table @noindent -@code{Print} $B$,(B 0 $B$G$J$$>l9gl9g$KMQ$$$i$l$k(B -$B?t$N%j%9%H$G$"$k(B. +\BJP +最初に表示される @code{mod}, @code{eval} は, trace-lifting で用いられる法 +である. @code{mod} は素数, @code{eval} は有理式係数の場合に用いられる +数のリストである. +\E +\BEG +In this example @code{mod} and @code{eval} indicate moduli used in +trace-lifting. @code{mod} is a prime and @code{eval} is a list of integers +used for evaluation when the ground field is a field of rational functions. +\E @noindent -$B7W;;ESCf$GB?9`<0$,@8@.$5$l$kKh$KiD9@-$r=|$$$?4pDl$N?t(B +現在の, 冗長性を除いた基底の数 + @item NAB -$B8=:_$^$G$K@8@.$5$l$?4pDl$N?t(B +現在までに生成された基底の数 + @item RP -$B;D$j$N%Z%"$N?t(B +残りのペアの数 + @item S -$B@8@.$5$l$?B?9`<0$N(B sugar $B$NCM(B +生成された多項式の sugar の値 + @item M -$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. ) + +生成された多項式の係数のビット長の和 (@code{ShowMag} が on の時に表示される. ) +\E +\BEG +@item TNF + +CPU time for normal form computation (second) + +@item TCONT + +CPU time for content removal(second) + +@item HT + +Head term of the generated basis element + +@item INDEX + +Pair of indices which corresponds to the reduced S-polynomial + +@item NB + +Number of basis elements after removing redundancy + +@item NAB + +Number of all the basis elements + +@item RP + +Number of remaining pairs + +@item S + +Sugar of the generated basis element + +@item M + +Magnitude of the genrated basis element (shown if @code{ShowMag} is `on'.) +\E @end table @noindent -$B:G8e$K(B, $B=87W%G!<%?$,I=<($5$l$k(B. $B0UL#$Oe$N(B S-$BB?9`<07W;;;~4V(B +有理数上の S-多項式計算時間 + @item SPM -$BM-8BBN>e$N(B S-$BB?9`<07W;;;~4V(B +有限体上の S-多項式計算時間 + @item NF -$BM-M}?t>e$N(B normal form $B7W;;;~4V(B +有理数上の normal form 計算時間 + @item NFM -$BM-8BBN>e$N(B normal form $B7W;;;~4V(B +有限体上の normal form 計算時間 + @item ZNFM -@code{NFM} $B$NFb(B, 0 $B$X$N(B reduction $B$K$+$+$C$?;~4V(B +@code{NFM} の内, 0 への reduction にかかった時間 + @item PZ -content $B7W;;;~4V(B +content 計算時間 + @item NP -$BM-M}?t78?tB?9`<0$N78?t$KBP$9$k>jM>1i;;$N7W;;;~4V(B +有理数係数多項式の係数に対する剰余演算の計算時間 + @item MP -S-$BB?9`<0$r@8@.$9$k%Z%"$NA*Br$K$+$+$C$?;~4V(B +S-多項式を生成するペアの選択にかかった時間 + @item RA -interreduce $B7W;;;~4V(B +interreduce 計算時間 + @item MC -trace-lifting $B$K$*$1$k(B, $BF~NOB?9`<0$N%a%s%P%7%C%W7W;;;~4V(B +trace-lifting における, 入力多項式のメンバシップ計算時間 + @item GC -$B7k2L$N%0%l%V%J4pDl8uJd$N%0%l%V%J4pDl%A%'%C%/;~4V(B +結果のグレブナ基底候補のグレブナ基底チェック時間 + @item T -$B@8@.$5$l$?%Z%"$N?t(B +生成されたペアの数 + @item B, M, F, D -$B3F(B criterion $B$K$h$j=|$+$l$?%Z%"$N?t(B + +各 criterion により除かれたペアの数 @item ZR -0 $B$K(B reduce $B$5$l$?%Z%"$N?t(B +0 に reduce されたペアの数 + @item NZR -0 $B$G$J$$B?9`<0$K(B reduce $B$5$l$?%Z%"$N?t(B +0 でない多項式に reduce されたペアの数 + @item Max_mag -$B@8@.$5$l$?B?9`<0$N(B, $B78?t$N%S%C%HD9$NOB$N:GBgCM(B +生成された多項式の, 係数のビット長の和の最大値 +\E +\BEG +@item UP + +Time to manipulate the list of critical pairs + +@item SP + +Time to compute S-polynomials over the rationals + +@item SPM + +Time to compute S-polynomials over a finite field + +@item NF + +Time to compute normal forms over the rationals + +@item NFM + +Time to compute normal forms over a finite field + +@item ZNFM + +Time for zero reductions in @code{NFM} + +@item PZ + +Time to remove integer contets + +@item NP + +Time to compute remainders for coefficients of polynomials with coeffieints +in the rationals + +@item MP + +Time to select pairs from which S-polynomials are computed + +@item RA + +Time to interreduce the Groebner basis candidate + +@item MC + +Time to check that each input polynomial is a member of the ideal +generated by the Groebner basis candidate. + +@item GC + +Time to check that the Groebner basis candidate is a Groebner basis + +@item T + +Number of critical pairs generated + +@item B, M, F, D + +Number of critical pairs removed by using each criterion + +@item ZR + +Number of S-polynomials reduced to 0 + +@item NZR + +Number of S-polynomials reduced to non-zero results + +@item Max_mag + +Maximal magnitude among all the generated polynomials +\E @end table -@node $B9`=g=x$N@_Dj(B,,, $B%0%l%V%J4pDl$N7W;;(B -@section $B9`=g=x$N@_Dj(B +\BJP +@node 項順序の設定,,, グレブナ基底の計算 +@section 項順序の設定 +\E +\BEG +@node Setting term orderings,,, Groebner basis computation +@section Setting term orderings +\E @noindent -$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 -$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 -$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 -$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 -$B9TNs$GI=8=$5$l$k(B. +\BJP +項は内部では, 各変数に関する指数を成分とする整数ベクトルとして表現され +る. 多項式を分散表現多項式に変換する際, 各変数がどの成分に対応するかを +指定するのが, 変数リストである. さらに, それら整数ベクトルの全順序を +指定するのが項順序の型である. 項順序型は, 数, 数のリストあるいは +行列で表現される. +\E +\BEG +A term is internally represented as an integer vector whose components +are exponents with respect to variables. A variable list specifies the +correspondences between variables and components. A type of term ordering +specifies a total order for integer vectors. A type of term ordering is +represented by an integer, a list of integer or matrices. +\E @noindent -$B4pK\E*$J9`=g=x7?$H$7$F$NJQ?t=g=x$X$N4pDlJQ49$N$?$a$N%=!<%9$H$7$FMQ$$$i$l$k(B. +\BJP +一般に, この順序によるグレブナ基底計算が最も高速である. ただし, +方程式を解くという目的に用いることは, 一般にはできない. この +順序によるグレブナ基底は, 解の個数の計算, イデアルのメンバシップや, +他の変数順序への基底変換のためのソースとして用いられる. +\E +\BEG +In general, computation by this ordering shows the fastest speed +in most Groebner basis computations. +However, for the purpose to solve polynomial equations, this type +of ordering is, in general, not so suitable. +The Groebner bases obtained by this ordering is used for computing +the number of solutions, solving ideal membership problem and seeds +for conversion to other Groebner bases under different ordering. +\E -@item 1 (DegLex; @b{$BA4@\$=$N7k2L$rMQ$$$k$3$H$O:$Fq$G$"$k(B. $B$7$+$7(B, -$B<-=q<0=g=x$N%0%l%V%J4pDl$r5a$a$k:]$K(B, $B@Fl9g$K:GE,$N7A$N4pDl$rM?$($k$,(B -$B7W;;;~4V$,$+$+$j2a$.$k$N$,FqE@$G$"$k(B. $BFC$K(B, $B2r$,M-8B8D$N>l9g(B, $B7k2L$N(B -$B78?t$,6K$a$FD9Bg$JB?G\D9?t$K$J$k>l9g$,B?$$(B. $B$3$N>l9g(B, @code{gr()}, -@code{hgr()} $B$K$h$k7W;;$,6K$a$FM-8z$K$J$k>l9g$,B?$$(B. +\BJP +この順序によるグレブナ基底は, 方程式を解く場合に最適の形の基底を与えるが +計算時間がかかり過ぎるのが難点である. 特に, 解が有限個の場合, 結果の +係数が極めて長大な多倍長数になる場合が多い. この場合, @code{gr()}, +@code{hgr()} による計算が極めて有効になる場合が多い. +\E +\BEG +Groebner bases computed by this ordering give the most convenient +Groebner bases for solving the polynomial equations. +The only and serious shortcoming is the enormously long computation +time. +It is often observed that the number coefficients of the result becomes +very very long integers, especially if the ideal is 0-dimensional. +For such a case, it is empirically true for many cases +that i.e., computation by +@code{gr()} and/or @code{hgr()} may be quite effective. +\E @end table @noindent -$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. -$B$3$l$O(B, +\BJP +これらを組み合わせてリストで指定することにより, 様々な消去順序が指定できる. +これは, +\E +\BEG +By combining these fundamental orderingl into a list, one can make +various term ordering called elimination orderings. +\E @code{[[O1,L1],[O2,L2],...]} @noindent -$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 -$B?t$rI=$9(B. $B$3$N;XDj$O(B, $BJQ?t$r@hF,$+$i(B @code{L1}, @code{L2} , ...$B8D(B -$B$:$D$NAH$KJ,$1(B, $B$=$l$>$l$NJQ?t$K4X$7(B, $B=g$K(B @code{O1}, @code{O2}, -...$B$N9`=g=x7?$GBg>.$,7hDj$9$k$^$GHf3S$9$k$3$H$r0UL#$9$k(B. $B$3$N7?$N(B -$B=g=x$O0lHL$K>C5n=g=x$H8F$P$l$k(B. +\BJP +で指定される. @code{Oi} は 0, 1, 2 のいずれかで, @code{Li} は変数の個 +数を表す. この指定は, 変数を先頭から @code{L1}, @code{L2} , ...個 +ずつの組に分け, それぞれの変数に関し, 順に @code{O1}, @code{O2}, +...の項順序型で大小が決定するまで比較することを意味する. この型の +順序は一般に消去順序と呼ばれる. +\E +\BEG +In this example @code{Oi} indicates 0, 1 or 2 and @code{Li} indicates +the number of variables subject to the correspoinding orderings. +This specification means the following. + +The variable list is separated into sub lists from left to right where +the @code{i}-th list contains @code{Li} members and it corresponds to +the ordering of type @code{Oi}. The result of a comparison is equal +to that for the leftmost different sub components. This type of ordering +is called an elimination ordering. +\E @noindent -$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 -@code{m} $BNs$Ns} $B$r(B, @code{M(t-s)} $B$N(B 0 $B$G$J$$:G=i$N@.J,$,HsIi(B, -$B$GDj5A$9$k$3$H$K$h$j9`=g=x$,Dj5A$G$-$k(B. +\BJP +この時, 2 つのベクトル @code{t}, @code{s} に対し, +@code{t>s} を, @code{M(t-s)} の 0 でない最初の成分が非負, +で定義することにより項順序が定義できる. +\E +\BEG +Then we can define a term ordering such that, for two vectors +@code{t}, @code{s}, @code{t>s} means that the first non-zero component +of @code{M(t-s)} is non-negative. +\E @noindent -$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 -@code{dp_ord()} $B$G;XDj$5$l(B, $B$5$^$6$^$JH!?t$NH$5$l$k(B. +\BJP +項順序型は, @code{gr()} などの引数として指定される他, 組み込み函数 +@code{dp_ord()} で指定され, さまざまな函数の実行の際に参照される. +\E +\BEG +Types of term orderings are used as arguments of functions such as +@code{gr()}. It is also set internally by @code{dp_ord()} and is used +during executions of various functions. +\E @noindent -$B$3$l$i$N=g=x$N6qBNE*$JDj5A$*$h$S%0%l%V%J4pDl$K4X$9$k99$K>\$7$$2r@b$O(B -@code{[Becker,Weispfenning]} $B$J$I$r;2>H$N$3$H(B. +\BJP +これらの順序の具体的な定義およびグレブナ基底に関する更に詳しい解説は +@code{[Becker,Weispfenning]} などを参照のこと. +\E +\BEG +For concrete definitions of term ordering and more information +about Groebner basis, refer to, for example, the book +@code{[Becker,Weispfenning]}. +\E @noindent -$B9`=g=x7?$N@_Dj$NB>$K(B, $BJQ?t$N=g=x<+BN$b7W;;;~4V$KBg$-$J1F6A$rM?$($k(B. +\JP 項順序型の設定の他に, 変数の順序自体も計算時間に大きな影響を与える. +\BEG +Note that the variable ordering have strong effects on the computation +time as well as the choice of types of term orderings. +\E @example [90] B=[x^10-t,x^8-z,x^31-x^6-x-y]$ @@ -443,46 +1055,210 @@ trace-lifting $B$K$*$1$k(B, $BF~NOB?9`<0$N%a%s%P%7% -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 +(-12*t^16+72*t^13-28*t^11-180*t^10+112*t^8+240*t^7+28*t^6-127*t^5 -167*t^4-55*t^3+30*t^2+58*t-15)*z^4, -(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+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+(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+27*t^3-16*t^2-30*t+7)*z^4, -(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-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+10*t^4-36*t^3 --11*t^2-5*t+9)*z^2, +(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 ++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 ++(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 ++27*t^3-16*t^2-30*t+7)*z^4, +(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 +-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 ++10*t^4-36*t^3-11*t^2-5*t+9)*z^2, -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 --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+20*t^19 -+28*t^18-120*t^16-56*t^15+14*t^14+300*t^13+70*t^12-56*t^11-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-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-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, +-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 ++20*t^19+28*t^18-120*t^16-56*t^15+14*t^14+300*t^13+70*t^12-56*t^11 +-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 +-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 +-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, -z*y^3+(t^7-2*t^4+3*t^2+t)*y+(-2*t^6+4*t^3+2*t-2)*z^2, -2*t^2*y^3+z^2*y^2+(-2*t^5+4*t^2-6)*z^4*y+(4*t^8-t^7-8*t^5+2*t^4-4*t^3+5*t^2-t)*z, +2*t^2*y^3+z^2*y^2+(-2*t^5+4*t^2-6)*z^4*y ++(4*t^8-t^7-8*t^5+2*t^4-4*t^3+5*t^2-t)*z, z^3*y^2+2*t^3*y+(-t^7+2*t^4+t^2-t)*z^2, -t*z*y^2-2*z^3*y+t^8-2*t^5-t^3+t^2, --t^3*y^2-2*t^2*z^2*y+(t^6-2*t^3-t+1)*z^4, -z^5-t^4] +-t^3*y^2-2*t^2*z^2*y+(t^6-2*t^3-t+1)*z^4,z^5-t^4] [93] gr(B,[t,z,y,x],2); [x^10-t,x^8-z,x^31-x^6-x-y] @end example @noindent -$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 -$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 -$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 -$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 -$B$3$H$G$"$j(B, $B$3$NNc$N>l9g$O(B, @code{t}, @code{z}, @code{y} $B$,4{$K(B -@code{x} $B$GI=$5$l$F$$$k$3$H$+$i$3$N$h$&$J6KC<$J7k2L$H$J$C$?$o$1$G$"$k(B. -$B/$J$/(B, $B;n9T:x8m$,I,MW$J>l9g$b$"$k(B. +\BJP +変数順序 @code{[x,y,z,t]} におけるグレブナ基底は, 基底の数も多く, それぞれの +式も大きい. しかし, 順序 @code{[t,z,y,x]} にもとでは, @code{B} がすでに +グレブナ基底となっている. 大雑把にいえば, 辞書式順序でグレブナ基底を求める +ことは, 左側の (順序の高い) 変数を, 右側の (順序の低い) 変数で書き表す +ことであり, この例の場合は, @code{t}, @code{z}, @code{y} が既に +@code{x} で表されていることからこのような極端な結果となったわけである. +実際に現れる計算においては, このように選ぶべき変数順序が明らかである +ことは少なく, 試行錯誤が必要な場合もある. +\E +\BEG +As you see in the above example, the Groebner base under variable +ordering @code{[x,y,z,t]} has a lot of bases and each base itself is +large. Under variable ordering @code{[t,z,y,x]}, however, @code{B} itself +is already the Groebner basis. +Roughly speaking, to obtain a Groebner base under the lexicographic +ordering is to express the variables on the left (having higher order) +in terms of variables on the right (having lower order). +In the example, variables @code{t}, @code{z}, and @code{y} are already +expressed by variable @code{x}, and the above explanation justifies +such a drastic experimental results. +In practice, however, optimum ordering for variables may not known +beforehand, and some heuristic trial may be inevitable. +\E -@node $BM-M}<0$r78?t$H$9$k%0%l%V%J4pDl7W;;(B,,, $B%0%l%V%J4pDl$N7W;;(B -@section $BM-M}<0$r78?t$H$9$k%0%l%V%J4pDl7W;;(B +\BJP +@node Weight ,,, グレブナ基底の計算 +@section Weight +\E +\BEG +@node Weight,,, Groebner basis computation +@section Weight +\E +\BJP +前節で紹介した項順序は, 各変数に weight (重み) を設定することで +より一般的なものとなる. +\E +\BEG +Term orderings introduced in the previous section can be generalized +by setting a weight for each variable. +\E +@example +[0] dp_td(<<1,1,1>>); +3 +[1] dp_set_weight([1,2,3])$ +[2] dp_td(<<1,1,1>>); +6 +@end example +\BJP +単項式の全次数を計算する際, デフォルトでは +各変数の指数の和を全次数とする. これは各変数の weight を 1 と +考えていることに相当する. この例では, 第一, 第二, 第三変数の +weight をそれぞれ 1,2,3 と指定している. このため, @code{<<1,1,1>>} +の全次数 (以下ではこれを単項式の weight と呼ぶ) が @code{1*1+1*2+1*3=6} となる. +weight を設定することで, 同じ項順序型のもとで異なる項順序が定義できる. +例えば, weight をうまく設定することで, 多項式を weighted homogeneous +にすることができる場合がある. +\E +\BEG +By default, the total degree of a monomial is equal to +the sum of all exponents. This means that the weight for each variable +is set to 1. +In this example, the weights for the first, the second and the third +variable are set to 1, 2 and 3 respectively. +Therefore the total degree of @code{<<1,1,1>>} under this weight, +which is called the weight of the monomial, is @code{1*1+1*2+1*3=6}. +By setting weights, different term orderings can be set under a type of +term ordeing. In some case a polynomial can +be made weighted homogeneous by setting an appropriate weight. +\E +\BJP +各変数に対する weight をまとめたものを weight vector と呼ぶ. +すべての成分が正であり, グレブナ基底計算において, 全次数の +代わりに用いられるものを特に sugar weight と呼ぶことにする. +sugar strategy において, 全次数の代わりに使われるからである. +一方で, 各成分が必ずしも正とは限らない weight vector は, +sugar weight として設定することはできないが, 項順序の一般化には +有用である. これらは, 行列による項順序の設定にすでに現れて +いる. すなわち, 項順序を定義する行列の各行が, 一つの weight vector +と見なされる. また, ブロック順序は, 各ブロックの +変数に対応する成分のみ 1 で他は 0 の weight vector による比較を +最初に行ってから, 各ブロック毎の tie breaking を行うことに相当する. +\E + +\BEG +A list of weights for all variables is called a weight vector. +A weight vector is called a sugar weight vector if +its elements are all positive and it is used for computing +a weighted total degree of a monomial, because such a weight +is used instead of total degree in sugar strategy. +On the other hand, a weight vector whose elements are not necessarily +positive cannot be set as a sugar weight, but it is useful for +generalizing term order. In fact, such a weight vector already +appeared in a matrix order. That is, each row of a matrix defining +a term order is regarded as a weight vector. A block order +is also considered as a refinement of comparison by weight vectors. +It compares two terms by using a weight vector whose elements +corresponding to variables in a block is 1 and 0 otherwise, +then it applies a tie breaker. +\E + +\BJP +weight vector の設定は @code{dp_set_weight()} で行うことができる +が, 項順序を指定する際の他のパラメタ (項順序型, 変数順序) と +まとめて設定できることが望ましい. このため, 次のような形でも +項順序が指定できる. +\E +\BEG +A weight vector can be set by using @code{dp_set_weight()}. +However it is more preferable if a weight vector can be set +together with other parapmeters such as a type of term ordering +and a variable order. This is realized as follows. +\E + +@example +[64] B=[x+y+z-6,x*y+y*z+z*x-11,x*y*z-6]$ +[65] dp_gr_main(B|v=[x,y,z],sugarweight=[3,2,1],order=0); +[z^3-6*z^2+11*z-6,x+y+z-6,-y^2+(-z+6)*y-z^2+6*z-11] +[66] dp_gr_main(B|v=[y,z,x],order=[[1,1,0],[0,1,0],[0,0,1]]); +[x^3-6*x^2+11*x-6,x+y+z-6,-x^2+(-y+6)*x-y^2+6*y-11] +[67] dp_gr_main(B|v=[y,z,x],order=[[x,1,y,2,z,3]]); +[x+y+z-6,x^3-6*x^2+11*x-6,-x^2+(-y+6)*x-y^2+6*y-11] +@end example + +\BJP +いずれの例においても, 項順序は option として指定されている. +最初の例では @code{v} により変数順序を, @code{sugarweight} により +sugar weight vector を, @code{order}により項順序型を指定している. +二つ目の例における @code{order} の指定は matrix order と同様である. +すなわち, 指定された weight vector を左から順に使って weight の比較 +を行う. 三つ目の例も同様であるが, ここでは weight vector の要素を +変数毎に指定している. 指定がないものは 0 となる. 三つ目の例では, +@code{order} による指定では項順序が決定しない. この場合には, +tie breaker として全次数逆辞書式順序が自動的に設定される. +この指定方法は, @code{dp_gr_main}, @code{dp_gr_mod_main} など +の組み込み関数でのみ可能であり, @code{gr} などのユーザ定義関数 +では未対応である. +\E +\BEG +In each example, a term ordering is specified as options. +In the first example, a variable order, a sugar weight vector +and a type of term ordering are specified by options @code{v}, +@code{sugarweight} and @code{order} respectively. +In the second example, an option @code{order} is used +to set a matrix ordering. That is, the specified weight vectors +are used from left to right for comparing terms. +The third example shows a variant of specifying a weight vector, +where each component of a weight vector is specified variable by variable, +and unspecified components are set to zero. In this example, +a term order is not determined only by the specified weight vector. +In such a case a tie breaker by the graded reverse lexicographic ordering +is set automatically. +This type of a term ordering specification can be applied only to builtin +functions such as @code{dp_gr_main()}, @code{dp_gr_mod_main()}, not to +user defined functions such as @code{gr()}. +\E + +\BJP +@node 有理式を係数とするグレブナ基底計算,,, グレブナ基底の計算 +@section 有理式を係数とするグレブナ基底計算 +\E +\BEG +@node Groebner basis computation with rational function coefficients,,, Groebner basis computation +@section Groebner basis computation with rational function coefficients +\E + @noindent -@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 -$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 -$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 -$BBN$N85$H$7$F07$&(B. +\BJP +@code{gr()} などのトップレベル函数は, いずれも, 入力多項式リストに +現れる変数 (不定元) と, 変数リストに現れる変数を比較して, 変数リストに +ない変数が入力多項式に現れている場合には, 自動的に, その変数を, 係数 +体の元として扱う. +\E +\BEG +Such variables that appear within the input polynomials but +not appearing in the input variable list are automatically treated +as elements in the coefficient field +by top level functions, such as @code{gr()}. +\E @example [64] gr([a*x+b*y-c,d*x+e*y-f],[x,y],2); @@ -490,80 +1266,326 @@ z^5-t^4] @end example @noindent -$B$3$NNc$G$O(B, @code{a}, @code{b}, @code{c}, @code{d} $B$,78?tBN$N85$H$7$F(B -$B07$o$l$k(B. $B$9$J$o$A(B, $BM-M}H!?tBN(B -@b{F} = @b{Q}(@code{a},@code{b},@code{c},@code{d}) $B>e$N(B 2 $BJQ?tB?9`<04D(B -@b{F}[@code{x},@code{y}] $B$K$*$1$k%0%l%V%J4pDl$r5a$a$k$3$H$K$J$k(B. -$BCm0U$9$Y$-$3$H$O(B, -$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 -$B$H$7$F$N6&DL0x;R$,$"$C$?>l9g$K$O(B, $B7k2L$+$i$=$N0x;R$O=|$+$l$F$$$k(B -$B$?$a(B, $BM-M}?tBN>e$NB?9`<04D>e$NLdBj$H$7$F9M$($?>l9g$N7k2L$H$O0lHL(B -$B$K$O0[$J$k(B. $B$^$?(B, $Be$NLdBj$N$?$a(B, $BJ,;6I=8=B?9`<0(B -$B$N78?t$H$7$Fl9g(B, $BD>@\(B @code{gr()} $B$J$I$r5/F0$9$k(B -$B$h$j(B, $B0lC6B>$N=g=x(B ($BNc$($PA4l9g(B -$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 -$BJQ49$H8F$P$l$kJ}K!$K$h$j(B, Buchberger $B%"%k%4%j%:%`$K$h$i$:$K8zN(NI$/(B -$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 -$BH!?t$,(B, $B%f!<%6Dj5AH!?t$H$7$F(B @samp{gr} $B$K$$$/$D$+Dj5A$5$l$F$$$k(B. -$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 -$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 -@var{vlist2} $B$K$*$1$k<-=q<0=g=x$N%0%l%V%J4pDl$KJQ49$9$kH!?t$G$"$k(B. +\BJP +辞書式順序のグレブナ基底を求める場合, 直接 @code{gr()} などを起動する +より, 一旦他の順序 (例えば全次数逆辞書式順序) のグレブナ基底を計算して, +それを入力として辞書式順序のグレブナ基底を計算する方が効率がよい場合 +がある. また, 入力が何らかの順序でのグレブナ基底になっている場合, 基底 +変換と呼ばれる方法により, Buchberger アルゴリズムによらずに効率良く +辞書式順序のグレブナ基底が計算できる場合がある. このような目的のための +函数が, ユーザ定義函数として @samp{gr} にいくつか定義されている. +以下の 2 つの函数は, 変数順序 @var{vlist1}, 項順序型 @var{order} で +既にグレブナ基底となっている多項式リスト @var{gbase} を, 変数順序 +@var{vlist2} における辞書式順序のグレブナ基底に変換する函数である. +\E +\BEG +When we compute a lex order Groebner basis, it is often efficient to +compute it via Groebner basis with respect to another order such as +degree reverse lex order, rather than to compute it directory by +@code{gr()} etc. If we know that an input is a Groebner basis with +respect to an order, we can apply special methods called change of +ordering for a Groebner basis computation with respect to another +order, without using Buchberger algorithm. The following two functions +are ones for change of ordering such that they convert a Groebner +basis @var{gbase} with respect to the variable order @var{vlist1} and +the order type @var{order} into a lex Groebner basis with respect +to the variable order @var{vlist2}. +\E @table @code @item tolex(@var{gbase},@var{vlist1},@var{order},@var{vlist2}) -$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. -$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 -$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. +\BJP +この函数は, @var{gbase} が有理数体上のシステムの場合にのみ使用可能である. +この函数は, 辞書式順序のグレブナ基底を, 有限体上で計算されたグレブナ基底 +を雛型として, 未定係数法および Hensel 構成により求めるものである. +\E +\BEG +This function can be used only when @var{gbase} is an ideal over the +rationals. The input @var{gbase} must be a Groebner basis with respect +to the variable order @var{vlist1} and the order type @var{order}. Moreover +the ideal generated by @var{gbase} must be zero-dimensional. +This computes the lex Groebner basis of @var{gbase} +by using the modular change of ordering algorithm. The algorithm first +computes the lex Groebner basis over a finite field. Then each element +in the lex Groebner basis over the rationals is computed with undetermined +coefficient method and linear equation solving by Hensel lifting. +\E @item tolex_tl(@var{gbase},@var{vlist1},@var{order},@var{vlist2},@var{homo}) -$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 -$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 -trace-lifting$B$K$*$1$k%0%l%V%J4pDl8uJd$NF,9`(B, $BF,78?t$N@-JN,$7$F$$(B -$B$k$?$a(B, $BC1$K(BBuchberger $B%"%k%4%j%:%`$r7+$jJV$9$h$j8zN($h$/7W;;$G$-$k(B. -$B99$K(B, $BF~NO$,(B 0 $Bl9g(B, $B<+F0E*$K$b$&(B 1 $B$D$NCf4VE*$J9`=g=x$r(B -$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, -$BD>@\<-=q<0=g=x$N7W;;$r9T$&$h$j8zN($,$h$$(B. ($B$b$A$m$sNc30$"$j(B. ) -$B0z?t(B @var{homo} $B$,(B 0 $B$G$J$$;~(B, @code{hgr()} $B$HF1MM$K@F(B, 0 $B.B?9`<0$r5a$a$k(B -$BH!?t(B, 0 $BH$N$3$H(B. +\BJP +その他, 0 次元システムに対し, 与えられた多項式の最小多項式を求める +函数, 0 次元システムの解を, よりコンパクトに表現するための函数などが +@samp{gr} で定義されている. これらについては個々の函数の説明を参照のこと. +\E +\BEG +For zero-dimensional systems, there are several fuctions to +compute the minimal polynomial of a polynomial and or a more compact +representation for zeros of the system. They are all defined in @samp{gr}. +Refer to the sections for each functions. +\E -@node $B%0%l%V%J4pDl$K4X$9$kH!?t(B,,, $B%0%l%V%J4pDl$N7W;;(B -@section $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\BJP +@node Weyl 代数,,, グレブナ基底の計算 +@section Weyl 代数 +\E +\BEG +@node Weyl algebra,,, Groebner basis computation +@section Weyl algebra +\E +@noindent + +\BJP +これまでは, 通常の可換な多項式環におけるグレブナ基底計算について +述べてきたが, グレブナ基底の理論は, ある条件を満たす非可換な +環にも拡張できる. このような環の中で, 応用上も重要な, +Weyl 代数, すなわち多項式環上の微分作用素環の演算および +グレブナ基底計算が Risa/Asir に実装されている. + +体 @code{K} 上の @code{n} 次元 Weyl 代数 +@code{D=K} は +\E + +\BEG +So far we have explained Groebner basis computation in +commutative polynomial rings. However Groebner basis can be +considered in more general non-commutative rings. +Weyl algebra is one of such rings and +Risa/Asir implements fundamental operations +in Weyl algebra and Groebner basis computation in Weyl algebra. + +The @code{n} dimensional Weyl algebra over a field @code{K}, +@code{D=K} is a non-commutative +algebra which has the following fundamental relations: +\E + +@code{xi*xj-xj*xi=0}, @code{Di*Dj-Dj*Di=0}, @code{Di*xj-xj*Di=0} (@code{i!=j}), +@code{Di*xi-xi*Di=1} + +\BJP +という基本関係を持つ環である. @code{D} は 多項式環 @code{K[x1,@dots{},xn]} を係数 +とする微分作用素環で, @code{Di} は @code{xi} による微分を表す. 交換関係により, +@code{D} の元は, @code{x1^i1*@dots{}*xn^in*D1^j1*@dots{}*Dn^jn} なる単項 +式の @code{K} 線形結合として書き表すことができる. +Risa/Asir においては, この単項式を, 可換な多項式と同様に +@code{<>} で表す. すなわち, @code{D} の元も +分散表現多項式として表される. 加減算は, 可換の場合と同様に, @code{+}, @code{-} +により +実行できるが, 乗算は, 非可換性を考慮して @code{dp_weyl_mul()} という関数 +により実行する. +\E + +\BEG +@code{D} is the ring of differential operators whose coefficients +are polynomials in @code{K[x1,@dots{},xn]} and +@code{Di} denotes the differentiation with respect to @code{xi}. +According to the commutation relation, +elements of @code{D} can be represented as a @code{K}-linear combination +of monomials @code{x1^i1*@dots{}*xn^in*D1^j1*@dots{}*Dn^jn}. +In Risa/Asir, this type of monomial is represented +by @code{<>} as in the case of commutative +polynomial. +That is, elements of @code{D} are represented by distributed polynomials. +Addition and subtraction can be done by @code{+}, @code{-}, +but multiplication is done by calling @code{dp_weyl_mul()} because of +the non-commutativity of @code{D}. +\E + +@example +[0] A=<<1,2,2,1>>; +(1)*<<1,2,2,1>> +[1] B=<<2,1,1,2>>; +(1)*<<2,1,1,2>> +[2] A*B; +(1)*<<3,3,3,3>> +[3] dp_weyl_mul(A,B); +(1)*<<3,3,3,3>>+(1)*<<3,2,3,2>>+(4)*<<2,3,2,3>>+(4)*<<2,2,2,2>> ++(2)*<<1,3,1,3>>+(2)*<<1,2,1,2>> +@end example + +\BJP +グレブナ基底計算についても, Weyl 代数専用の関数として, +次の関数が用意してある. +\E +\BEG +The following functions are avilable for Groebner basis computation +in Weyl algebra: +\E +@code{dp_weyl_gr_main()}, +@code{dp_weyl_gr_mod_main()}, +@code{dp_weyl_gr_f_main()}, +@code{dp_weyl_f4_main()}, +@code{dp_weyl_f4_mod_main()}. +\BJP +また, 応用として, global b 関数の計算が実装されている. +\E +\BEG +Computation of the global b function is implemented as an application. +\E + +\BJP +@node 多項式環上の加群,,, グレブナ基底の計算 +@section 多項式環上の加群 +\E +\BEG +@node Module over a polynomial ring,,, Groebner basis computation +@section Module over a polynomial ring +\E + +@noindent + +\BJP +多項式環上の自由加群の元は, 加群単項式 te_i の線型和として内部表現される. +ここで t は多項式環の単項式, e_i は自由加群の標準基底である. 加群単項式は, 多項式環の単項式 +に位置 i を追加した @code{<>} で表す. 加群多項式, すなわち加群単項式の線型和は, +設定されている加群項順序にしたがって降順に整列される. 加群項順序には以下の3種類がある. + +@table @code +@item TOP 順序 + +これは, te_i > se_j となるのは t>s または (t=s かつ i se_j となるのは is) となるような項順序である. ここで, +t, s の比較は多項式環に設定されている順序で行う. +この型の順序は, @code{dp_ord([1,Ord])} に +より設定する. ここで, @code{Ord} は多項式環の順序型である. + +@item Schreyer 型順序 + +各標準基底 e_i に対し, 別の自由加群の加群単項式 T_i が与えられていて, te_i > se_j となるのは +tT_i > sT_j または (tT_i=sT_j かつ i>} なる形式で直接入力する他に, +多項式リストを作り, @code{dpm_ltod()} により変換する方法もある. +\E +\BEG +not yet +\E + +\BJP +@node グレブナ基底に関する函数,,, グレブナ基底の計算 +@section グレブナ基底に関する函数 +\E +\BEG +@node Functions for Groebner basis computation,,, Groebner basis computation +@section Functions for Groebner basis computation +\E + @menu * gr hgr gr_mod:: * lex_hensel lex_tl tolex tolex_d tolex_tl:: * lex_hensel_gsl tolex_gsl tolex_gsl_d:: * gr_minipoly minipoly:: * tolexm minipolym:: -* dp_gr_main dp_gr_mod_main:: -* dp_f4_main dp_f4_mod_main:: +* 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:: +* dp_f4_main dp_f4_mod_main dp_weyl_f4_main dp_weyl_f4_mod_main:: +* nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace:: +* nd_gr_postproc nd_weyl_gr_postproc:: * dp_gr_flags dp_gr_print:: * dp_ord:: +* dp_set_weight dp_set_top_weight dp_weyl_set_weight:: * dp_ptod:: * dp_dtop:: * dp_mod dp_rat:: * dp_homo dp_dehomo:: * dp_ptozp dp_prim:: -* dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod:: +* dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod dp_weyl_nf dp_weyl_nf_mod:: * dp_hm dp_ht dp_hc dp_rest:: +* dpm_hm dpm_ht dpm_hc dpm_hp dpm_rest:: +* dpm_sp:: +* dpm_redble:: +* dpm_nf dpm_nf_and_quotient:: +* dpm_dtol:: +* dpm_ltod:: +* dpm_dptodpm:: +* dpm_schreyer_base:: +* dpm_schreyer_frame:: +* dpm_set_schreyer_level:: +* dpm_sp_nf:: * dp_td dp_sugar:: * dp_lcm:: * dp_redble:: @@ -578,9 +1600,13 @@ trace-lifting$B$K$*$1$k%0%l%V%J4pDl8uJd$NF,9`(B, $B * katsura hkatsura cyclic hcyclic:: * dp_vtoe dp_etov:: * lex_hensel_gsl tolex_gsl tolex_gsl_d:: +* primadec primedec:: +* primedec_mod:: +* bfunction bfct generic_bfct ann ann0:: @end menu -@node gr hgr gr_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node gr hgr gr_mod,,, グレブナ基底に関する函数 +\EG @node gr hgr gr_mod,,, Functions for Groebner basis computation @subsection @code{gr}, @code{hgr}, @code{gr_mod}, @code{dgr} @findex gr @findex hgr @@ -592,42 +1618,97 @@ trace-lifting$B$K$*$1$k%0%l%V%J4pDl8uJd$NF,9`(B, $B @itemx hgr(@var{plist},@var{vlist},@var{order}) @itemx gr_mod(@var{plist},@var{vlist},@var{order},@var{p}) @itemx dgr(@var{plist},@var{vlist},@var{order},@var{procs}) -:: $B%0%l%V%J4pDl$N7W;;(B +\JP :: グレブナ基底の計算 +\EG :: Groebner basis computation @end table @table @var @item return -$B%j%9%H(B -@item plist, vlist, procs -$B%j%9%H(B +\JP リスト +\EG list +@item plist vlist procs +\JP リスト +\EG list @item order -$B?t(B, $B%j%9%H$^$?$O9TNs(B +\JP 数, リストまたは行列 +\EG number, list or matrix @item p -2^27 $BL$K~$NAG?t(B +\JP 2^27 未満の素数 +\EG prime less than 2^27 @end table @itemize @bullet +\BJP @item -$BI8=`%i%$%V%i%j$N(B @samp{gr} $B$GDj5A$5$l$F$$$k(B. +標準ライブラリの @samp{gr} で定義されている. @item -$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 -@var{order} $B$K4X$9$k%0%l%V%J4pDl$r5a$a$k(B. @code{gr()}, @code{hgr()} -$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. +gr を名前に含む関数は現在メンテされていない. @code{nd_gr}系の関数を代わりに利用すべきである(@fref{nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace}). @item -@var{vlist} $B$OITDj85$N%j%9%H(B. @var{vlist} $B$K8=$l$J$$ITDj85$O(B, -$B78?tBN$KB0$9$k$H8+$J$5$l$k(B. +いずれも, 多項式リスト @var{plist} の, 変数順序 @var{vlist}, 項順序型 +@var{order} に関するグレブナ基底を求める. @code{gr()}, @code{hgr()} +は 有理数係数, @code{gr_mod()} は GF(@var{p}) 係数として計算する. @item -@code{gr()}, trace-lifting ($B%b%8%e%i1i;;$rMQ$$$?9bB.2=(B) $B$*$h$S(B sugar -strategy $B$K$h$k7W;;(B, @code{hgr()} $B$O(B trace-lifting $B$*$h$S(B -$B@Fl9g$O$[$H$s$IDL?.$N$?$a$N;~4V$G$"$k(B. +@code{dgr()} は, @code{gr()}, @code{hgr()} を +子プロセスリスト @var{procs} の 2 つのプロセスにより同時に計算させ, +先に結果を返した方の結果を返す. 結果は同一であるが, どちらの方法が +高速か一般には不明のため, 実際の経過時間を短縮するのに有効である. +@item +@code{dgr()} で表示される時間は, この函数が実行されているプロセスでの +CPU 時間であり, この函数の場合はほとんど通信のための時間である. +@item +多項式リスト @var{plist} の要素が分散表現多項式の場合は +結果も分散表現多項式のリストである. +この場合, 引数の分散多項式は与えられた順序に従い @code{dp_sort} で +ソートされてから計算される. +多項式リストの要素が分散表現多項式の場合も +変数の数分の不定元のリストを @var{vlist} 引数として与えないといけない +(ダミー). +\E +\BEG +@item +These functions are defined in @samp{gr} in the standard library +directory. +@item +Functions of which names contains gr are obsolted. +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}). +@item +They compute a Groebner basis of a polynomial list @var{plist} with +respect to the variable order @var{vlist} and the order type @var{order}. +@code{gr()} and @code{hgr()} compute a Groebner basis over the rationals +and @code{gr_mod} computes over GF(@var{p}). +@item +Variables not included in @var{vlist} are regarded as +included in the ground field. +@item +@code{gr()} uses trace-lifting (an improvement by modular computation) + and sugar strategy. +@code{hgr()} uses trace-lifting and a cured sugar strategy +by using homogenization. +@item +@code{dgr()} executes @code{gr()}, @code{dgr()} simultaneously on +two process in a child process list @var{procs} and returns +the result obtained first. The results returned from both the process +should be equal, but it is not known in advance which method is faster. +Therefore this function is useful to reduce the actual elapsed time. +@item +The CPU time shown after an exection of @code{dgr()} indicates +that of the master process, and most of the time corresponds to the time +for communication. +@item +When the elements of @var{plist} are distributed polynomials, +the result is also a list of distributed polynomials. +In this case, firstly the elements of @var{plist} is sorted by @code{dp_sort} +and the Grobner basis computation is started. +Variables must be given in @var{vlist} even in this case +(these variables are dummy). +\E @end itemize @example @@ -642,13 +1723,14 @@ CPU $B;~4V$G$"$j(B, $B$3$NH!?t$N>l9g$O$[$H$s$IDL?.$ @end example @table @t -@item $B;2>H(B -@comment @fref{dp_gr_main dp_gr_mod_main}, -@fref{dp_gr_main dp_gr_mod_main}, +\JP @item 参照 +\EG @item References +@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}, @fref{dp_ord}. @end table -@node lex_hensel lex_tl tolex tolex_d tolex_tl,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node lex_hensel lex_tl tolex tolex_d tolex_tl,,, グレブナ基底に関する函数 +\EG @node lex_hensel lex_tl tolex tolex_d tolex_tl,,, Functions for Groebner basis computation @subsection @code{lex_hensel}, @code{lex_tl}, @code{tolex}, @code{tolex_d}, @code{tolex_tl} @findex lex_hensel @findex lex_tl @@ -659,97 +1741,184 @@ CPU $B;~4V$G$"$j(B, $B$3$NH!?t$N>l9g$O$[$H$s$IDL?.$ @table @t @item lex_hensel(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo}) @itemx lex_tl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo}) -:: $B4pDlJQ49$K$h$k<-=q<0=g=x%0%l%V%J4pDl$N7W;;(B +\JP :: 基底変換による辞書式順序グレブナ基底の計算 +\EG:: Groebner basis computation with respect to a lex order by change of ordering @item tolex(@var{plist},@var{vlist1},@var{order},@var{vlist2}) @itemx tolex_d(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{procs}) @itemx tolex_tl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo}) -:: $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 +\JP :: グレブナ基底を入力とする, 基底変換による辞書式順序グレブナ基底の計算 +\EG :: Groebner basis computation with respect to a lex order by change of ordering, starting from a Groebner basis @end table @table @var @item return -$B%j%9%H(B -@item plist, vlist1, vlist2, procs -$B%j%9%H(B +\JP リスト +\EG list +@item plist vlist1 vlist2 procs +\JP リスト +\EG list @item order -$B?t(B, $B%j%9%H$^$?$O9TNs(B +\JP 数, リストまたは行列 +\EG number, list or matrix @item homo -$B%U%i%0(B +\JP フラグ +\EG flag @end table @itemize @bullet +\BJP @item -$BI8=`%i%$%V%i%j$N(B @samp{gr} $B$GDj5A$5$l$F$$$k(B. +標準ライブラリの @samp{gr} で定義されている. @item -@code{lex_hensel()}, @code{lex_tl()} $B$O(B, -$BB?9`<0%j%9%H(B @var{plist} $B$N(B, $BJQ?t=g=x(B @var{vlist1}, $B9`=g=x7?(B -@var{order} $B$K4X$9$k%0%l%V%J4pDl$r5a$a(B, $B$=$l$r(B, $BJQ?t=g=x(B @var{vlist2} -$B$N<-=q<0=g=x%0%l%V%J4pDl$KJQ49$9$k(B. +@code{lex_hensel()}, @code{lex_tl()} は, +多項式リスト @var{plist} の, 変数順序 @var{vlist1}, 項順序型 +@var{order} に関するグレブナ基底を求め, それを, 変数順序 @var{vlist2} +の辞書式順序グレブナ基底に変換する. @item -@code{tolex()}, @code{tolex_tl()} $B$O(B, -$BJQ?t=g=x(B @var{vlist1}, $B9`=g=x7?(B @var{order} $B$K4X$9$k%0%l%V%J4pDl$G$"$k(B -$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 -$B4pDl$KJQ49$9$k(B. -@code{tolex_d()} $B$O(B, @code{tolex()} $B$K$*$1$k(B, $B3F4pDl$N7W;;$r(B, $B;R%W%m%;%9(B -$B%j%9%H(B @var{procs} $B$N3F%W%m%;%9$KJ,;67W;;$5$;$k(B. +@code{tolex()}, @code{tolex_tl()} は, +変数順序 @var{vlist1}, 項順序型 @var{order} に関するグレブナ基底である +多項式リスト @var{plist} を変数順序 @var{vlist2} の辞書式順序グレブナ +基底に変換する. +@code{tolex_d()} は, @code{tolex()} における, 各基底の計算を, 子プロセス +リスト @var{procs} の各プロセスに分散計算させる. @item -@code{lex_hensel()}, @code{lex_tl()} $B$K$*$$$F$O(B, $B<-=q<0=g=x%0%l%V%J4pDl$N(B -$B7W;;$OH(B.) - +@code{lex_hensel()}, @code{lex_tl()} においては, 辞書式順序グレブナ基底の +計算は次のように行われる. (@code{[Noro,Yokoyama]} 参照.) @enumerate @item -@var{vlist1}, @var{order} $B$K4X$9$k%0%l%V%J4pDl(B @var{G0} $B$r7W;;$9$k(B. -(@code{lex_hensel()} $B$N$_(B. ) +@var{vlist1}, @var{order} に関するグレブナ基底 @var{G0} を計算する. +(@code{lex_hensel()} のみ. ) @item -@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 -$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 -@var{Gp} $B$r7W;;$9$k(B. +@var{G0} の各元の @var{vlist2} に関する辞書式順序における頭係数を割らない +ような素数 @var{p} を選び, GF(@var{p}) 上での辞書式順序グレブナ基底 +@var{Gp} を計算する. @item -@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. +@var{Gp} に現れるすべての項の, @var{G0} に関する正規形 @var{NF} を計算する. @item -@var{Gp} $B$N3F85(B @var{f} $B$K$D$-(B, @var{f} $B$N78?t$rL$Dj78?t$G(B, -@var{f} $B$N3F9`$rBP1~$9$k(B @var{NF} $B$N85$GCV$-49$((B, $B3F9`$N78?t$r(B 0 $B$HCV$$$?(B, -$BL$Dj78?t$K4X$9$k@~7AJ}Dx<07O(B @var{Lf} $B$r:n$k(B. +@var{Gp} の各元 @var{f} につき, @var{f} の係数を未定係数で, +@var{f} の各項を対応する @var{NF} の元で置き換え, 各項の係数を 0 と置いた, +未定係数に関する線形方程式系 @var{Lf} を作る. @item -@var{Lf} $B$,(B, $BK!(B @var{p} $B$G0l0U2r$r;}$D$3$H$rMQ$$$F(B @var{Lf} $B$N2r$r(B -$BK!(B @var{p}$B$N2r$+$i(B Hensel $B9=@.$K$h$j5a$a$k(B. +@var{Lf} が, 法 @var{p} で一意解を持つことを用いて @var{Lf} の解を +法 @var{p}の解から Hensel 構成により求める. @item -$B$9$Y$F$N(B @var{Gp} $B$N85$K$D$-@~7AJ}Dx<0$,2r$1$?$i$=$N2rA4BN$,5a$a$k(B -$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, -@var{p} $B$r$H$jD>$7$F$d$jD>$9(B. +すべての @var{Gp} の元につき線形方程式が解けたらその解全体が求める +辞書式順序でのグレブナ基底. もしどれかの線形方程式の求解に失敗したら, +@var{p} をとり直してやり直す. @end enumerate @item -@code{lex_tl()}, @code{tolex_tl()} $B$K$*$$$F$O(B, $B<-=q<0=g=x%0%l%V%J4pDl$N(B -$B7W;;$O$7$F$d$jD>$9(B. +@var{G0} が 0 次元システムでないとき, @var{G0} を入力として, +@var{G0} の各元の @var{vlist2} に関する辞書式順序における頭係数を割らない +ような素数 @var{p} を選び, @var{p} を用いた trace-lifting により辞書式 +順序のグレブナ基底候補を求め, もし求まったならチェックなしにそれが求める +グレブナ基底となる. もし失敗したら, @var{p} をとり直してやり直す. @item -@var{G0} $B$,(B 0 $BC5n$9$k>C5n=g=x$K$h$j(B -$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 -$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 -$BF,78?t$r3d$i$J$$AG?t$rMQ$$$?(B trace-lifting $B$G%0%l%V%J4pDl8uJd$r5a$a(B, -$B$b$75a$^$C$?$i%A%'%C%/$J$7$K$=$l$,$=$N=g=x$G$N%0%l%V%J4pDl$H$J$k(B. +@var{G0} が 0 次元システムのとき, @var{G0} を入力として, +まず, @var{vlist2} の最後の変数以外を消去する消去順序により +グレブナ基底 @var{G1} を計算し, それから辞書式順序のグレブナ基底を +計算する. その際, 各ステップでは, 入力の各元の, 求める順序における +頭係数を割らない素数を用いた trace-lifting でグレブナ基底候補を求め, +もし求まったらチェックなしにそれがその順序でのグレブナ基底となる. @end enumerate @item -$BM-M}<078?t$N7W;;$O(B, @code{lex_tl()}, @code{tolex_tl()} $B$N$_l9g(B, $BFbIt$G5/F0$5$l$k(B Buchberger $B%"%k%4%j%:%`$K(B -$B$*$$$F(B, $B@Fl9g$O$[$H$s$IDL?.$ @end example @table @t -@item $B;2>H(B -@fref{dp_gr_main dp_gr_mod_main}, -@fref{dp_ord}, @fref{$BJ,;67W;;(B} +\JP @item 参照 +\EG @item References +@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}, +\JP @fref{dp_ord}, @fref{分散計算} +\EG @fref{dp_ord}, @fref{Distributed computation} @end table -@node lex_hensel_gsl tolex_gsl tolex_gsl_d,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node lex_hensel_gsl tolex_gsl tolex_gsl_d,,, グレブナ基底に関する函数 +\EG @node lex_hensel_gsl tolex_gsl tolex_gsl_d,,, Functions for Groebner basis computation @subsection @code{lex_hensel_gsl}, @code{tolex_gsl}, @code{tolex_gsl_d} @findex lex_hensel_gsl @findex tolex_gsl @@ -784,45 +1956,82 @@ CPU $B;~4V$G$"$j(B, $B$3$NH!?t$N>l9g$O$[$H$s$IDL?.$ @table @t @item lex_hensel_gsl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo}) -:: GSL $B7A<0$N%$%G%"%k4pDl$N7W;;(B -@item tolex_gsl(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo}) -@itemx tolex_gsl_d(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{homo},@var{procs}) -:: $B%0%l%V%J4pDl$rF~NO$H$9$k(B, GSL $B7A<0$N%$%G%"%k4pDl$N7W;;(B +\JP :: GSL 形式のイデアル基底の計算 +\EG ::Computation of an GSL form ideal basis +@item tolex_gsl(@var{plist},@var{vlist1},@var{order},@var{vlist2}) +@itemx tolex_gsl_d(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{procs}) +\JP :: グレブナ基底を入力とする, GSL 形式のイデアル基底の計算 +\EG :: Computation of an GSL form ideal basis stating from a Groebner basis @end table @table @var @item return -$B%j%9%H(B -@item plist, vlist1, vlist2, procs -$B%j%9%H(B +\JP リスト +\EG list +@item plist vlist1 vlist2 procs +\JP リスト +\EG list @item order -$B?t(B, $B%j%9%H$^$?$O9TNs(B +\JP 数, リストまたは行列 +\EG number, list or matrix @item homo -$B%U%i%0(B +\JP フラグ +\EG flag @end table @itemize @bullet +\BJP @item -@code{lex_hensel_gsl()} $B$O(B @code{lex_hensel()} $B$N(B, @code{tolex_gsl()} $B$O(B -@code{tolex()} $B$NJQl9g(B, -@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) -$B$rJV$9(B. -$B$3$3$G(B, @code{gi} $B$O(B, @code{f0'fi-gi} $B$,(B @code{f0} $B$G3d$j@Z$l$k$h$&$J(B -@code{x0} $B$N(B1 $BJQ?tB?9`<0$G(B, -$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')]} -$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 -$B$h$kDL>o$N%0%l%V%J4pDl$rJV$9(B. +入力が 0 次元システムで, その辞書式順序グレブナ基底が +@code{[f0,x1-f1,...,xn-fn]} (@code{f0},...,@code{fn} は +@code{x0} の 1 変数多項式) なる形 (これを SL 形式と呼ぶ) を持つ場合, +@code{[[x1,g1,d1],...,[xn,gn,dn],[x0,f0,f0']]} なるリスト (これを GSL 形式と呼ぶ) +を返す. +ここで, @code{gi} は, @code{di*f0'*fi-gi} が @code{f0} で割り切れるような +@code{x0} の1 変数多項式で, +解は @code{f0(x0)=0} なる @code{x0} に対し, @code{[x1=g1/(d1*f0'),...,xn=gn/(dn*f0')]} +となる. 辞書式順序グレブナ基底が上のような形でない場合, @code{tolex()} に +よる通常のグレブナ基底を返す. @item -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 -$B$N%0%l%V%J4pDl$h$jHs>o$K>.$5$$$?$a7W;;$bB.$/(B, $B2r$b5a$a$d$9$$(B. -@code{tolex_gsl_d()} $B$GI=<($5$l$k;~4V$O(B, $B$3$NH!?t$,H(B +\JP @item 参照 +\EG @item References @fref{lex_hensel lex_tl tolex tolex_d tolex_tl}, -@fref{$BJ,;67W;;(B} +\JP @fref{分散計算} +\EG @fref{Distributed computation} @end table -@node gr_minipoly minipoly,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node gr_minipoly minipoly,,, グレブナ基底に関する函数 +\EG @node gr_minipoly minipoly,,, Functions for Groebner basis computation @subsection @code{gr_minipoly}, @code{minipoly} @findex gr_minipoly @findex minipoly @table @t @item gr_minipoly(@var{plist},@var{vlist},@var{order},@var{poly},@var{v},@var{homo}) -:: $BB?9`<0$N(B, $B%$%G%"%k$rK!$H$7$?:G>.B?9`<0$N7W;;(B +\JP :: 多項式の, イデアルを法とした最小多項式の計算 +\EG :: Computation of the minimal polynomial of a polynomial modulo an ideal @item minipoly(@var{plist},@var{vlist},@var{order},@var{poly},@var{v}) -:: $B%0%l%V%J4pDl$rF~NO$H$9$k(B, $BB?9`<0$N:G>.B?9`<0$N7W;;(B +\JP :: グレブナ基底を入力とする, 多項式の最小多項式の計算 +\EG :: Computation of the minimal polynomial of a polynomial modulo an ideal @end table @table @var @item return -$BB?9`<0(B -@item plist, vlist -$B%j%9%H(B +\JP 多項式 +\EG polynomial +@item plist vlist +\JP リスト +\EG list @item order -$B?t(B, $B%j%9%H$^$?$O9TNs(B +\JP 数, リストまたは行列 +\EG number, list or matrix @item poly -$BB?9`<0(B +\JP 多項式 +\EG polynomial @item v -$BITDj85(B +\JP 不定元 +\EG indeterminate @item homo -$B%U%i%0(B +\JP フラグ +\EG flag @end table @itemize @bullet +\BJP @item -@code{gr_minipoly()} $B$O%0%l%V%J4pDl$N7W;;$+$i9T$$(B, @code{minipoly()} $B$O(B -$BF~NO$r%0%l%V%J4pDl$H$_$J$9(B. +@code{gr_minipoly()} はグレブナ基底の計算から行い, @code{minipoly()} は +入力をグレブナ基底とみなす. @item -$B%$%G%"%k(B I $B$,BN(B K $B>e$NB?9`<04D(B K[X] $B$N(B 0 $B.B?9`<0$H8F$V(B. +イデアル I が体 K 上の多項式環 K[X] の 0 次元イデアルの時, +K[@var{v}] の元 f(@var{v}) に f(@var{p}) mod I を対応させる +環準同型の核は 0 でない多項式により生成される. この生成元を @var{p} +の, 法 @var{I} での最小多項式と呼ぶ. @item -@code{gr_minipoly()}, @code{minipoly()} $B$O(B, $BB?9`<0(B @var{p} $B$N:G>.B?9`<0(B -$B$r5a$a(B, @var{v} $B$rJQ?t$H$9$kB?9`<0$H$7$FJV$9(B. +@code{gr_minipoly()}, @code{minipoly()} は, 多項式 @var{p} の最小多項式 +を求め, @var{v} を変数とする多項式として返す. @item -$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, -$B:G>.B?9`<0$N$_$r5a$a$?$$>l9g(B, @code{minipoly()}, @code{gr_minipoly()} $B$O(B -$B%0%l%V%J4pDl$rMQ$$$kJ}K!$KHf$Y$F8zN($,$h$$(B. +最小多項式は, グレブナ基底の 1 つの元として計算することもできるが, +最小多項式のみを求めたい場合, @code{minipoly()}, @code{gr_minipoly()} は +グレブナ基底を用いる方法に比べて効率がよい. @item -@code{gr_minipoly()} $B$K;XDj$9$k9`=g=x$H$7$F$O(B, $BDL>oA4H(B +\JP @item 参照 +\EG @item References @fref{lex_hensel lex_tl tolex tolex_d tolex_tl}. @end table -@node tolexm minipolym,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node tolexm minipolym,,, グレブナ基底に関する函数 +\EG @node tolexm minipolym,,, Functions for Groebner basis computation @subsection @code{tolexm}, @code{minipolym} @findex tolexm @findex minipolym @table @t @item tolexm(@var{plist},@var{vlist1},@var{order},@var{vlist2},@var{mod}) -:: $BK!(B @var{mod} $B$G$N4pDlJQ49$K$h$k%0%l%V%J4pDl7W;;(B +\JP :: 法 @var{mod} での基底変換によるグレブナ基底計算 +\EG :: Groebner basis computation modulo @var{mod} by change of ordering. @item minipolym(@var{plist},@var{vlist1},@var{order},@var{poly},@var{v},@var{mod}) -:: $BK!(B @var{mod} $B$G$N%0%l%V%J4pDl$K$h$kB?9`<0$N:G>.B?9`<0$N7W;;(B +\JP :: 法 @var{mod} でのグレブナ基底による多項式の最小多項式の計算 +\EG :: Minimal polynomial computation modulo @var{mod} the same method as @end table @table @var @item return -@code{tolexm()} : $B%j%9%H(B, @code{minipolym()} : $BB?9`<0(B -@item plist, vlist1, vlist2 -$B%j%9%H(B +\JP @code{tolexm()} : リスト, @code{minipolym()} : 多項式 +\EG @code{tolexm()} : list, @code{minipolym()} : polynomial +@item plist vlist1 vlist2 +\JP リスト +\EG list @item order -$B?t(B, $B%j%9%H$^$?$O9TNs(B +\JP 数, リストまたは行列 +\EG number, list or matrix @item mod -$BAG?t(B +\JP 素数 +\EG prime @end table @itemize @bullet +\BJP @item -$BF~NO(B @var{plist} $B$O$$$:$l$b(B $BJQ?t=g=x(B @var{vlist1}, $B9`=g=x7?(B @var{order}, -$BK!(B @var{mod} $B$K$*$1$k%0%l%V%J4pDl$G$J$1$l$P$J$i$J$$(B. +入力 @var{plist} はいずれも 変数順序 @var{vlist1}, 項順序型 @var{order}, +法 @var{mod} におけるグレブナ基底でなければならない. @item -@code{minipolym()} $B$O(B @code{minipoly} $B$KBP1~$9$k7W;;$rK!(B @var{mod}$B$G9T$&(B. +@code{minipolym()} は @code{minipoly} に対応する計算を法 @var{mod}で行う. @item -@code{tolexm()} $B$O(B FGLM $BK!$K$h$k4pDlJQ49$K$h$j(B @var{vlist2}, -$B<-=q<0=g=x$K$h$k%0%l%V%J4pDl$r7W;;$9$k(B. +@code{tolexm()} は FGLM 法による基底変換により @var{vlist2}, +辞書式順序によるグレブナ基底を計算する. +\E +\BEG +@item +An input @var{plist} must be a Groebner basis modulo @var{mod} +with respect to the variable order @var{vlist1} and the order type @var{order}. +@item +@code{minipolym()} executes the same computation as in @code{minipoly}. +@item +@code{tolexm()} computes a lex order Groebner basis modulo @var{mod} +with respect to the variable order @var{vlist2}, by using FGLM algorithm. +\E @end itemize @example @@ -948,195 +2214,611 @@ z^32+11405*z^31+20868*z^30+21602*z^29+... @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{lex_hensel lex_tl tolex tolex_d tolex_tl}, @fref{gr_minipoly minipoly}. @end table -@node dp_gr_main dp_gr_mod_main,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B -@subsection @code{dp_gr_main}, @code{dp_gr_mod_main} +\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,,, グレブナ基底に関する函数 +\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 +@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} @findex dp_gr_main @findex dp_gr_mod_main +@findex dp_gr_f_main +@findex dp_weyl_gr_main +@findex dp_weyl_gr_mod_main +@findex dp_weyl_gr_f_main @table @t @item dp_gr_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order}) @itemx dp_gr_mod_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order}) -:: $B%0%l%V%J4pDl$N7W;;(B ($BAH$_9~$_H!?t(B) +@itemx dp_gr_f_main(@var{plist},@var{vlist},@var{homo},@var{order}) +@itemx dp_weyl_gr_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order}) +@itemx dp_weyl_gr_mod_main(@var{plist},@var{vlist},@var{homo},@var{modular},@var{order}) +@itemx dp_weyl_gr_f_main(@var{plist},@var{vlist},@var{homo},@var{order}) +\JP :: グレブナ基底の計算 (組み込み函数) +\EG :: Groebner basis computation (built-in functions) @end table @table @var @item return -$B%j%9%H(B -@item plist, vlist -$B%j%9%H(B +\JP リスト +\EG list +@item plist vlist +\JP リスト +\EG list @item order -$B?t(B, $B%j%9%H$^$?$O9TNs(B +\JP 数, リストまたは行列 +\EG number, list or matrix @item homo -$B%U%i%0(B +\JP フラグ +\EG flag @item modular -$B%U%i%0$^$?$OAG?t(B +\JP フラグまたは素数 +\EG flag or prime @end table @itemize @bullet +\BJP @item -$B$3$l$i$NH!?t$O(B, $B%0%l%V%J4pDl7W;;$N4pK\E*AH$_9~$_H!?t$G$"$j(B, @code{gr()}, -@code{hgr()}, @code{gr_mod()} $B$J$I$O$9$Y$F$3$l$i$NH!?t$r8F$S=P$7$F7W;;(B -$B$r9T$C$F$$$k(B. +これらの函数は, グレブナ基底計算の基本的組み込み函数であり, @code{gr()}, +@code{hgr()}, @code{gr_mod()} などはすべてこれらの函数を呼び出して計算 +を行っている. 関数名に weyl が入っているものは, Weyl 代数上の計算 +のための関数である. @item -$B%U%i%0(B @var{homo} $B$,(B 0 $B$G$J$$;~(B, $BF~NO$r@Fe(B -$B$G$N7W;;$r0UL#$9$k(B. -@code{dp_gr_main()} $B$KBP$7$F$O(B, @var{modular} $B$Oe$N<+A3?t$N;~(B, $B$=$NCM$rAG?t$H$_$J$7$F(B trace-lifting -$B$r9T$&(B. $B$=$NAG?t$G<:GT$7$?>l9g(B, 0 $B$rJV$9(B. +@var{modular} が 2 以上の自然数の時, その値を素数とみなして trace-lifting +を行う. その素数で失敗した場合, 0 を返す. @item -@var{modular} $B$,Ii$N>l9g(B, -@var{-modular} $B$KBP$7$F>e=R$N5,B'$,E,MQ$5$l$k$,(B, trace-lifting $B$N:G=*(B -$BCJ3,$N%0%l%V%J4pDl%A%'%C%/$H%$%G%"%k%a%s%P%7%C%W%A%'%C%/$,>JN,$5$l$k(B. +@var{modular} が負の場合, +@var{-modular} に対して上述の規則が適用されるが, trace-lifting の最終 +段階のグレブナ基底チェックとイデアルメンバシップチェックが省略される. @end enumerate @item -@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 -@code{dp_gr_main(P,V,1,1,O)}, @code{gr_mod(P,V,O,M)} $B$O(B -@code{dp_gr_mod_main(P,V,0,M,O)} $B$r$=$l$>$l$K(B, @code{dp_gr_flags()} $B$G@_Dj$5$l$k(B -$B$5$^$6$^$J%U%i%0$K$h$j7W;;$,@)8f$5$l$k(B. +@var{homo}, @var{modular} の他に, @code{dp_gr_flags()} で設定される +さまざまなフラグにより計算が制御される. +\E +\BEG +@item +These functions are fundamental built-in functions for Groebner basis +computation and @code{gr()},@code{hgr()} and @code{gr_mod()} +are all interfaces to these functions. Functions whose names +contain weyl are those for computation in Weyl algebra. +@item +@code{dp_gr_f_main()} and @code{dp_weyl_gr_f_main()} +are functions for Groebner basis computation +over various finite fields. Coefficients of input polynomials +must be converted to elements of a finite field +currently specified by @code{setmod_ff()}. +@item +If @var{homo} is not equal to 0, homogenization is applied before entering +Buchberger algorithm +@item +For @code{dp_gr_mod_main()}, @var{modular} means a computation over +GF(@var{modular}). +For @code{dp_gr_main()}, @var{modular} has the following mean. +@enumerate +@item +If @var{modular} is 1 , trace lifting is used. Primes for trace lifting +are generated by @code{lprime()}, starting from @code{lprime(0)}, until +the computation succeeds. +@item +If @var{modular} is an integer greater than 1, the integer is regarded as a +prime and trace lifting is executed by using the prime. If the computation +fails then 0 is returned. +@item +If @var{modular} is negative, the above rule is applied for @var{-modular} +but the Groebner basis check and ideal-membership check are omitted in +the last stage of trace lifting. +@end enumerate + +@item +@code{gr(P,V,O)}, @code{hgr(P,V,O)} and @code{gr_mod(P,V,O,M)} execute +@code{dp_gr_main(P,V,0,1,O)}, @code{dp_gr_main(P,V,1,1,O)} +and @code{dp_gr_mod_main(P,V,0,M,O)} respectively. +@item +Actual computation is controlled by various parameters set by +@code{dp_gr_flags()}, other then by @var{homo} and @var{modular}. +\E @end itemize @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{dp_ord}, @fref{dp_gr_flags dp_gr_print}, @fref{gr hgr gr_mod}, -@fref{$B7W;;$*$h$SI=<($N@)8f(B}. +@fref{setmod_ff}, +\JP @fref{計算および表示の制御}. +\EG @fref{Controlling Groebner basis computations} @end table -@node dp_f4_main dp_f4_mod_main,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B -@subsection @code{dp_f4_main}, @code{dp_f4_mod_main} +\JP @node dp_f4_main dp_f4_mod_main dp_weyl_f4_main dp_weyl_f4_mod_main,,, グレブナ基底に関する函数 +\EG @node dp_f4_main dp_f4_mod_main dp_weyl_f4_main dp_weyl_f4_mod_main,,, Functions for Groebner basis computation +@subsection @code{dp_f4_main}, @code{dp_f4_mod_main}, @code{dp_weyl_f4_main}, @code{dp_weyl_f4_mod_main} @findex dp_f4_main @findex dp_f4_mod_main +@findex dp_weyl_f4_main +@findex dp_weyl_f4_mod_main @table @t @item dp_f4_main(@var{plist},@var{vlist},@var{order}) @itemx dp_f4_mod_main(@var{plist},@var{vlist},@var{order}) -:: F4 $B%"%k%4%j%:%`$K$h$k%0%l%V%J4pDl$N7W;;(B ($BAH$_9~$_H!?t(B) +@itemx dp_weyl_f4_main(@var{plist},@var{vlist},@var{order}) +@itemx dp_weyl_f4_mod_main(@var{plist},@var{vlist},@var{order}) +\JP :: F4 アルゴリズムによるグレブナ基底の計算 (組み込み函数) +\EG :: Groebner basis computation by F4 algorithm (built-in functions) @end table @table @var @item return -$B%j%9%H(B -@item plist, vlist -$B%j%9%H(B +\JP リスト +\EG list +@item plist vlist +\JP リスト +\EG list @item order -$B?t(B, $B%j%9%H$^$?$O9TNs(B +\JP 数, リストまたは行列 +\EG number, list or matrix @end table @itemize @bullet +\BJP @item -F4 $B%"%k%4%j%:%`$K$h$j%0%l%V%J4pDl$N7W;;$r9T$&(B. +F4 アルゴリズムによりグレブナ基底の計算を行う. @item -F4 $B%"%k%4%j%:%`$O(B, J.C. Faugere $B$K$h$jDs>'$5$l$??7@$Be%0%l%V%J4pDl(B -$B;;K!$G$"$j(B, $BK\jM>DjM}$K$h$k@~7AJ}Dx<05a2r$rMQ$$$?(B -$B;n83E*$J$l(B @code{dp_gr_main()}, @code{dp_gr_mod_main()} -$B$HF1MM$G$"$k(B. +斉次化の引数がないことを除けば, 引数および動作はそれぞれ +@code{dp_gr_main()}, @code{dp_gr_mod_main()}, +@code{dp_weyl_gr_main()}, @code{dp_weyl_gr_mod_main()} +と同様である. +\E +\BEG +@item +These functions compute Groebner bases by F4 algorithm. +@item +F4 is a new generation algorithm for Groebner basis computation +invented by J.C. Faugere. The current implementation of @code{dp_f4_main()} +uses Chinese Remainder theorem and not highly optimized. +@item +Arguments and actions are the same as those of +@code{dp_gr_main()}, @code{dp_gr_mod_main()}, +@code{dp_weyl_gr_main()}, @code{dp_weyl_gr_mod_main()}, +except for lack of the argument for controlling homogenization. +\E @end itemize @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{dp_ord}, @fref{dp_gr_flags dp_gr_print}, @fref{gr hgr gr_mod}, -@fref{$B7W;;$*$h$SI=<($N@)8f(B}. +\JP @fref{計算および表示の制御}. +\EG @fref{Controlling Groebner basis computations} @end table -@node dp_gr_flags dp_gr_print,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace,,, グレブナ基底に関する函数 +\EG @node nd_gr nd_gr_trace nd_f4 nd_f4_trace nd_weyl_gr nd_weyl_gr_trace,,, Functions for Groebner basis computation +@subsection @code{nd_gr}, @code{nd_gr_trace}, @code{nd_f4}, @code{nd_f4_trace}, @code{nd_weyl_gr}, @code{nd_weyl_gr_trace} +@findex nd_gr +@findex nd_gr_trace +@findex nd_f4 +@findex nd_f4_trace +@findex nd_weyl_gr +@findex nd_weyl_gr_trace + +@table @t +@item nd_gr(@var{plist},@var{vlist},@var{p},@var{order}[|@var{option=value,...}]) +@itemx nd_gr_trace(@var{plist},@var{vlist},@var{homo},@var{p},@var{order}[|@var{option=value,...}]) +@itemx nd_f4(@var{plist},@var{vlist},@var{modular},@var{order}[|@var{option=value,...}]) +@itemx nd_f4_trace(@var{plist},@var{vlist},@var{homo},@var{p},@var{order}[|@var{option=value,...}]) +@itemx nd_weyl_gr(@var{plist},@var{vlist},@var{p},@var{order}[|@var{option=value,...}]) +@itemx nd_weyl_gr_trace(@var{plist},@var{vlist},@var{homo},@var{p},@var{order}[|@var{option=value,...}]) +\JP :: グレブナ基底の計算 (組み込み函数) +\EG :: Groebner basis computation (built-in functions) +@end table + +@table @var +@item return +\JP リスト +\EG list +@item plist vlist +\JP リスト +\EG list +@item order +\JP 数, リストまたは行列 +\EG number, list or matrix +@item homo +\JP フラグ +\EG flag +@item modular +\JP フラグまたは素数 +\EG flag or prime +@end table + +\BJP +@itemize @bullet +@item +これらの函数は, グレブナ基底計算組み込み関数の新実装である. +@item @code{nd_gr} は, @code{p} が 0 のとき有理数体上の Buchberger +アルゴリズムを実行する. @code{p} が 2 以上の自然数のとき, GF(p) 上の +Buchberger アルゴリズムを実行する. +@item @code{nd_gr_trace} および @code{nd_f4_trace} +は有理数体上で trace アルゴリズムを実行する. +@var{p} が 0 または 1 のとき, 自動的に選ばれた素数を用いて, 成功する +まで trace アルゴリズムを実行する. +@var{p} が 2 以上のとき, trace はGF(p) 上で計算される. trace アルゴリズム +が失敗した場合 0 が返される. @var{p} が負の場合, グレブナ基底チェックは +行わない. この場合, @var{p} が -1 ならば自動的に選ばれた素数が, +それ以外は指定された素数を用いてグレブナ基底候補の計算が行われる. +@code{nd_f4_trace} は, 各全次数について, ある有限体上で F4 アルゴリズム +で行った結果をもとに, その有限体上で 0 でない基底を与える S-多項式のみを +用いて行列生成を行い, その全次数における基底を生成する方法である. 得られる +多項式集合はやはりグレブナ基底候補であり, @code{nd_gr_trace} と同様の +チェックが行われる. +@item +@code{nd_f4} は @code{modular} が 0 のとき有理数体上の, @code{modular} が +マシンサイズ素数のとき有限体上の F4 アルゴリズムを実行する. +@item +@var{plist} が多項式リストの場合, @var{plist}で生成されるイデアルのグレブナー基底が +計算される. @var{plist} が多項式リストのリストの場合, 各要素は多項式環上の自由加群の元と見なされ, +これらが生成する部分加群のグレブナー基底が計算される. 後者の場合, 項順序は加群に対する項順序を +指定する必要がある. これは @var{[s,ord]} の形で指定する. @var{s} が 0 ならば TOP (Term Over Position), +1 ならば POT (Position Over Term) を意味し, @var{ord} は多項式環の単項式に対する項順序である. +@item +@code{nd_weyl_gr}, @code{nd_weyl_gr_trace} は Weyl 代数用である. +@item +@code{f4} 系関数以外はすべて有理関数係数の計算が可能である. +@item +一般に @code{dp_gr_main}, @code{dp_gr_mod_main} より高速であるが, +特に有限体上の場合顕著である. +@item +以下のオプションが指定できる. +@table @code +@item homo +1 のとき, 斉次化を経由して計算する. (@code{nd_gr}, @code{nd_f4} のみ) +@item dp +1 のとき, 分散表現多項式 (加群の場合には加群多項式) を結果として返す. +@item nora +1 のとき, 結果の相互簡約を行わない. +@end table +@end itemize +\E + +\BEG +@itemize @bullet +@item +These functions are new implementations for computing Groebner bases. +@item @code{nd_gr} executes Buchberger algorithm over the rationals +if @code{p} is 0, and that over GF(p) if @code{p} is a prime. +@item @code{nd_gr_trace} executes the trace algorithm over the rationals. +If @code{p} is 0 or 1, the trace algorithm is executed until it succeeds +by using automatically chosen primes. +If @code{p} a positive prime, +the trace is comuted over GF(p). +If the trace algorithm fails 0 is returned. +If @code{p} is negative, +the Groebner basis check and ideal-membership check are omitted. +In this case, an automatically chosen prime if @code{p} is 1, +otherwise the specified prime is used to compute a Groebner basis +candidate. +Execution of @code{nd_f4_trace} is done as follows: +For each total degree, an F4-reduction of S-polynomials over a finite field +is done, and S-polynomials which give non-zero basis elements are gathered. +Then F4-reduction over Q is done for the gathered S-polynomials. +The obtained polynomial set is a Groebner basis candidate and the same +check procedure as in the case of @code{nd_gr_trace} is done. +@item +@code{nd_f4} executes F4 algorithm over Q if @code{modular} is equal to 0, +or over a finite field GF(@code{modular}) +if @code{modular} is a prime number of machine size (<2^29). +If @var{plist} is a list of polynomials, then a Groebner basis of the ideal generated by @var{plist} +is computed. If @var{plist} is a list of lists of polynomials, then each list of polynomials are regarded +as an element of a free module over a polynomial ring and a Groebner basis of the sub-module generated by @var{plist} +in the free module. In the latter case a term order in the free module should be specified. +This is specified by @var{[s,ord]}. If @var{s} is 0 then it means TOP (Term Over Position). +If @var{s} is 1 then it means POT 1 (Position Over Term). @var{ord} is a term order in the base polynomial ring. +@item +@code{nd_weyl_gr}, @code{nd_weyl_gr_trace} are for Weyl algebra computation. +@item +Functions except for F4 related ones can handle rational coeffient cases. +@item +In general these functions are more efficient than +@code{dp_gr_main}, @code{dp_gr_mod_main}, especially over finite fields. +@item +The fallowing options can be specified. +@table @code +@item homo +If set to 1, the computation is done via homogenization. (only for @code{nd_gr} and @code{nd_f4}) +@item dp +If set to 1, the functions return a list of distributed polynomials (a list of +module polynomials when the input is a sub-module). +@item nora +If set to 1, the inter-reduction is not performed. +@end table +@end itemize +\E + +@example +[38] load("cyclic")$ +[49] C=cyclic(7)$ +[50] V=vars(C)$ +[51] cputime(1)$ +[52] dp_gr_mod_main(C,V,0,31991,0)$ +26.06sec + gc : 0.313sec(26.4sec) +[53] nd_gr(C,V,31991,0)$ +ndv_alloc=1477188 +5.737sec + gc : 0.1837sec(5.921sec) +[54] dp_f4_mod_main(C,V,31991,0)$ +3.51sec + gc : 0.7109sec(4.221sec) +[55] nd_f4(C,V,31991,0)$ +1.906sec + gc : 0.126sec(2.032sec) +@end example + +@table @t +\JP @item 参照 +\EG @item References +@fref{dp_ord}, +@fref{dp_gr_flags dp_gr_print}, +\JP @fref{計算および表示の制御}. +\EG @fref{Controlling Groebner basis computations} +@end table + +\JP @node nd_gr_postproc nd_weyl_gr_postproc,,, グレブナ基底に関する函数 +\EG @node nd_gr_postproc nd_weyl_gr_postproc,,, Functions for Groebner basis computation +@subsection @code{nd_gr_postproc}, @code{nd_weyl_gr_postproc} +@findex nd_gr_postproc +@findex nd_weyl_gr_postproc + +@table @t +@item nd_gr_postproc(@var{plist},@var{vlist},@var{p},@var{order},@var{check}) +@itemx nd_weyl_gr_postproc(@var{plist},@var{vlist},@var{p},@var{order},@var{check}) +\JP :: グレブナ基底候補のチェックおよび相互簡約 +\EG :: Check of Groebner basis candidate and inter-reduction +@end table + +@table @var +@item return +\JP リスト または 0 +\EG list or 0 +@item plist vlist +\JP リスト +\EG list +@item p +\JP 素数または 0 +\EG prime or 0 +@item order +\JP 数, リストまたは行列 +\EG number, list or matrix +@item check +\JP 0 または 1 +\EG 0 or 1 +@end table + +@itemize @bullet +\BJP +@item +グレブナ基底(候補)の相互簡約を行う. +@item +@code{nd_weyl_gr_postproc} は Weyl 代数用である. +@item +@var{check=1} の場合, @var{plist} が, @var{vlist}, @var{p}, @var{order} で指定される多項式環, 項順序でグレブナー基底になっているか +のチェックも行う. +@item +斉次化して計算したグレブナー基底を非斉次化したものを相互簡約を行う, CRT で計算したグレブナー基底候補のチェックを行うなどの場合に用いる. +\E +\BEG +@item +Perform the inter-reduction for a Groebner basis (candidate). +@item +@code{nd_weyl_gr_postproc} is for Weyl algebra. +@item +If @var{check=1} then the check whether @var{plist} is a Groebner basis with respect to a term order in a polynomial ring +or Weyl algebra specified by @var{vlist}, @var{p} and @var{order}. +@item +This function is used for inter-reduction of a non-reduced Groebner basis that is obtained by dehomogenizing a Groebner basis +computed via homogenization, or Groebner basis check of a Groebner basis candidate computed by CRT. +\E +@end itemize + +@example +afo +@end example + +\JP @node dp_gr_flags dp_gr_print,,, グレブナ基底に関する函数 +\EG @node dp_gr_flags dp_gr_print,,, Functions for Groebner basis computation @subsection @code{dp_gr_flags}, @code{dp_gr_print} @findex dp_gr_flags @findex dp_gr_print @table @t @item dp_gr_flags([@var{list}]) -@itemx dp_gr_print([@var{0|1}]) -:: $B7W;;$*$h$SI=<(MQ%Q%i%a%?$N@_Dj(B, $B;2>H(B +@itemx dp_gr_print([@var{i}]) +\JP :: 計算および表示用パラメタの設定, 参照 +\BEG :: Set and show various parameters for cotrolling computations +and showing informations. +\E @end table @table @var @item return -$B@_DjCM(B +\JP 設定値 +\EG value currently set @item list -$B%j%9%H(B +\JP リスト +\EG list +@item i +\JP 整数 +\EG integer @end table @itemize @bullet +\BJP @item -@code{dp_gr_main()}, @code{dp_gr_mod_main()} $BH$9$k(B. +@code{dp_gr_main()}, @code{dp_gr_mod_main()}, @code{dp_gr_f_main()} 実行時におけるさまざま +なパラメタを設定, 参照する. @item -$B0z?t$,$J$$>l9g(B, $B8=:_$N@_Dj$,JV$5$l$k(B. +引数がない場合, 現在の設定が返される. @item -$B0z?t$O(B, @code{["Print",1,"NoSugar",1,...]} $B$J$k7A$N%j%9%H$G(B, $B:8$+$i=g$K(B -$B@_Dj$5$l$k(B. $B%Q%i%a%?L>$OJ8;zNs$GM?$($kI,MW$,$"$k(B. +引数は, @code{["Print",1,"NoSugar",1,...]} なる形のリストで, 左から順に +設定される. パラメタ名は文字列で与える必要がある. @item -@code{dp_gr_print()} $B$O(B, $BFC$K%Q%i%a%?(B @code{Print} $B$NCM$rD>@\@_Dj(B, $B;2>H(B -$B$G$-$k(B. $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 -$BH!?t$K$*$$$F(B, @code{Print} $B$NCM$r8+$F(B, $B$=$N%5%V%k!<%A%s$,Cf4V>pJs$NI=<((B -$B$r9T$&:]$K(B, $B?WB.$K%U%i%0$r8+$k$3$H$,$G$-$k$h$&$KMQ0U$5$l$F$$$k(B. +@code{dp_gr_print()} は, 特にパラメタ @code{Print}, @code{PrintShort} の値を直接設定, 参照 +できる. 設定される値は次の通りである。 +@table @var +@item i=0 +@code{Print=0}, @code{PrintShort=0} +@item i=1 +@code{Print=1}, @code{PrintShort=0} +@item i=2 +@code{Print=0}, @code{PrintShort=1} +@end table +これは, @code{dp_gr_main()} などをサブルーチンとして用いるユーザ +函数において, そのサブルーチンが中間情報の表示 +を行う際に, 迅速にフラグを見ることができるように用意されている. +\E +\BEG +@item +@code{dp_gr_flags()} sets and shows various parameters for Groebner basis + computation. +@item +If no argument is specified the current settings are returned. +@item +Arguments must be specified as a list such as + @code{["Print",1,"NoSugar",1,...]}. Names of parameters must be character +strings. +@item +@code{dp_gr_print()} is used to set and show the value of a parameter +@code{Print} and @code{PrintShort}. +@table @var +@item i=0 +@code{Print=0}, @code{PrintShort=0} +@item i=1 +@code{Print=1}, @code{PrintShort=0} +@item i=2 +@code{Print=0}, @code{PrintShort=1} +@end table +This functions is prepared to get quickly the value +when a user defined function calling @code{dp_gr_main()} etc. +uses the value as a flag for showing intermediate informations. +\E @end itemize @table @t -@item $B;2>H(B -@fref{$B7W;;$*$h$SI=<($N@)8f(B} +\JP @item 参照 +\EG @item References +\JP @fref{計算および表示の制御} +\EG @fref{Controlling Groebner basis computations} @end table -@node dp_ord,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_ord,,, グレブナ基底に関する函数 +\EG @node dp_ord,,, Functions for Groebner basis computation @subsection @code{dp_ord} @findex dp_ord @table @t @item dp_ord([@var{order}]) -:: $BJQ?t=g=x7?$N@_Dj(B, $B;2>H(B +\JP :: 変数順序型の設定, 参照 +\EG :: Set and show the ordering type. @end table @table @var @item return -$BJQ?t=g=x7?(B ($B?t(B, $B%j%9%H$^$?$O9TNs(B) +\JP 変数順序型 (数, リストまたは行列) +\EG ordering type (number, list or matrix) @item order -$B?t(B, $B%j%9%H$^$?$O9TNs(B +\JP 数, リストまたは行列 +\EG number, list or matrix @end table @itemize @bullet +\BJP @item -$B0z?t$,$"$k;~(B, $BJQ?t=g=x7?$r(B @var{order} $B$K@_Dj$9$k(B. $B0z?t$,$J$$;~(B, -$B8=:_@_Dj$5$l$F$$$kJQ?t=g=x7?$rJV$9(B. +引数がある時, 変数順序型を @var{order} に設定する. 引数がない時, +現在設定されている変数順序型を返す. @item -$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 -$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 -$B9T$o$l$k(B. +分散表現多項式に関する函数, 演算は引数として変数順序型をとるものととらないもの +があり, とらないものに関しては, その時点で設定されている値を用いて計算が +行われる. @item -@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()} -$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. +@code{gr()} など, 引数として変数順序型をとるものは, 内部で @code{dp_ord()} +を呼び出し, 変数順序型を設定する. この設定は, 計算終了後も生き残る. @item -$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, -$B$=$NB?9`<0$,@8@.$5$l$?;~E@$K$*$1$kJQ?t=g=x7?$,(B, $B;MB'1i;;;~$K@5$7$/@_Dj(B -$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 -$B7?$K4p$E$$$F@8@.$5$l$?$b$N$G$J$1$l$P$J$i$J$$(B. +分散表現多項式の四則演算も, 設定されている値を用いて計算される. 従って, +その多項式が生成された時点における変数順序型が, 四則演算時に正しく設定 +されていなければならない. また, 演算対象となる多項式は, 同一の変数順序 +型に基づいて生成されたものでなければならない. @item -$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 -$BJQ?t=g=x7?$r@5$7$/@_Dj$7$J$1$l$P$J$i$J$$(B. +トップレベル函数以外の函数を直接呼び出す場合には, この函数により +変数順序型を正しく設定しなければならない. + +@item +引数がリストの場合, 自由加群における項順序型を設定する. 引数が@code{[0,Ord]} の場合, +多項式環上で @code{Ord} で指定される項順序に基づく TOP 順序, 引数が @code{[1,Ord]} の場合 +OPT 順序を設定する. + +\E +\BEG +@item +If an argument is specified, the function +sets the current ordering type to @var{order}. +If no argument is specified, the function returns the ordering +type currently set. + +@item +There are two types of functions concerning distributed polynomial, +functions which take a ordering type and those which don't take it. +The latter ones use the current setting. + +@item +Functions such as @code{gr()}, which need a ordering type as an argument, +call @code{dp_ord()} internally during the execution. +The setting remains after the execution. + +Fundamental arithmetics for distributed polynomial also use the current +setting. Therefore, when such arithmetics for distributed polynomials +are done, the current setting must coincide with the ordering type +which was used upon the creation of the polynomials. It is assumed +that such polynomials were generated under the same ordering type. + +@item +Type of term ordering must be correctly set by this function +when functions other than top level functions are called directly. + +@item +If the argument is a list, then an ordering type in a free module is set. +If the argument is @code{[0,Ord]} then a TOP ordering based on the ordering type specified +by @code{Ord} is set. +If the argument is @code{[1,Ord]} then a POT ordering is set. +\E @end itemize @example @@ -1149,33 +2831,124 @@ F4 $B%"%k%4%j%:%`$O(B, J.C. Faugere $B$K$h$jDs>'$5$ @end example @table @t -@item $B;2>H(B -@fref{$B9`=g=x$N@_Dj(B} +\JP @item 参照 +\EG @item References +\JP @fref{項順序の設定} +\EG @fref{Setting term orderings} @end table -@node dp_ptod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_set_weight dp_set_top_weight dp_weyl_set_weight,,, グレブナ基底に関する函数 +\EG @node dp_set_weight dp_set_top_weight dp_weyl_set_weight,,, Functions for Groebner basis computation +@subsection @code{dp_set_weight}, @code{dp_set_top_weight}, @code{dp_weyl_set_weight} +@findex dp_set_weight +@findex dp_set_top_weight +@findex dp_weyl_set_weight + +@table @t +@item dp_set_weight([@var{weight}]) +\JP :: sugar weight の設定, 参照 +\EG :: Set and show the sugar weight. +@item dp_set_top_weight([@var{weight}]) +\JP :: top weight の設定, 参照 +\EG :: Set and show the top weight. +@item dp_weyl_set_weight([@var{weight}]) +\JP :: weyl weight の設定, 参照 +\EG :: Set and show the weyl weight. +@end table + +@table @var +@item return +\JP ベクトル +\EG a vector +@item weight +\JP 整数のリストまたはベクトル +\EG a list or vector of integers +@end table + +@itemize @bullet +\BJP +@item +@code{dp_set_weight} は sugar weight を @var{weight} に設定する. 引数がない時, +現在設定されている sugar weight を返す. sugar weight は正整数を成分とするベクトルで, +各変数の重みを表す. 次数つき順序において, 単項式の次数を計算する際に用いられる. +斉次化変数用に, 末尾に 1 を付け加えておくと安全である. +@item +@code{dp_set_top_weight} は top weight を @var{weight} に設定する. 引数がない時, +現在設定されている top weight を返す. top weight が設定されているとき, +まず top weight による単項式比較を先に行う. tie breaker として現在設定されている +項順序が用いられるが, この比較には top weight は用いられない. + +@item +@code{dp_weyl_set_weight} は weyl weight を @var{weight} に設定する. 引数がない時, +現在設定されている weyl weight を返す. weyl weight w を設定すると, +項順序型 11 での計算において, (-w,w) を top weight, tie breaker を graded reverse lex +とした項順序が設定される. +\E +\BEG +@item +@code{dp_set_weight} sets the sugar weight=@var{weight}. It returns the current sugar weight. +A sugar weight is a vector with positive integer components and it represents the weights of variables. +It is used for computing the weight of a monomial in a graded ordering. +It is recommended to append a component 1 at the end of the weight vector for a homogenizing variable. +@item +@code{dp_set_top_weight} sets the top weight=@var{weight}. It returns the current top weight. +It a top weight is set, the weights of monomials under the top weight are firstly compared. +If the the weights are equal then the current term ordering is applied as a tie breaker, but +the top weight is not used in the tie breaker. + +@item +@code{dp_weyl_set_weight} sets the weyl weigh=@var{weight}. It returns the current weyl weight. +If a weyl weight w is set, in the comparsion by the term order type 11, a term order with +the top weight=(-w,w) and the tie breaker=graded reverse lex is applied. +\E +@end itemize + +@table @t +\JP @item 参照 +\EG @item References +@fref{Weight} +@end table + + +\JP @node dp_ptod,,, グレブナ基底に関する函数 +\EG @node dp_ptod,,, Functions for Groebner basis computation @subsection @code{dp_ptod} @findex dp_ptod @table @t @item dp_ptod(@var{poly},@var{vlist}) -:: $BB?9`<0$rJ,;6I=8=B?9`<0$KJQ49$9$k(B. +\JP :: 多項式を分散表現多項式に変換する. +\EG :: Converts an ordinary polynomial into a distributed polynomial. @end table @table @var @item return -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial @item poly -$BB?9`<0(B +\JP 多項式 +\EG polynomial @item vlist -$B%j%9%H(B +\JP リスト +\EG list @end table @itemize @bullet +\BJP @item -$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. +変数順序 @var{vlist} および現在の変数順序型に従って分散表現多項式に変換する. @item -@var{vlist} $B$K4^$^$l$J$$ITDj85$O(B, $B78?tBN$KB0$9$k$H$7$FJQ49$5$l$k(B. +@var{vlist} に含まれない不定元は, 係数体に属するとして変換される. +\E +\BEG +@item +According to the variable ordering @var{vlist} and current +type of term ordering, this function converts an ordinary +polynomial into a distributed polynomial. +@item +Indeterminates not included in @var{vlist} are regarded to belong to +the coefficient field. +\E @end itemize @example @@ -1185,128 +2958,365 @@ F4 $B%"%k%4%j%:%`$O(B, J.C. Faugere $B$K$h$jDs>'$5$ (1)*<<2,0,0>>+(2)*<<1,1,0>>+(1)*<<0,2,0>>+(2)*<<1,0,1>>+(2)*<<0,1,1>> +(1)*<<0,0,2>> [52] dp_ptod((x+y+z)^2,[x,y]); -(1)*<<2,0>>+(2)*<<1,1>>+(1)*<<0,2>>+(2*z)*<<1,0>>+(2*z)*<<0,1>>+(z^2)*<<0,0>> +(1)*<<2,0>>+(2)*<<1,1>>+(1)*<<0,2>>+(2*z)*<<1,0>>+(2*z)*<<0,1>> ++(z^2)*<<0,0>> @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{dp_dtop}, @fref{dp_ord}. @end table -@node dp_dtop,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dpm_dptodpm,,, グレブナ基底に関する函数 +\EG @node dpm_dptodpm,,, Functions for Groebner basis computation +@subsection @code{dpm_dptodpm} +@findex dpm_dptodpm + +@table @t +@item dpm_dptodpm(@var{dpoly},@var{pos}) +\JP :: 分散表現多項式を加群多項式に変換する. +\EG :: Converts a distributed polynomial into a module polynomial. +@end table + +@table @var +@item return +\JP 加群多項式 +\EG module polynomial +@item dpoly +\JP 分散表現多項式 +\EG distributed polynomial +@item pos +\JP 正整数 +\EG positive integer +@end table + +@itemize @bullet +\BJP +@item +分散表現多項式を加群多項式に変換する. +@item +出力は加群多項式 @code{dpoly e_pos} である. +\E +\BEG +@item +This function converts a distributed polynomial into a module polynomial. +@item +The output is @code{dpoly e_pos}. +\E +@end itemize + +@example +[50] dp_ord([0,0])$ +[51] D=dp_ptod((x+y+z)^2,[x,y,z]); +(1)*<<2,0,0>>+(2)*<<1,1,0>>+(1)*<<0,2,0>>+(2)*<<1,0,1>>+(2)*<<0,1,1>> ++(1)*<<0,0,2>> +[52] dp_dptodpm(D,2); +(1)*<<2,0,0:2>>+(2)*<<1,1,0:2>>+(1)*<<0,2,0:2>>+(2)*<<1,0,1:2>> ++(2)*<<0,1,1:2>>+(1)*<<0,0,2:2>> +@end example + +@table @t +\JP @item 参照 +\EG @item References +@fref{dp_ptod}, +@fref{dp_ord}. +@end table + +\JP @node dpm_ltod,,, グレブナ基底に関する函数 +\EG @node dpm_ltod,,, Functions for Groebner basis computation +@subsection @code{dpm_ltod} +@findex dpm_ltod + +@table @t +@item dpm_dptodpm(@var{plist},@var{vlist}) +\JP :: 多項式リストを加群多項式に変換する. +\EG :: Converts a list of polynomials into a module polynomial. +@end table + +@table @var +@item return +\JP 加群多項式 +\EG module polynomial +@item plist +\JP 多項式リスト +\EG list of polynomials +@item vlist +\JP 変数リスト +\EG list of variables +@end table + +@itemize @bullet +\BJP +@item +多項式リストを加群多項式に変換する. +@item +@code{[p1,...,pm]} は @code{p1 e1+...+pm em} に変換される. +\E +\BEG +@item +This function converts a list of polynomials into a module polynomial. +@item +@code{[p1,...,pm]} is converted into @code{p1 e1+...+pm em}. +\E +@end itemize + +@example +[2126] dp_ord([0,0])$ +[2127] dpm_ltod([x^2+y^2,x,y-z],[x,y,z]); +(1)*<<2,0,0:1>>+(1)*<<0,2,0:1>>+(1)*<<1,0,0:2>>+(1)*<<0,1,0:3>> ++(-1)*<<0,0,1:3>> +@end example + +@table @t +\JP @item 参照 +\EG @item References +@fref{dpm_dtol}, +@fref{dp_ord}. +@end table + +\JP @node dpm_dtol,,, グレブナ基底に関する函数 +\EG @node dpm_dtol,,, Functions for Groebner basis computation +@subsection @code{dpm_dtol} +@findex dpm_dtol + +@table @t +@item dpm_dptodpm(@var{poly},@var{vlist}) +\JP :: 加群多項式を多項式リストに変換する. +\EG :: Converts a module polynomial into a list of polynomials. +@end table + +@table @var +@item return +\JP 多項式リスト +\EG list of polynomials +@item poly +\JP 加群多項式 +\EG module polynomial +@item vlist +\JP 変数リスト +\EG list of variables +@end table + +@itemize @bullet +\BJP +@item +加群多項式を多項式リストに変換する. +@item +@code{p1 e1+...+pm em} は @code{[p1,...,pm]} に変換される. +@item +出力リストの長さは, @code{poly} に含まれる標準基底の最大インデックスとなる. +\E +\BEG +@item +This function converts a module polynomial into a list of polynomials. +@item +@code{p1 e1+...+pm em} is converted into @code{[p1,...,pm]}. +@item +The length of the output list is equal to the largest index among those of the standard bases +containd in @code{poly}. +\E +@end itemize + +@example +[2126] dp_ord([0,0])$ +[2127] D=(1)*<<2,0,0:1>>+(1)*<<0,2,0:1>>+(1)*<<1,0,0:2>>+(1)*<<0,1,0:3>> ++(-1)*<<0,0,1:3>>$ +[2128] dpm_dtol(D,[x,y,z]); +[x^2+y^2,x,y-z] +@end example + +@table @t +\JP @item 参照 +\EG @item References +@fref{dpm_ltod}, +@fref{dp_ord}. +@end table + +\JP @node dp_dtop,,, グレブナ基底に関する函数 +\EG @node dp_dtop,,, Functions for Groebner basis computation @subsection @code{dp_dtop} @findex dp_dtop @table @t @item dp_dtop(@var{dpoly},@var{vlist}) -:: $BJ,;6I=8=B?9`<0$rB?9`<0$KJQ49$9$k(B. +\JP :: 分散表現多項式を多項式に変換する. +\EG :: Converts a distributed polynomial into an ordinary polynomial. @end table @table @var @item return -$BB?9`<0(B +\JP 多項式 +\EG polynomial @item dpoly -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial @item vlist -$B%j%9%H(B +\JP リスト +\EG list @end table @itemize @bullet +\BJP @item -$BJ,;6I=8=B?9`<0$r(B, $BM?$($i$l$?ITDj85%j%9%H$rMQ$$$FB?9`<0$KJQ49$9$k(B. +分散表現多項式を, 与えられた不定元リストを用いて多項式に変換する. @item -$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. +不定元リストは, 長さ分散表現多項式の変数の個数と一致していれば何でもよい. +\E +\BEG +@item +This function converts a distributed polynomial into an ordinary polynomial +according to a list of indeterminates @var{vlist}. +@item +@var{vlist} is such a list that its length coincides with the number of +variables of @var{dpoly}. +\E @end itemize @example [53] T=dp_ptod((x+y+z)^2,[x,y]); -(1)*<<2,0>>+(2)*<<1,1>>+(1)*<<0,2>>+(2*z)*<<1,0>>+(2*z)*<<0,1>>+(z^2)*<<0,0>> +(1)*<<2,0>>+(2)*<<1,1>>+(1)*<<0,2>>+(2*z)*<<1,0>>+(2*z)*<<0,1>> ++(z^2)*<<0,0>> [54] P=dp_dtop(T,[a,b]); z^2+(2*a+2*b)*z+a^2+2*b*a+b^2 @end example -@node dp_mod dp_rat,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_mod dp_rat,,, グレブナ基底に関する函数 +\EG @node dp_mod dp_rat,,, Functions for Groebner basis computation @subsection @code{dp_mod}, @code{dp_rat} @findex dp_mod @findex dp_rat @table @t @item dp_mod(@var{p},@var{mod},@var{subst}) -:: $BM-M}?t78?tJ,;6I=8=B?9`<0$NM-8BBN78?t$X$NJQ49(B +\JP :: 有理数係数分散表現多項式の有限体係数への変換 +\EG :: Converts a disributed polynomial into one with coefficients in a finite field. @item dp_rat(@var{p}) -:: $BM-8BBN78?tJ,;6I=8=B?9`<0$NM-M}?t78?t$X$NJQ49(B +\JP :: 有限体係数分散表現多項式の有理数係数への変換 +\BEG +:: Converts a distributed polynomial with coefficients in a finite field into +one with coefficients in the rationals. +\E @end table @table @var @item return -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial @item p -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial @item mod -$BAG?t(B +\JP 素数 +\EG prime @item subst -$B%j%9%H(B +\JP リスト +\EG list @end table @itemize @bullet +\BJP @item -@code{dp_nf_mod()}, @code{dp_true_nf_mod()} $B$O(B, $BF~NO$H$7$FM-8BBN78?t$N(B -$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 -$BM-M}?t78?tJ,;6I=8=B?9`<0$rJQ49$7$FMQ$$$k$3$H$,$G$-$k(B. $B$^$?(B, $BF@$i$l$?(B -$B7k2L$O(B, $BM-8BBN78?tB?9`<0$H$O1i;;$G$-$k$,(B, $BM-M}?t78?tB?9`<0$H$O1i;;$G$-$J$$(B -$B$?$a(B, @code{dp_rat()} $B$K$h$jJQ49$9$kI,MW$,$"$k(B. +@code{dp_nf_mod()}, @code{dp_true_nf_mod()} は, 入力として有限体係数の +分散表現多項式を必要とする. このような場合, @code{dp_mod()} により +有理数係数分散表現多項式を変換して用いることができる. また, 得られた +結果は, 有限体係数多項式とは演算できるが, 有理数係数多項式とは演算できない +ため, @code{dp_rat()} により変換する必要がある. @item -$BM-8BBN78?t$N1i;;$K$*$$$F$O(B, $B$"$i$+$8$a(B @code{setmod()} $B$K$h$jM-8BBN$N85$N(B -$B8D?t$r;XDj$7$F$*$/I,MW$,$"$k(B. +有限体係数の演算においては, あらかじめ @code{setmod()} により有限体の元の +個数を指定しておく必要がある. @item -@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 -$B$7$?8eM-8BBN78?t$KJQ49$9$k$H$$$&A`:n$r9T$&:]$N(B, $BBeF~CM$r;XDj$9$k$b$N$G(B, -@code{[[@var{var},@var{value}],...]} $B$N7A$N%j%9%H$G$"$k(B. +@var{subst} は, 係数が有理式の場合, その有理式の変数にあらかじめ数を代入 +した後有限体係数に変換するという操作を行う際の, 代入値を指定するもので, +@code{[[@var{var},@var{value}],...]} の形のリストである. +\E +\BEG +@item +@code{dp_nf_mod()} and @code{dp_true_nf_mod()} require +distributed polynomials with coefficients in a finite field as arguments. +@code{dp_mod()} is used to convert distributed polynomials with rational +number coefficients into appropriate ones. +Polynomials with coefficients in a finite field +cannot be used as inputs of operations with polynomials +with rational number coefficients. @code{dp_rat()} is used for such cases. +@item +The ground finite field must be set in advance by using @code{setmod()}. +@item +@var{subst} is such a list as @code{[[@var{var},@var{value}],...]}. +This is valid when the ground field of the input polynomial is a +rational function field. @var{var}'s are variables in the ground field and +the list means that @var{value} is substituted for @var{var} before +converting the coefficients into elements of a finite field. +\E @end itemize @example @end example @table @t -@item $B;2>H(B -@fref{dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod}, +\JP @item 参照 +\EG @item References +@fref{dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod dp_weyl_nf dp_weyl_nf_mod}, @fref{subst psubst}, @fref{setmod}. @end table -@node dp_homo dp_dehomo,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_homo dp_dehomo,,, グレブナ基底に関する函数 +\EG @node dp_homo dp_dehomo,,, Functions for Groebner basis computation @subsection @code{dp_homo}, @code{dp_dehomo} @findex dp_homo @findex dp_dehomo @table @t @item dp_homo(@var{dpoly}) -:: $BJ,;6I=8=B?9`<0$N@Fl9g(B, $B$=$l$i$KE,9g$9$k9`=g=x$r(B -$B@5$7$/@_Dj$9$kI,MW$,$"$k(B. +いずれも, 生成された多項式を用いた演算を行う場合, それらに適合する項順序を +正しく設定する必要がある. @item -@code{hgr()} $B$J$I$K$*$$$F(B, $BFbItE*$KMQ$$$i$l$F$$$k(B. +@code{hgr()} などにおいて, 内部的に用いられている. +\E +\BEG +@item +@code{dp_homo()} makes a copy of @var{dpoly}, extends +the length of the exponent vector of each term @var{t} in the copy by 1, +and sets the value of the newly appended +component to @var{d}-@code{deg(@var{t})}, where @var{d} is the total +degree of @var{dpoly}. +@item +@code{dp_dehomo()} make a copy of @var{dpoly} and removes the last component +of each terms in the copy. +@item +Appropriate term orderings must be set when the results are used as inputs +of some operations. +@item +These are used internally in @code{hgr()} etc. +\E @end itemize @example @@ -1319,37 +3329,61 @@ z^2+(2*a+2*b)*z+a^2+2*b*a+b^2 @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{gr hgr gr_mod}. @end table -@node dp_ptozp dp_prim,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_ptozp dp_prim,,, グレブナ基底に関する函数 +\EG @node dp_ptozp dp_prim,,, Functions for Groebner basis computation @subsection @code{dp_ptozp}, @code{dp_prim} @findex dp_ptozp @findex dp_prim @table @t @item dp_ptozp(@var{dpoly}) -:: $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. -@itemx dp_prim(@var{dpoly}) -:: $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. +\JP :: 定数倍して係数を整数係数かつ係数の整数 GCD を 1 にする. +\BEG +:: Converts a distributed polynomial @var{poly} with rational coefficients +into an integral distributed polynomial such that GCD of all its coefficients +is 1. +\E +@item dp_prim(@var{dpoly}) +\JP :: 有理式倍して係数を整数係数多項式係数かつ係数の多項式 GCD を 1 にする. +\BEG +:: Converts a distributed polynomial @var{poly} with rational function +coefficients into an integral distributed polynomial such that polynomial +GCD of all its coefficients is 1. +\E @end table @table @var @item return -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial @item dpoly -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial @end table @itemize @bullet +\BJP @item -@code{dp_ptozp()} $B$O(B, @code{ptozp()} $B$KAjEv$9$kA`:n$rJ,;6I=8=B?9`<0$K(B -$BBP$7$F9T$&(B. $B78?t$,B?9`<0$r4^$`>l9g(B, $B78?t$K4^$^$l$kB?9`<06&DL0x;R$O(B -$Bl9g(B, $B78?t$K4^$^$l$kB?9`<06&DL0x;R(B -$B$rH(B +\JP @item 参照 +\EG @item References @fref{ptozp}. @end table -@node dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod dp_weyl_nf dp_weyl_nf_mod,,, グレブナ基底に関する函数 +\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 @subsection @code{dp_nf}, @code{dp_nf_mod}, @code{dp_true_nf}, @code{dp_true_nf_mod} @findex dp_nf @findex dp_true_nf @findex dp_nf_mod @findex dp_true_nf_mod +@findex dp_weyl_nf +@findex dp_weyl_nf_mod @table @t @item dp_nf(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce}) +@item dp_weyl_nf(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce}) @item dp_nf_mod(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce},@var{mod}) -:: $BJ,;6I=8=B?9`<0$N@55,7A$r5a$a$k(B. ($B7k2L$ODj?tG\$5$l$F$$$k2DG=@-$"$j(B) +@item dp_weyl_nf_mod(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce},@var{mod}) +\JP :: 分散表現多項式の正規形を求める. (結果は定数倍されている可能性あり) +\BEG +:: Computes the normal form of a distributed polynomial. +(The result may be multiplied by a constant in the ground field.) +\E @item dp_true_nf(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce}) @item dp_true_nf_mod(@var{indexlist},@var{dpoly},@var{dpolyarray},@var{fullreduce},@var{mod}) -:: $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) +\JP :: 分散表現多項式の正規形を求める. (真の結果を @code{[分子, 分母]} の形で返す) +\BEG +:: Computes the normal form of a distributed polynomial. (The true result +is returned in such a list as @code{[numerator, denominator]}) +\E @end table @table @var @item return -@code{dp_nf()} : $BJ,;6I=8=B?9`<0(B, @code{dp_true_nf()} : $B%j%9%H(B +\JP @code{dp_nf()} : 分散表現多項式, @code{dp_true_nf()} : リスト +\EG @code{dp_nf()} : distributed polynomial, @code{dp_true_nf()} : list @item indexlist -$B%j%9%H(B +\JP リスト +\EG list @item dpoly -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial @item dpolyarray -$BG[Ns(B +\JP 配列 +\EG array of distributed polynomial @item fullreduce -$B%U%i%0(B +\JP フラグ +\EG flag @item mod -$BAG?t(B +\JP 素数 +\EG prime @end table @itemize @bullet +\BJP @item -$BJ,;6I=8=B?9`<0(B @var{dpoly} $B$N@55,7A$r5a$a$k(B. +分散表現多項式 @var{dpoly} の正規形を求める. @item -@code{dp_nf_mod()}, @code{dp_true_nf_mod()} $B$NF~NO$O(B, @code{dp_mod()} $B$J$I(B -$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. +名前に weyl を含む関数はワイル代数における正規形計算を行う. 以下の説明は weyl を含むものに対しても同様に成立する. @item -$B7k2L$KM-M}?t(B, $BM-M}<0$,4^$^$l$k$N$rHr$1$k$?$a(B, @code{dp_nf()} $B$O(B -$B??$NCM$NDj?tG\$NCM$rJV$9(B. $BM-M}<078?t$N>l9g$N(B @code{dp_nf_mod()} $B$bF1MM(B -$B$G$"$k$,(B, $B78?tBN$,M-8BBN$N>l9g(B @code{dp_nf_mod()} $B$O??$NCM$rJV$9(B. +@code{dp_nf_mod()}, @code{dp_true_nf_mod()} の入力は, @code{dp_mod()} など +により, 有限体上の分散表現多項式になっていなければならない. @item -@code{dp_true_nf()}, @code{dp_true_nf_mod()} $B$O(B, -@code{[@var{nm},@var{dn}]} $B$J$k7A$N%j%9%H$rJV$9(B. -$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 -$B?t$^$?$OB?9`<0$G(B @var{nm}/@var{dn} $B$,??$NCM$H$J$k(B. +結果に有理数, 有理式が含まれるのを避けるため, @code{dp_nf()} は +真の値の定数倍の値を返す. 有理式係数の場合の @code{dp_nf_mod()} も同様 +であるが, 係数体が有限体の場合 @code{dp_nf_mod()} は真の値を返す. @item -@var{dpolyarray} $B$OJ,;6I=8=B?9`<0$rMWAG$H$9$k%Y%/%H%k(B, -@var{indexlist} $B$O@55,2=7W;;$KMQ$$$k(B @var{dpolyarray} $B$NMWAG$N%$%s%G%C%/%9(B -$B$N%j%9%H(B. +@code{dp_true_nf()}, @code{dp_true_nf_mod()} は, +@code{[@var{nm},@var{dn}]} なる形のリストを返す. +ただし, @var{nm} は係数に分数, 有理式を含まない分散表現多項式, @var{dn} は +数または多項式で @var{nm}/@var{dn} が真の値となる. @item -@var{fullreduce} $B$,(B 0 $B$G$J$$$H$-A4$F$N9`$KBP$7$F4JLs$r9T$&(B. @var{fullreduce} -$B$,(B 0 $B$N$H$-F,9`$N$_$KBP$7$F4JLs$r9T$&(B. +@var{dpolyarray} は分散表現多項式を要素とするベクトル, +@var{indexlist} は正規化計算に用いる @var{dpolyarray} の要素のインデックス +のリスト. @item -@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. +@var{fullreduce} が 0 でないとき全ての項に対して簡約を行う. @var{fullreduce} +が 0 のとき頭項のみに対して簡約を行う. @item -$B0lHL$K$O(B @var{indexlist} $B$NM?$(J}$K$h$jH!?t$NCM$O0[$J$k2DG=@-$,$"$k$,(B, -$B%0%l%V%J4pDl$KBP$7$F$O0l0UE*$KDj$^$k(B. +@var{indexlist} で指定された多項式は, 前の方のものが優先的に使われる. @item -$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 -$B$KJXMx$G$"$k(B. $BC10l$N1i;;$K4X$7$F$O(B, @code{p_nf}, @code{p_true_nf} $B$r(B -$BMQ$$$k$H$h$$(B. - +一般には @var{indexlist} の与え方により函数の値は異なる可能性があるが, +グレブナ基底に対しては一意的に定まる. +@item +分散表現でない固定された多項式集合による正規形を多数求める必要がある場合 +に便利である. 単一の演算に関しては, @code{p_nf}, @code{p_true_nf} を +用いるとよい. +\E +\BEG +@item +Computes the normal form of a distributed polynomial. +@item +Functions whose name contain @code{weyl} compute normal forms in Weyl algebra. The description below also applies to +the functions for Weyl algebra. +@item +@code{dp_nf_mod()} and @code{dp_true_nf_mod()} require +distributed polynomials with coefficients in a finite field as arguments. +@item +The result of @code{dp_nf()} may be multiplied by a constant in the +ground field in order to make the result integral. The same is true +for @code{dp_nf_mod()}, but it returns the true normal form if +the ground field is a finite field. +@item +@code{dp_true_nf()} and @code{dp_true_nf_mod()} return +such a list as @code{[@var{nm},@var{dn}]}. +Here @var{nm} is a distributed polynomial whose coefficients are integral +in the ground field, @var{dn} is an integral element in the ground +field and @var{nm}/@var{dn} is the true normal form. +@item +@var{dpolyarray} is a vector whose components are distributed polynomials +and @var{indexlist} is a list of indices which is used for the normal form +computation. +@item +When argument @var{fullreduce} has non-zero value, +all terms are reduced. When it has value 0, +only the head term is reduced. +@item +As for the polynomials specified by @var{indexlist}, one specified by +an index placed at the preceding position has priority to be selected. +@item +In general, the result of the function may be different depending on +@var{indexlist}. However, the result is unique for Groebner bases. +@item +These functions are useful when a fixed non-distributed polynomial set +is used as a set of reducers to compute normal forms of many polynomials. +For single computation @code{p_nf} and @code{p_true_nf} are sufficient. +\E @end itemize @example @@ -1443,28 +3539,153 @@ z^2+(2*a+2*b)*z+a^2+2*b*a+b^2 [74] DP2=newvect(length(G),map(dp_ptod,G,V))$ [75] T=dp_ptod((u0-u1+u2-u3+u4)^2,V)$ [76] dp_dtop(dp_nf([0,1,2,3,4],T,DP1,1),V); -u4^2+(6*u3+2*u2+6*u1-2)*u4+9*u3^2+(6*u2+18*u1-6)*u3+u2^2+(6*u1-2)*u2+9*u1^2-6*u1+1 +u4^2+(6*u3+2*u2+6*u1-2)*u4+9*u3^2+(6*u2+18*u1-6)*u3+u2^2 ++(6*u1-2)*u2+9*u1^2-6*u1+1 [77] dp_dtop(dp_nf([4,3,2,1,0],T,DP1,1),V); -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 [78] dp_dtop(dp_nf([0,1,2,3,4],T,DP2,1),V); --1138087976845165778088612297273078520347097001020471455633353049221045677593 -0005716505560062087150928400876150217079820311439477560587583488*u4^15+... +-11380879768451657780886122972730785203470970010204714556333530492210 +456775930005716505560062087150928400876150217079820311439477560587583 +488*u4^15+... [79] dp_dtop(dp_nf([4,3,2,1,0],T,DP2,1),V); --1138087976845165778088612297273078520347097001020471455633353049221045677593 -0005716505560062087150928400876150217079820311439477560587583488*u4^15+... +-11380879768451657780886122972730785203470970010204714556333530492210 +456775930005716505560062087150928400876150217079820311439477560587583 +488*u4^15+... [80] @@78==@@79; 1 @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{dp_dtop}, @fref{dp_ord}, @fref{dp_mod dp_rat}, @fref{p_nf p_nf_mod p_true_nf p_true_nf_mod}. @end table -@node dp_hm dp_ht dp_hc dp_rest,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dpm_nf dpm_nf_and_quotient,,, グレブナ基底に関する函数 +\EG @node dpm_nf dpm_nf_and_quotient,,, Functions for Groebner basis computation +@subsection @code{dpm_nf}, @code{dpm_nf_and_quotient} +@findex dpm_nf +@findex dpm_nf_and_quotient + +@table @t +@item dpm_nf([@var{indexlist},]@var{dpoly},@var{dpolyarray},@var{fullreduce}) +\JP :: 加群多項式の正規形を求める. (結果は定数倍されている可能性あり) + +\BEG +:: Computes the normal form of a module polynomial. +(The result may be multiplied by a constant in the ground field.) +\E +@item dpm_nf_and_quotient([@var{indexlist},]@var{dpoly},@var{dpolyarray}) +\JP :: 加群多項式の正規形と商を求める. +\BEG +:: Computes the normal form of a module polynomial and the quotient. +\E +@end table + +@table @var +@item return +\JP @code{dpm_nf()} : 加群多項式, @code{dpm_nf_and_quotient()} : リスト +\EG @code{dpm_nf()} : module polynomial, @code{dpm_nf_and_quotient()} : list +@item indexlist +\JP リスト +\EG list +@item dpoly +\JP 加群多項式 +\EG module polynomial +@item dpolyarray +\JP 配列 +\EG array of module polynomial +@end table + +@itemize @bullet +\BJP +@item +加群多項式 @var{dpoly} の正規形を求める. +@item +結果に有理数, 有理式が含まれるのを避けるため, @code{dpm_nf()} は +真の値の定数倍の値を返す. +@item +@var{dpolyarray} は加群多項式を要素とするベクトル, +@var{indexlist} は正規化計算に用いる @var{dpolyarray} の要素のインデックス +@item +@var{indexlist} が与えられている場合, @var{dpolyarray} の中で, @var{indexlist} で指定されたもののみが, 前の方から優先的に使われる. +@var{indexlist} が与えられていない場合には, @var{dpolyarray} の中の全ての多項式が前の方から優先的に使われる. +@item +@code{dpm_nf_and_quotient()} は, +@code{[@var{nm},@var{dn},@var{quo}]} なる形のリストを返す. +ただし, @var{nm} は係数に分数を含まない加群多項式, @var{dn} は +数または多項式で @var{nm}/@var{dn} が真の値となる. +@var{quo} は除算の商を表す配列で, @var{dn}@var{dpoly}=@var{nm}+@var{quo[0]dpolyarray[0]+...} が成り立つ. +のリスト. +@item +@var{fullreduce} が 0 でないとき全ての項に対して簡約を行う. @var{fullreduce} +が 0 のとき頭項のみに対して簡約を行う. +\E +\BEG +@item +Computes the normal form of a module polynomial. +@item +The result of @code{dpm_nf()} may be multiplied by a constant in the +ground field in order to make the result integral. +@item +@var{dpolyarray} is a vector whose components are module polynomials +and @var{indexlist} is a list of indices which is used for the normal form +computation. +@item +If @var{indexlist} is given, only the polynomials in @var{dpolyarray} specified in @var{indexlist} +is used in the division. An index placed at the preceding position has priority to be selected. +If @var{indexlist} is not given, all the polynomials in @var{dpolyarray} are used. +@item +@code{dpm_nf_and_quotient()} returns +such a list as @code{[@var{nm},@var{dn},@var{quo}]}. +Here @var{nm} is a module polynomial whose coefficients are integral +in the ground field, @var{dn} is an integral element in the ground +field and @var{nm}/@var{dn} is the true normal form. +@var{quo} is an array containing the quotients of the division satisfying +@var{dn}@var{dpoly}=@var{nm}+@var{quo[0]dpolyarray[0]+...}. +@item +When argument @var{fullreduce} has non-zero value, +all terms are reduced. When it has value 0, +only the head term is reduced. +\E +@end itemize + +@example +[2126] dp_ord([1,0])$ +[2127] S=ltov([(1)*<<0,0,2,0:1>>+(1)*<<0,0,1,1:1>>+(1)*<<0,0,0,2:1>> ++(-1)*<<3,0,0,0:2>>+(-1)*<<0,0,2,1:2>>+(-1)*<<0,0,1,2:2>> ++(1)*<<3,0,1,0:3>>+(1)*<<3,0,0,1:3>>+(1)*<<0,0,2,2:3>>, +(-1)*<<0,1,0,0:1>>+(-1)*<<0,0,1,0:1>>+(-1)*<<0,0,0,1:1>> ++(-1)*<<3,0,0,0:3>>+(1)*<<0,1,1,1:3>>,(1)*<<0,1,0,0:2>> ++(1)*<<0,0,1,0:2>>+(1)*<<0,0,0,1:2>>+(-1)*<<0,1,1,0:3>> ++(-1)*<<0,1,0,1:3>>+(-1)*<<0,0,1,1:3>>])$ +[2128] U=dpm_sp(S[0],S[1]); +(1)*<<0,0,3,0:1>>+(-1)*<<0,1,1,1:1>>+(1)*<<0,0,2,1:1>> ++(-1)*<<0,1,0,2:1>>+(1)*<<3,1,0,0:2>>+(1)*<<0,1,2,1:2>> ++(1)*<<0,1,1,2:2>>+(-1)*<<3,1,1,0:3>>+(1)*<<3,0,2,0:3>> ++(-1)*<<3,1,0,1:3>>+(-1)*<<0,1,3,1:3>>+(-1)*<<0,1,2,2:3>> +[2129] dpm_nf(U,S,1); +0 +[2130] L=dpm_nf_and_quotient(U,S)$ +[2131] Q=L[2]$ +[2132] D=L[1]$ +[2133] D*U-(Q[1]*S[1]+Q[2]*S[2]); +0 +@end example + +@table @t +\JP @item 参照 +\EG @item References +@fref{dpm_sp}, +@fref{dp_ord}. +@end table + + +\JP @node dp_hm dp_ht dp_hc dp_rest,,, グレブナ基底に関する函数 +\EG @node dp_hm dp_ht dp_hc dp_rest,,, Functions for Groebner basis computation @subsection @code{dp_hm}, @code{dp_ht}, @code{dp_hc}, @code{dp_rest} @findex dp_hm @findex dp_ht @@ -1473,28 +3694,49 @@ u4^2+(6*u3+2*u2+6*u1-2)*u4+9*u3^2+(6*u2+18*u1-6)*u3+u2 @table @t @item dp_hm(@var{dpoly}) -:: $BF,C19`<0$r> @end example -@node dp_td dp_sugar,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dpm_hm dpm_ht dpm_hc dpm_hp dpm_rest,,, グレブナ基底に関する函数 +\EG @node dpm_hm dpm_ht dpm_hc dpm_hp dpm_rest,,, Functions for Groebner basis computation +@subsection @code{dpm_hm}, @code{dpm_ht}, @code{dpm_hc}, @code{dpm_hp}, @code{dpm_rest} +@findex dpm_hm +@findex dpm_ht +@findex dpm_hc +@findex dpm_hp +@findex dpm_rest + +@table @t +@item dpm_hm(@var{dpoly}) +\JP :: 加群多項式の頭単項式を取り出す. +\EG :: Gets the head monomial of a module polynomial. +@item dpm_ht(@var{dpoly}) +\JP :: 加群多項式の頭項を取り出す. +\EG :: Gets the head term of a module polynomial. +@item dpm_hc(@var{dpoly}) +\JP :: 加群多項式の頭係数を取り出す. +\EG :: Gets the head coefficient of a module polynomial. +@item dpm_hp(@var{dpoly}) +\JP :: 加群多項式の頭位置を取り出す. +\EG :: Gets the head position of a module polynomial. +@item dpm_rest(@var{dpoly}) +\JP :: 加群多項式の頭単項式を取り除いた残りを返す. +\EG :: Gets the remainder of a module polynomial where the head monomial is removed. +@end table + +@table @var +\BJP +@item return +@code{dp_hm()}, @code{dp_ht()}, @code{dp_rest()} : 加群多項式, +@code{dp_hc()} : 数または多項式 +@item dpoly +加群多項式 +\E +\BEG +@item return +@code{dpm_hm()}, @code{dpm_ht()}, @code{dpm_rest()} : module polynomial +@code{dpm_hc()} : monomial +@item dpoly +distributed polynomial +\E +@end table + +@itemize @bullet +\BJP +@item +これらは, 加群多項式の各部分を取り出すための函数である. +@item +@code{dpm_hc()} は, @code{dpm_hm()} の, 標準基底に関する係数である単項式を返す. +スカラー係数を取り出すには, さらに @code{dp_hc()} を実行する. +@item +@code{dpm_hp()} は, 頭加群単項式に含まれる標準基底のインデックスを返す. +\E +\BEG +@item +These are used to get various parts of a module polynomial. +@item +@code{dpm_hc()} returns the monomial that is the coefficient of @code{dpm_hm()} with respect to the +standard base. +For getting its scalar coefficient apply @code{dp_hc()}. +@item +@code{dpm_hp()} returns the index of the standard base conteind in the head module monomial. +\E +@end itemize + +@example +[2126] dp_ord([1,0]); +[1,0] +[2127] F=2*<<1,2,0:2>>-3*<<1,0,2:3>>+<<2,1,0:2>>; +(1)*<<2,1,0:2>>+(2)*<<1,2,0:2>>+(-3)*<<1,0,2:3>> +[2128] M=dpm_hm(F); +(1)*<<2,1,0:2>> +[2129] C=dpm_hc(F); +(1)*<<2,1,0>> +[2130] R=dpm_rest(F); +(2)*<<1,2,0:2>>+(-3)*<<1,0,2:3>> +[2131] dpm_hp(F); +2 +@end example + + +\JP @node dp_td dp_sugar,,, グレブナ基底に関する函数 +\EG @node dp_td dp_sugar,,, Functions for Groebner basis computation @subsection @code{dp_td}, @code{dp_sugar} @findex dp_td @findex dp_sugar @table @t @item dp_td(@var{dpoly}) -:: $BF,9`$NA4A[E*$K@Fl9g$K7k2L$,;}$DA4.8xG\9`$rJV$9(B. +\JP :: 最小公倍項を返す. +\EG :: Returns the least common multiple of the head terms of the given two polynomials. @end table @table @var @item return -$BJ,;6I=8=B?9`<0(B -@item dpoly1, dpoly2 -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial +@item dpoly1 dpoly2 +\JP 分散表現多項式 +\EG distributed polynomial @end table @itemize @bullet +\BJP @item -$B$=$l$>$l$N0z?t$NF,9`$N:G>.8xG\9`$rJV$9(B. $B78?t$O(B 1 $B$G$"$k(B. +それぞれの引数の頭項の最小公倍項を返す. 係数は 1 である. +\E +\BEG +@item +Returns the least common multiple of the head terms of the given +two polynomials, where coefficient is always set to 1. +\E @end itemize @example @@ -1585,32 +3941,46 @@ u4^2+(6*u3+2*u2+6*u1-2)*u4+9*u3^2+(6*u2+18*u1-6)*u3+u2 @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{p_nf p_nf_mod p_true_nf p_true_nf_mod}. @end table -@node dp_redble,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_redble,,, グレブナ基底に関する函数 +\EG @node dp_redble,,, Functions for Groebner basis computation @subsection @code{dp_redble} @findex dp_redble @table @t @item dp_redble(@var{dpoly1},@var{dpoly2}) -:: $BF,9`$I$&$7$,@0=|2DG=$+$I$&$+D4$Y$k(B. +\JP :: 頭項どうしが整除可能かどうか調べる. +\EG :: Checks whether one head term is divisible by the other head term. @end table @table @var @item return -$B@0?t(B -@item dpoly1, dpoly2 -$BJ,;6I=8=B?9`<0(B +\JP 整数 +\EG integer +@item dpoly1 dpoly2 +\JP 分散表現多項式 +\EG distributed polynomial @end table @itemize @bullet +\BJP @item -@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 -0 $B$rJV$9(B. +@var{dpoly1} の頭項が @var{dpoly2} の頭項で割り切れれば 1, 割り切れなければ +0 を返す. @item -$BB?9`<0$N4JLs$r9T$&:](B, $B$I$N9`$r4JLs$G$-$k$+$rC5$9$N$KMQ$$$k(B. +多項式の簡約を行う際, どの項を簡約できるかを探すのに用いる. +\E +\BEG +@item +Returns 1 if the head term of @var{dpoly2} divides the head term of +@var{dpoly1}; otherwise 0. +@item +Used for finding candidate terms at reduction of polynomials. +\E @end itemize @example @@ -1626,32 +3996,83 @@ u4^2+(6*u3+2*u2+6*u1-2)*u4+9*u3^2+(6*u2+18*u1-6)*u3+u2 @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{dp_red dp_red_mod}. @end table -@node dp_subd,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dpm_redble,,, グレブナ基底に関する函数 +\EG @node dpm_redble,,, Functions for Groebner basis computation +@subsection @code{dpm_redble} +@findex dpm_redble + +@table @t +@item dpm_redble(@var{dpoly1},@var{dpoly2}) +\JP :: 頭項どうしが整除可能かどうか調べる. +\EG :: Checks whether one head term is divisible by the other head term. +@end table + +@table @var +@item return +\JP 整数 +\EG integer +@item dpoly1 dpoly2 +\JP 加群多項式 +\EG module polynomial +@end table + +@itemize @bullet +\BJP +@item +@var{dpoly1} の頭項が @var{dpoly2} の頭項で割り切れれば 1, 割り切れなければ +0 を返す. +@item +多項式の簡約を行う際, どの項を簡約できるかを探すのに用いる. +\E +\BEG +@item +Returns 1 if the head term of @var{dpoly2} divides the head term of +@var{dpoly1}; otherwise 0. +@item +Used for finding candidate terms at reduction of polynomials. +\E +@end itemize + +\JP @node dp_subd,,, グレブナ基底に関する函数 +\EG @node dp_subd,,, Functions for Groebner basis computation @subsection @code{dp_subd} @findex dp_subd @table @t @item dp_subd(@var{dpoly1},@var{dpoly2}) -:: $BF,9`$N>&C19`<0$rJV$9(B. +\JP :: 頭項の商単項式を返す. +\EG :: Returns the quotient monomial of the head terms. @end table @table @var @item return -$BJ,;6I=8=B?9`<0(B -@item dpoly1, dpoly2 -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial +@item dpoly1 dpoly2 +\JP 分散表現多項式 +\EG distributed polynomial @end table @itemize @bullet +\BJP @item -@code{dp_ht(@var{dpoly1})/dp_ht(@var{dpoly2})} $B$r5a$a$k(B. $B7k2L$N78?t$O(B 1 -$B$G$"$k(B. +@code{dp_ht(@var{dpoly1})/dp_ht(@var{dpoly2})} を求める. 結果の係数は 1 +である. @item -$B3d$j@Z$l$k$3$H$,$"$i$+$8$a$o$+$C$F$$$kI,MW$,$"$k(B. +割り切れることがあらかじめわかっている必要がある. +\E +\BEG +@item +Gets @code{dp_ht(@var{dpoly1})/dp_ht(@var{dpoly2})}. +The coefficient of the result is always set to 1. +@item +Divisibility assumed. +\E @end itemize @example @@ -1660,37 +4081,53 @@ u4^2+(6*u3+2*u2+6*u1-2)*u4+9*u3^2+(6*u2+18*u1-6)*u3+u2 @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{dp_red dp_red_mod}. @end table -@node dp_vtoe dp_etov,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_vtoe dp_etov,,, グレブナ基底に関する函数 +\EG @node dp_vtoe dp_etov,,, Functions for Groebner basis computation @subsection @code{dp_vtoe}, @code{dp_etov} @findex dp_vtoe @findex dp_etov @table @t @item dp_vtoe(@var{vect}) -:: $B;X?t%Y%/%H%k$r9`$KJQ49(B +\JP :: 指数ベクトルを項に変換 +\EG :: Converts an exponent vector into a term. @item dp_etov(@var{dpoly}) -:: $BF,9`$r;X?t%Y%/%H%k$KJQ49(B +\JP :: 頭項を指数ベクトルに変換 +\EG :: Convert the head term of a distributed polynomial into an exponent vector. @end table @table @var @item return -@code{dp_vtoe} : $BJ,;6I=8=B?9`<0(B, @code{dp_etov} : $B%Y%/%H%k(B +\JP @code{dp_vtoe} : 分散表現多項式, @code{dp_etov} : ベクトル +\EG @code{dp_vtoe} : distributed polynomial, @code{dp_etov} : vector @item vect -$B%Y%/%H%k(B +\JP ベクトル +\EG vector @item dpoly -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial @end table @itemize @bullet +\BJP @item -@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. +@code{dp_vtoe()} は, ベクトル @var{vect} を指数ベクトルとする項を生成する. @item -@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 -$B%Y%/%H%k$KJQ49$9$k(B. +@code{dp_etov()} は, 分散表現多項式 @code{dpoly} の頭項の指数ベクトルを +ベクトルに変換する. +\E +\BEG +@item +@code{dp_vtoe()} generates a term whose exponent vector is @var{vect}. +@item +@code{dp_etov()} generates a vector which is the exponent vector of the +head term of @code{dpoly}. +\E @end itemize @example @@ -1703,30 +4140,47 @@ u4^2+(6*u3+2*u2+6*u1-2)*u4+9*u3^2+(6*u2+18*u1-6)*u3+u2 (1)*<<1,2,4>> @end example -@node dp_mbase,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_mbase,,, グレブナ基底に関する函数 +\EG @node dp_mbase,,, Functions for Groebner basis computation @subsection @code{dp_mbase} @findex dp_mbase @table @t @item dp_mbase(@var{dplist}) -:: monomial $B4pDl$N7W;;(B +\JP :: monomial 基底の計算 +\EG :: Computes the monomial basis @end table @table @var @item return -$BJ,;6I=8=B?9`<0$N%j%9%H(B +\JP 分散表現多項式のリスト +\EG list of distributed polynomial @item dplist -$BJ,;6I=8=B?9`<0$N%j%9%H(B +\JP 分散表現多項式のリスト +\EG list of distributed polynomial @end table @itemize @bullet +\BJP @item -$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 -$B$G$"$k(B @var{dplist} $B$K$D$$$F(B, -@var{dplist} $B$,(B K[X] $BCf$G@8@.$9$k%$%G%"%k(B I $B$,(B 0 $BeM-8BH(B +\JP @item 参照 +\EG @item References @fref{gr hgr gr_mod}. @end table -@node dp_mag,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_mag,,, グレブナ基底に関する函数 +\EG @node dp_mag,,, Functions for Groebner basis computation @subsection @code{dp_mag} @findex dp_mag @table @t @item dp_mag(@var{p}) -:: $B78?t$N%S%C%HD9$NOB$rJV$9(B +\JP :: 係数のビット長の和を返す +\EG :: Computes the sum of bit lengths of coefficients of a distributed polynomial. @end table @table @var @item return -$B?t(B +\JP 数 +\EG integer @item p -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial @end table @itemize @bullet +\BJP @item -$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) -$B$N%S%C%HD9$NAmOB$rJV$9(B. +分散表現多項式の係数に現れる有理数につき, その分母分子 (整数の場合は分子) +のビット長の総和を返す. @item -$BBP>]$H$J$kB?9`<0$NBg$-$5$NL\0B$H$7$FM-8z$G$"$k(B. $BFC$K(B, 0 $BH(B +\JP @item 参照 +\EG @item References @fref{dp_gr_flags dp_gr_print}. @end table -@node dp_red dp_red_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_red dp_red_mod,,, グレブナ基底に関する函数 +\EG @node dp_red dp_red_mod,,, Functions for Groebner basis computation @subsection @code{dp_red}, @code{dp_red_mod} @findex dp_red @findex dp_red_mod @@ -1793,35 +4269,61 @@ u1*u2,u1^2,u4*u0,u3*u0,u2*u0,u1*u0,u0^2,u4,u3,u2,u1,u0 @table @t @item dp_red(@var{dpoly1},@var{dpoly2},@var{dpoly3}) @item dp_red_mod(@var{dpoly1},@var{dpoly2},@var{dpoly3},@var{mod}) -:: $B0l2s$N4JLsA`:n(B +\JP :: 一回の簡約操作 +\EG :: Single reduction operation @end table @table @var @item return -$B%j%9%H(B -@item dpoly1, dpoly2, dpoly3 -$BJ,;6I=8=B?9`<0(B +\JP リスト +\EG list +@item dpoly1 dpoly2 dpoly3 +\JP 分散表現多項式 +\EG distributed polynomial @item vlist -$B%j%9%H(B +\JP リスト +\EG list @item mod -$BAG?t(B +\JP 素数 +\EG prime @end table @itemize @bullet +\BJP @item -@var{dpoly1} + @var{dpoly2} $B$J$kJ,;6I=8=B?9`<0$r(B @var{dpoly3} $B$G(B -1 $B2s4JLs$9$k(B. +@var{dpoly1} + @var{dpoly2} なる分散表現多項式を @var{dpoly3} で +1 回簡約する. @item -@code{dp_red_mod()} $B$NF~NO$O(B, $BA4$FM-8BBN78?t$KJQ49$5$l$F$$$kI,MW$,$"$k(B. +@code{dp_red_mod()} の入力は, 全て有限体係数に変換されている必要がある. @item -$B4JLs$5$l$k9`$O(B @var{dpoly2} $B$NF,9`$G$"$k(B. $B=>$C$F(B, @var{dpoly2} $B$N(B -$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 -$B$J$i$J$$(B. +簡約される項は @var{dpoly2} の頭項である. 従って, @var{dpoly2} の +頭項が @var{dpoly3} の頭項で割り切れることがあらかじめわかっていなければ +ならない. @item -$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}, -$B9`(B @var{t} $B$K$h$j(B @var{a(dpoly1 + dpoly2)-bt dpoly3} $B$H$7$F7W;;$5$l$k(B. +引数が整数係数の時, 簡約は, 分数が現れないよう, 整数 @var{a}, @var{b}, +項 @var{t} により @var{a}(@var{dpoly1} + @var{dpoly2})-@var{bt} @var{dpoly3} として計算される. @item -$B7k2L$O(B, @code{[@var{a dpoly1},@var{a dpoly2 - bt dpoly3}]} $B$J$k%j%9%H$G$"$k(B. +結果は, @code{[@var{a dpoly1},@var{a dpoly2 - bt dpoly3}]} なるリストである. +\E +\BEG +@item +Reduces a distributed polynomial, @var{dpoly1} + @var{dpoly2}, +by @var{dpoly3} for single time. +@item +An input for @code{dp_red_mod()} must be converted into a distributed +polynomial with coefficients in a finite field. +@item +This implies that +the divisibility of the head term of @var{dpoly2} by the head term of +@var{dpoly3} is assumed. +@item +When integral coefficients, computation is so carefully performed that +no rational operations appear in the reduction procedure. +It is computed for integers @var{a} and @var{b}, and a term @var{t} as: +@var{a}(@var{dpoly1} + @var{dpoly2})-@var{bt} @var{dpoly3}. +@item +The result is a list @code{[@var{a dpoly1},@var{a dpoly2 - bt dpoly3}]}. +\E @end itemize @example @@ -1832,16 +4334,18 @@ u1*u2,u1^2,u4*u0,u3*u0,u2*u0,u1*u0,u0^2,u4,u3,u2,u1,u0 [159] C=12*<<1,1,1,0,0>>+(1)*<<0,1,1,1,0>>+(1)*<<1,1,0,0,1>>; (12)*<<1,1,1,0,0>>+(1)*<<0,1,1,1,0>>+(1)*<<1,1,0,0,1>> [160] dp_red(D,R,C); -[(6)*<<2,1,0,0,0>>+(6)*<<1,2,0,0,0>>+(2)*<<0,3,0,0,0>>,(-1)*<<0,1,1,1,0>> -+(-1)*<<1,1,0,0,1>>] +[(6)*<<2,1,0,0,0>>+(6)*<<1,2,0,0,0>>+(2)*<<0,3,0,0,0>>, +(-1)*<<0,1,1,1,0>>+(-1)*<<1,1,0,0,1>>] @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{dp_mod dp_rat}. @end table -@node dp_sp dp_sp_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node dp_sp dp_sp_mod,,, グレブナ基底に関する函数 +\EG @node dp_sp dp_sp_mod,,, Functions for Groebner basis computation @subsection @code{dp_sp}, @code{dp_sp_mod} @findex dp_sp @findex dp_sp_mod @@ -1849,26 +4353,42 @@ u1*u2,u1^2,u4*u0,u3*u0,u2*u0,u1*u0,u0^2,u4,u3,u2,u1,u0 @table @t @item dp_sp(@var{dpoly1},@var{dpoly2}) @item dp_sp_mod(@var{dpoly1},@var{dpoly2},@var{mod}) -:: S-$BB?9`<0$N7W;;(B +\JP :: S-多項式の計算 +\EG :: Computation of an S-polynomial @end table @table @var @item return -$BJ,;6I=8=B?9`<0(B -@item dpoly1, dpoly2 -$BJ,;6I=8=B?9`<0(B +\JP 分散表現多項式 +\EG distributed polynomial +@item dpoly1 dpoly2 +\JP 分散表現多項式 +\EG distributed polynomial @item mod -$BAG?t(B +\JP 素数 +\EG prime @end table @itemize @bullet +\BJP @item -@var{dpoly1}, @var{dpoly2} $B$N(B S-$BB?9`<0$r7W;;$9$k(B. +@var{dpoly1}, @var{dpoly2} の S-多項式を計算する. @item -@code{dp_sp_mod()} $B$NF~NO$O(B, $BA4$FM-8BBN78?t$KJQ49$5$l$F$$$kI,MW$,$"$k(B. +@code{dp_sp_mod()} の入力は, 全て有限体係数に変換されている必要がある. @item -$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 -$BG\$5$l$F$$$k2DG=@-$,$"$k(B. +結果に有理数, 有理式が入るのを避けるため, 結果が定数倍, あるいは多項式 +倍されている可能性がある. +\E +\BEG +@item +This function computes the S-polynomial of @var{dpoly1} and @var{dpoly2}. +@item +Inputs of @code{dp_sp_mod()} must be polynomials with coefficients in a +finite field. +@item +The result may be multiplied by a constant in the ground field in order to +make the result integral. +\E @end itemize @example @@ -1881,10 +4401,269 @@ u1*u2,u1^2,u4*u0,u3*u0,u2*u0,u1*u0,u0^2,u4,u3,u2,u1,u0 @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{dp_mod dp_rat}. @end table -@node p_nf p_nf_mod p_true_nf p_true_nf_mod,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B + +\JP @node dpm_sp,,, グレブナ基底に関する函数 +\EG @node dmp_sp,,, Functions for Groebner basis computation +@subsection @code{dpm_sp} +@findex dpm_sp + +@table @t +@item dpm_sp(@var{dpoly1},@var{dpoly2}[|coef=1]) +\JP :: S-多項式の計算 +\EG :: Computation of an S-polynomial +@end table + +@table @var +@item return +\JP 加群多項式またはリスト +\EG module polynomial or list +@item dpoly1 dpoly2 +\JP 加群多項式 +\EG module polynomial +\JP 分散表現多項式 +@end table + +@itemize @bullet +\BJP +@item +@var{dpoly1}, @var{dpoly2} の S-多項式を計算する. +@item +オプション @var{coef=1} が指定されている場合, @code{[S,t1,t2]} なるリストを返す. +ここで, @code{t1}, @code{t2} はS-多項式を作る際の係数単項式で @code{S=t1 dpoly1-t2 dpoly2} +を満たす. +\E +\BEG +@item +This function computes the S-polynomial of @var{dpoly1} and @var{dpoly2}. +@item +If an option @var{coef=1} is specified, it returns a list @code{[S,t1,t2]}, +where @code{S} is the S-polynmial and @code{t1}, @code{t2} are monomials satisfying @code{S=t1 dpoly1-t2 dpoly2}. +\E +@end itemize + +\JP @node dpm_schreyer_base,,, グレブナ基底に関する函数 +\EG @node dmp_schreyer_base,,, Functions for Groebner basis computation +@subsection @code{dpm_schreyer_base} +@findex dpm_schreyer_base + +@table @t +@item dpm_schreyer_base(@var{G}) +\JP :: szygy 加群のグレブナー基底の計算 +\EG :: Computation of a Groebner basis of the syzygy module +@end table + +@table @var +@item return +\JP 加群多項式リスト +\EG list of module polynomials +@item G +\JP 加群多項式リスト +\EG list of module polynomials +@end table + +@itemize @bullet +\BJP +@item +加群多項式で表された簡約グレブナー基底 @var{G} に対し, @var{syz(G)} の極小グレブナー基底を計算して返す. +@item +得られる結果は, @var{G} の先頭項から定まる Schreyer 順序に関するグレブナー基底である. +副作用として, この Schreyer 順序が自動的に設定される. +\E +\BEG +@item +This function computes a minimal Groebner basis of @var{syz(G)} for a Groenber basis @var{G} +that is represented as a list of module polynomials. +@item +The result is a Groebner basis with respect to a Schreyer ordering determined by the leading terms of +@var{G}. As a side effect, this Schreyer ordering is autoatically set. +\E +@end itemize + +\JP @node dpm_schreyer_frame,,, グレブナ基底に関する函数 +\EG @node dmp_schreyer_frame,,, Functions for Groebner basis computation +@subsection @code{dpm_schreyer_frame} +@findex dpm_schreyer_frame + +@table @t +@item dpm_schreyer_frame(@var{G}) +\JP :: Schreyer フレームの計算 +\EG :: Computation of the Schreyer frame +@end table + +@table @var +@item return +\JP 加群単項式リストのリスト +\EG a list of lists of module monomials +@item G +\JP 加群多項式リスト +\EG list of module polynomials +@end table + +@itemize @bullet +\BJP +@item +@var{G} の先頭項からスタートして, Schreyer フレーム, すなわち Schreyer の自由分解に現れるグレブナー基底の, +Schreyer 順序に関する先頭単項式を計算する. +@item +得られる結果は, 自由分解における @var{F}_i の標準基底の像の先頭単項式のリスト @var{M}_i のリスト +[@var{M}_m,...,@var{M}_1] である. +@item +副作用として, 各レベルにおける Schreyer 順序を設定するためのデータが作られる. このデータは +@code{dpm_set_schreyer_level} により, 各レベルの Schreyer 順序を設定する際に用いられる. +\E +\BEG +@item +This function computes the Schreyer frame starting from a Groebner basis @var{G}, that is the lists of leading monomials of Groebner bases +of syzygy modules with respect to Schreyer orderings in the Schreyer free resolution. +@item +The result is a list [@var{M}_m,...,@var{M}_1], where @var{M}_i is the list of leading monomials of +the images of standard bases of the free module @var{F}_i in the Schreyer free resolution. +@item +As a by-product, data for setting a Schreyer order in each level are created. The date are +used by @code{dpm_set_schreyer_level} for setting a Schreyer order in each level. +\E +@end itemize + +\JP @node dpm_set_schreyer_level,,, グレブナ基底に関する函数 +\EG @node dmp_set_schreyer_level,,, Functions for Groebner basis computation +@subsection @code{dpm_set_schreyer_level} +@findex dpm_set_schreyer_level + +@table @t +@item dpm_set_schreyer_level(@var{L}) +\JP :: 指定されたレベルの Schreyer ordering の設定 +\EG :: Setting the Schreyer ordering of a specified level +@end table + +@table @var +@item return +\JP 非負整数 +\EG a non-negative integer +@item G +\JP 非負整数 +\EG a non-negative integer +@end table + +@itemize @bullet +\BJP +@item +@var{G} の先頭項からスタートして, Schreyer フレーム, すなわち Schreyer の自由分解に現れるグレブナー基底の, +Schreyer 順序に関する先頭単項式を計算する. +@item +得られる結果は, 自由分解における @var{F}_i の標準基底の像の先頭単項式のリスト @var{M}_i のリスト +[@var{M}_m,...,@var{M}_1] である. +@item +副作用として, 各レベルにおける Schreyer 順序を設定するためのデータが作られる. このデータは +@code{dpm_set_schreyer_level} により, 各レベルの Schreyer 順序を設定する際に用いられる. +\E +\BEG +@item +This function computes the Schreyer frame starting from a Groebner basis @var{G}, that is the lists of leading monomials of Groebner bases +of syzygy modules with respect to Schreyer orderings in the Schreyer free resolution. +@item +The result is a list [@var{M}_m,...,@var{M}_1], where @var{M}_i is the list of leading monomials of +the images of standard bases of the free module @var{F}_i in the Schreyer free resolution. +@item +As a by-product, data for setting a Schreyer order in each level are created. The date are +used by @code{dpm_set_schreyer_level} for setting a Schreyer order in each level. +\E +@end itemize + +\JP @node dpm_sp_nf,,, グレブナ基底に関する函数 +\EG @node dmp_sp_nf,,, Functions for Groebner basis computation +@subsection @code{dpm_sp_nf} +@findex dpm_sp_nf + +@table @t +@item dpm_sp_nf(@var{C},@var{Z},@var{P},@var{Q}) +\JP :: S-多項式を多項式配列で割った余りの計算 +\EG :: Computation of a remainder of an S-polynomial modulo a polynomial array +@end table + +@table @var +@item return +\JP 加群単項式のリスト +\EG a list of module monomials +@item C +\JP 加群多項式配列 +\EG an array of module polynomials +@item Z +\JP 整数リストの配列 +\EG an array of integer lists +@item P +@itemx Q +\JP 整数 +\EG integers +@end table + +@itemize @bullet +\BJP +@item +@iftex +@var{C[P]}, @var{C[Q]} の S-多項式を C で割った余り f が +@tex +$$ct C[P]-c't'C[Q]=g_1C[1]+\cdots+g_LC[L]+f$$ +@end tex +と表されるとき +@tex +$$g'=ct e_P-c't' e_Q-(g_1 e_1+...+g_L e_L)$$ +@end tex +に対し +@tex +[g',f] +@end tex +を返す. +@end iftex +@ifnottex +@var{C[P]}, @var{C[Q]} の S-多項式を C で割った余り f が +ct @var{C[P]}-c't'@var{C[Q]}=g_1@var{C[1]}+...+g_L@var{C[L]}+f +と表されるとき +g'=ct e_P-c't' e_Q-(g_1 e_1+...+g_L e_L) +に対し +[g',f] +を返す. +@end ifnottex +@item +配列 @var{Z} の第 I 成分は, 先頭項の位置が @var{I} であるような @var{C} の元の配列インデックスのリストである. +\E +\BEG +@item +@iftex +When the remainder of the S-polynomial of @var{C[P]} and @var{C[Q]} modulo @var{C} +is represented as +@tex +$$ct C[P]-c't'C[Q]=g_1C[1]+\cdots+g_LC[L]+f$$ +@end tex +this function returns a list +@tex +[g',f], +@end tex +where +@tex +$$g'=ct e_P-c't' e_Q-(g_1 e_1+...+g_L e_L).$$ +@end tex +@end iftex +@ifnottex +When the remainder of the S-polynomial of @var{C[P]} and @var{C[Q]} modulo @var{C} +is represented as +ct @var{C[P]}-c't'@var{C[Q]}=g_1@var{C[1]}+...+g_L@var{C[L]}+f, +this function returns a list [g',f], where +g'=ct eP-c't' eQ-(g_1 e1+...+gL e_L). +@end ifnottex +@item +The @var{I}-th element of an array @var{Z} is a list of indices of elements of @var{C} +whose leading position is @var{I}. +\E +@end itemize + + + +\JP @node p_nf p_nf_mod p_true_nf p_true_nf_mod,,, グレブナ基底に関する函数 +\EG @node p_nf p_nf_mod p_true_nf p_true_nf_mod,,, Functions for Groebner basis computation @subsection @code{p_nf}, @code{p_nf_mod}, @code{p_true_nf}, @code{p_true_nf_mod} @findex p_nf @findex p_nf_mod @@ -1894,46 +4673,84 @@ u1*u2,u1^2,u4*u0,u3*u0,u2*u0,u1*u0,u0^2,u4,u3,u2,u1,u0 @table @t @item p_nf(@var{poly},@var{plist},@var{vlist},@var{order}) @itemx p_nf_mod(@var{poly},@var{plist},@var{vlist},@var{order},@var{mod}) -:: $BI=8=B?9`<0$N@55,7A$r5a$a$k(B. ($B7k2L$ODj?tG\$5$l$F$$$k2DG=@-$"$j(B) +\JP :: 表現多項式の正規形を求める. (結果は定数倍されている可能性あり) +\BEG +:: Computes the normal form of the given polynomial. +(The result may be multiplied by a constant.) +\E @item p_true_nf(@var{poly},@var{plist},@var{vlist},@var{order}) @itemx p_true_nf_mod(@var{poly},@var{plist},@var{vlist},@var{order},@var{mod}) -:: $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) +\JP :: 表現多項式の正規形を求める. (真の結果を @code{[分子, 分母]} の形で返す) +\BEG +:: Computes the normal form of the given polynomial. (The result is returned +as a form of @code{[numerator, denominator]}) +\E @end table @table @var @item return -@code{p_nf} : $BB?9`<0(B, @code{p_true_nf} : $B%j%9%H(B +\JP @code{p_nf} : 多項式, @code{p_true_nf} : リスト +\EG @code{p_nf} : polynomial, @code{p_true_nf} : list @item poly -$BB?9`<0(B -@item plist,vlist -$B%j%9%H(B +\JP 多項式 +\EG polynomial +@item plist vlist +\JP リスト +\EG list @item order -$B?t(B, $B%j%9%H$^$?$O9TNs(B +\JP 数, リストまたは行列 +\EG number, list or matrix @item mod -$BAG?t(B +\JP 素数 +\EG prime @end table @itemize @bullet +\BJP @item -@samp{gr} $B$GDj5A$5$l$F$$$k(B. +@samp{gr} で定義されている. @item -$BB?9`<0$N(B, $BB?9`<0%j%9%H$K$h$k@55,7A$r5a$a$k(B. +多項式の, 多項式リストによる正規形を求める. @item @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()}, @code{dp_true_nf_mod} -$B$KBP$9$k%$%s%?%U%'!<%9$G$"$k(B. +に対するインタフェースである. @item -@var{poly} $B$*$h$S(B @var{plist} $B$O(B, $BJQ?t=g=x(B @var{vlist} $B$*$h$S(B -$BJQ?t=g=x7?(B @var{otype} $B$K=>$C$FJ,;6I=8=B?9`<0$KJQ49$5$l(B, +@var{poly} および @var{plist} は, 変数順序 @var{vlist} および +変数順序型 @var{otype} に従って分散表現多項式に変換され, @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()}, -@code{dp_true_nf_mod()} $B$KEO$5$l$k(B. +@code{dp_true_nf_mod()} に渡される. @item @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()}, -@code{dp_true_nf_mod()} $B$O(B @var{fullreduce} $B$,(B 1 $B$G8F$S=P$5$l$k(B. +@code{dp_true_nf_mod()} は @var{fullreduce} が 1 で呼び出される. @item -$B7k2L$OB?9`<0$KJQ49$5$l$F=PNO$5$l$k(B. +結果は多項式に変換されて出力される. @item -@code{p_true_nf()}, @code{p_true_nf_mod()} $B$N=PNO$K4X$7$F$O(B, -@code{dp_true_nf()}, @code{dp_true_nf_mod()} $B$N9`$r;2>H(B. +@code{p_true_nf()}, @code{p_true_nf_mod()} の出力に関しては, +@code{dp_true_nf()}, @code{dp_true_nf_mod()} の項を参照. +\E +\BEG +@item +Defined in the package @samp{gr}. +@item +Obtains the normal form of a polynomial by a polynomial list. +@item +These are interfaces to @code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()}, + @code{dp_true_nf_mod} +@item +The polynomial @var{poly} and the polynomials in @var{plist} is +converted, according to the variable ordering @var{vlist} and +type of term ordering @var{otype}, into their distributed polynomial +counterparts and passed to @code{dp_nf()}. +@item +@code{dp_nf()}, @code{dp_true_nf()}, @code{dp_nf_mod()} and +@code{dp_true_nf_mod()} +is called with value 1 for @var{fullreduce}. +@item +The result is converted back into an ordinary polynomial. +@item +As for @code{p_true_nf()}, @code{p_true_nf_mod()} +refer to @code{dp_true_nf()} and @code{dp_true_nf_mod()}. +\E @end itemize @example @@ -1949,74 +4766,111 @@ u1*u2,u1^2,u4*u0,u3*u0,u2*u0,u1*u0,u0^2,u4,u3,u2,u1,u0 @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{dp_ptod}, @fref{dp_dtop}, @fref{dp_ord}, -@fref{dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod}. +@fref{dp_nf dp_nf_mod dp_true_nf dp_true_nf_mod dp_weyl_nf dp_weyl_nf_mod}. @end table -@node p_terms,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node p_terms,,, グレブナ基底に関する函数 +\EG @node p_terms,,, Functions for Groebner basis computation @subsection @code{p_terms} @findex p_terms @table @t @item p_terms(@var{poly},@var{vlist},@var{order}) -:: $BB?9`<0$K$"$i$o$l$kC19`$r%j%9%H$K$9$k(B. +\JP :: 多項式にあらわれる単項をリストにする. +\EG :: Monomials appearing in the given polynomial is collected into a list. @end table @table @var @item return -$B%j%9%H(B +\JP リスト +\EG list @item poly -$BB?9`<0(B +\JP 多項式 +\EG polynomial @item vlist -$B%j%9%H(B +\JP リスト +\EG list @item order -$B?t(B, $B%j%9%H$^$?$O9TNs(B +\JP 数, リストまたは行列 +\EG number, list or matrix @end table @itemize @bullet +\BJP @item -@samp{gr} $B$GDj5A$5$l$F$$$k(B. +@samp{gr} で定義されている. @item -$BB?9`<0$rC19`$KE83+$7$?;~$K8=$l$k9`$r%j%9%H$K$7$FJV$9(B. -@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 -$B$,%j%9%H$N@hF,$KMh$k$h$&$K%=!<%H$5$l$k(B. +多項式を単項に展開した時に現れる項をリストにして返す. +@var{vlist} および @var{order} により定まる項順序により, 順序の高いもの +がリストの先頭に来るようにソートされる. @item -$B%0%l%V%J4pDl$O$7$P$7$P78?t$,5pBg$K$J$k$?$a(B, $Bl9g$,$"$j(B, -$B$=$l$i$,Ey$7$$$+$I$&$+$rD4$Y$k$?$a$KMQ$$$k(B. +異なる方法で求めたグレブナ基底は, 基底の順序, 符号が異なる場合があり, +それらが等しいかどうかを調べるために用いる. +\E +\BEG +@item +This function checks whether @var{plist1} and @var{plist2} are equal or +not as a set . +@item +For the same input and the same term ordering different +functions for Groebner basis computations may produce different outputs +as lists. This function compares such lists whether they are equal +as a generating set of an ideal. +\E @end itemize @example @@ -2029,7 +4883,8 @@ u0^6,u0^5,u0^4,u0^3,u0^2,u0,1] 1 @end example -@node katsura hkatsura cyclic hcyclic,,, $B%0%l%V%J4pDl$K4X$9$kH!?t(B +\JP @node katsura hkatsura cyclic hcyclic,,, グレブナ基底に関する函数 +\EG @node katsura hkatsura cyclic hcyclic,,, Functions for Groebner basis computation @subsection @code{katsura}, @code{hkatsura}, @code{cyclic}, @code{hcyclic} @findex katsura @findex hkatsura @@ -2041,26 +4896,43 @@ u0^6,u0^5,u0^4,u0^3,u0^2,u0,1] @item hkatsura(@var{n}) @item cyclic(@var{n}) @item hcyclic(@var{n}) -:: $BB?9`<0%j%9%H$N@8@.(B +\JP :: 多項式リストの生成 +\EG :: Generates a polynomial list of standard benchmark. @end table @table @var @item return -$B%j%9%H(B +\JP リスト +\EG list @item n -$B@0?t(B +\JP 整数 +\EG integer @end table @itemize @bullet +\BJP @item -@code{katsura()} $B$O(B @samp{katsura}, @code{cyclic()} $B$O(B @samp{cyclic} -$B$GDj5A$5$l$F$$$k(B. +@code{katsura()} は @samp{katsura}, @code{cyclic()} は @samp{cyclic} +で定義されている. @item -$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}, -@code{cyclic} $B$*$h$S$=$N@F$G8F$P$l$k$3$H$b$"$k(B. +@code{cyclic} は @code{Arnborg}, @code{Lazard}, @code{Davenport} などの +名で呼ばれることもある. +\E +\BEG +@item +Function @code{katsura()} is defined in @samp{katsura}, and +function @code{cyclic()} in @samp{cyclic}. +@item +These functions generate a series of polynomial sets, respectively, +which are often used for testing and bench marking: +@code{katsura}, @code{cyclic} and their homogenized versions. +@item +Polynomial set @code{cyclic} is sometimes called by other name: +@code{Arnborg}, @code{Lazard}, and @code{Davenport}. +\E @end itemize @example @@ -2068,8 +4940,8 @@ u0^6,u0^5,u0^4,u0^3,u0^2,u0,1] [79] load("cyclic")$ [89] katsura(5); [u0+2*u4+2*u3+2*u2+2*u1+2*u5-1,2*u4*u0-u4+2*u1*u3+u2^2+2*u5*u1, -2*u3*u0+2*u1*u4-u3+(2*u1+2*u5)*u2,2*u2*u0+2*u2*u4+(2*u1+2*u5)*u3-u2+u1^2, -2*u1*u0+(2*u3+2*u5)*u4+2*u2*u3+2*u1*u2-u1, +2*u3*u0+2*u1*u4-u3+(2*u1+2*u5)*u2,2*u2*u0+2*u2*u4+(2*u1+2*u5)*u3 +-u2+u1^2,2*u1*u0+(2*u3+2*u5)*u4+2*u2*u3+2*u1*u2-u1, u0^2-u0+2*u4^2+2*u3^2+2*u2^2+2*u1^2+2*u5^2] [90] hkatsura(5); [-t+u0+2*u4+2*u3+2*u2+2*u1+2*u5, @@ -2092,7 +4964,319 @@ u0^2-u0+2*u4^2+2*u3^2+2*u2^2+2*u1^2+2*u5^2] @end example @table @t -@item $B;2>H(B +\JP @item 参照 +\EG @item References @fref{dp_dtop}. +@end table + +\JP @node primadec primedec,,, グレブナ基底に関する函数 +\EG @node primadec primedec,,, Functions for Groebner basis computation +@subsection @code{primadec}, @code{primedec} +@findex primadec +@findex primedec + +@table @t +@item primadec(@var{plist},@var{vlist}) +@item primedec(@var{plist},@var{vlist}) +\JP :: イデアルの分解 +\EG :: Computes decompositions of ideals. +@end table + +@table @var +@item return +@itemx plist +\JP 多項式リスト +\EG list of polynomials +@item vlist +\JP 変数リスト +\EG list of variables +@end table + +@itemize @bullet +\BJP +@item +ここで解説されているイデアル分解については, 新しいパッケージ @samp{noro_pd.rr} +においてより高速な実装が利用できる. +@item +@code{primadec()}, @code{primedec} は @samp{primdec} で定義されている. +@item +@code{primadec()}, @code{primedec()} はそれぞれ有理数体上でのイデアルの +準素分解, 根基の素イデアル分解を行う. +@item +引数は多項式リストおよび変数リストである. 多項式は有理数係数のみが許される. +@item +@code{primadec} は @code{[準素成分, 付属素イデアル]} のリストを返す. +@item +@code{primadec} は 素因子のリストを返す. +@item +結果において, 多項式リストとして表示されている各イデアルは全て +グレブナ基底である. 対応する項順序は, それぞれ +変数 @code{PRIMAORD}, @code{PRIMEORD} に格納されている. +@item +@code{primadec} は @code{[Shimoyama,Yokoyama]} の準素分解アルゴリズム +を実装している. +@item +もし素因子のみを求めたいなら, @code{primedec} を使う方がよい. +これは, 入力イデアルが根基イデアルでない場合に, @code{primadec} +の計算に余分なコストが必要となる場合があるからである. +\E +\BEG +@item +A new package @samp{noro_pd.rr} provides more efficient functions for ideal decomposition. +@item +Function @code{primadec()} and @code{primedec} are defined in @samp{primdec}. +@item +@code{primadec()}, @code{primedec()} are the function for primary +ideal decomposition and prime decomposition of the radical over the +rationals respectively. +@item +The arguments are a list of polynomials and a list of variables. +These functions accept ideals with rational function coefficients only. +@item +@code{primadec} returns the list of pair lists consisting a primary component +and its associated prime. +@item +@code{primedec} returns the list of prime components. +@item +Each component is a Groebner basis and the corresponding term order +is indicated by the global variables @code{PRIMAORD}, @code{PRIMEORD} +respectively. +@item +@code{primadec} implements the primary decompostion algorithm +in @code{[Shimoyama,Yokoyama]}. +@item +If one only wants to know the prime components of an ideal, then +use @code{primedec} because @code{primadec} may need additional costs +if an input ideal is not radical. +\E +@end itemize + +@example +[84] load("primdec")$ +[102] primedec([p*q*x-q^2*y^2+q^2*y,-p^2*x^2+p^2*x+p*q*y, +(q^3*y^4-2*q^3*y^3+q^3*y^2)*x-q^3*y^4+q^3*y^3, +-q^3*y^4+2*q^3*y^3+(-q^3+p*q^2)*y^2],[p,q,x,y]); +[[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]] +[103] primadec([x,z*y,w*y^2,w^2*y-z^3,y^3],[x,y,z,w]); +[[[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]]] +@end example + +@table @t +\JP @item 参照 +\EG @item References +@fref{fctr sqfr}, +\JP @fref{項順序の設定}. +\EG @fref{Setting term orderings}. +@end table + +\JP @node primedec_mod,,, グレブナ基底に関する函数 +\EG @node primedec_mod,,, Functions for Groebner basis computation +@subsection @code{primedec_mod} +@findex primedec_mod + +@table @t +@item primedec_mod(@var{plist},@var{vlist},@var{ord},@var{mod},@var{strategy}) +\JP :: イデアルの分解 +\EG :: Computes decompositions of ideals over small finite fields. +@end table + +@table @var +@item return +@itemx plist +\JP 多項式リスト +\EG list of polynomials +@item vlist +\JP 変数リスト +\EG list of variables +@item ord +\JP 数, リストまたは行列 +\EG number, list or matrix +@item mod +\JP 正整数 +\EG positive integer +@item strategy +\JP 整数 +\EG integer +@end table + +@itemize @bullet +\BJP +@item +@code{primedec_mod()} は @samp{primdec_mod} +で定義されている. @code{[Yokoyama]} の素イデアル分解アルゴリズム +を実装している. +@item +@code{primedec_mod()} は有限体上でのイデアルの +根基の素イデアル分解を行い, 素イデアルのリストを返す. +@item +@code{primedec_mod()} は, GF(@var{mod}) 上での分解を与える. +結果の各成分の生成元は, 整数係数多項式である. +@item +結果において, 多項式リストとして表示されている各イデアルは全て +[@var{vlist},@var{ord}] で指定される項順序に関するグレブナ基底である. +@item +@var{strategy} が 0 でないとき, incremental に component の共通 +部分を計算することによる early termination を行う. 一般に, +イデアルの次元が高い場合に有効だが, 0 次元の場合など, 次元が小さい +場合には overhead が大きい場合がある. +@item +計算途中で内部情報を見たい場合には、 +前もって @code{dp_gr_print(2)} を実行しておけばよい. +\E +\BEG +@item +Function @code{primedec_mod()} +is defined in @samp{primdec_mod} and implements the prime decomposition +algorithm in @code{[Yokoyama]}. +@item +@code{primedec_mod()} +is the function for prime ideal decomposition +of the radical of a polynomial ideal over small finite field, +and they return a list of prime ideals, which are associated primes +of the input ideal. +@item +@code{primedec_mod()} gives the decomposition over GF(@var{mod}). +The generators of each resulting component consists of integral polynomials. +@item +Each resulting component is a Groebner basis with respect to +a term order specified by [@var{vlist},@var{ord}]. +@item +If @var{strategy} is non zero, then the early termination strategy +is tried by computing the intersection of obtained components +incrementally. In general, this strategy is useful when the krull +dimension of the ideal is high, but it may add some overhead +if the dimension is small. +@item +If you want to see internal information during the computation, +execute @code{dp_gr_print(2)} in advance. +\E +@end itemize + +@example +[0] load("primdec_mod")$ +[246] PP444=[x^8+x^2+t,y^8+y^2+t,z^8+z^2+t]$ +[247] primedec_mod(PP444,[x,y,z,t],0,2,1); +[[y+z,x+z,z^8+z^2+t],[x+y,y^2+y+z^2+z+1,z^8+z^2+t], +[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], +[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], +[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], +[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]] +[248] +@end example + +@table @t +\JP @item 参照 +\EG @item References +@fref{modfctr}, +@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}, +\JP @fref{項順序の設定}. +\EG @fref{Setting term orderings}, +@fref{dp_gr_flags dp_gr_print}. +@end table + +\JP @node bfunction bfct generic_bfct ann ann0,,, グレブナ基底に関する函数 +\EG @node bfunction bfct generic_bfct ann ann0,,, Functions for Groebner basis computation +@subsection @code{bfunction}, @code{bfct}, @code{generic_bfct}, @code{ann}, @code{ann0} +@findex bfunction +@findex bfct +@findex generic_bfct +@findex ann +@findex ann0 + +@table @t +@item bfunction(@var{f}) +@itemx bfct(@var{f}) +@itemx generic_bfct(@var{plist},@var{vlist},@var{dvlist},@var{weight}) +\JP :: @var{b} 関数の計算 +\EG :: Computes the global @var{b} function of a polynomial or an ideal +@item ann(@var{f}) +@itemx ann0(@var{f}) +\JP :: 多項式のベキの annihilator の計算 +\EG :: Computes the annihilator of a power of polynomial +@end table + +@table @var +@item return +\JP 多項式またはリスト +\EG polynomial or list +@item f +\JP 多項式 +\EG polynomial +@item plist +\JP 多項式リスト +\EG list of polynomials +@item vlist dvlist +\JP 変数リスト +\EG list of variables +@end table + +@itemize @bullet +\BJP +@item @samp{bfct} で定義されている. +@item @code{bfunction(@var{f})}, @code{bfct(@var{f})} は多項式 @var{f} の global @var{b} 関数 @code{b(s)} を +計算する. @code{b(s)} は, Weyl 代数 @code{D} 上の一変数多項式環 @code{D[s]} +の元 @code{P(x,s)} が存在して, @code{P(x,s)f^(s+1)=b(s)f^s} を満たすような +多項式 @code{b(s)} の中で, 次数が最も低いものである. +@item @code{generic_bfct(@var{f},@var{vlist},@var{dvlist},@var{weight})} +は, @var{plist} で生成される @code{D} の左イデアル @code{I} の, +ウェイト @var{weight} に関する global @var{b} 関数を計算する. +@var{vlist} は @code{x}-変数, @var{vlist} は対応する @code{D}-変数 +を順に並べる. +@item @code{bfunction} と @code{bfct} では用いているアルゴリズムが +異なる. どちらが高速かは入力による. +@item @code{ann(@var{f})} は, @code{@var{f}^s} の annihilator ideal +の生成系を返す. @code{ann(@var{f})} は, @code{[@var{a},@var{list}]} +なるリストを返す. ここで, @var{a} は @var{f} の @var{b} 関数の最小整数根, +@var{list} は @code{ann(@var{f})} の結果の @code{s}$ に, @var{a} を +代入したものである. +@item 詳細については, [Saito,Sturmfels,Takayama] を見よ. +\E +\BEG +@item These functions are defined in @samp{bfct}. +@item @code{bfunction(@var{f})} and @code{bfct(@var{f})} compute the global @var{b}-function @code{b(s)} of +a polynomial @var{f}. +@code{b(s)} is a polynomial of the minimal degree +such that there exists @code{P(x,s)} in D[s], which is a polynomial +ring over Weyl algebra @code{D}, and @code{P(x,s)f^(s+1)=b(s)f^s} holds. +@item @code{generic_bfct(@var{f},@var{vlist},@var{dvlist},@var{weight})} +computes the global @var{b}-function of a left ideal @code{I} in @code{D} +generated by @var{plist}, with respect to @var{weight}. +@var{vlist} is the list of @code{x}-variables, +@var{vlist} is the list of corresponding @code{D}-variables. +@item @code{bfunction(@var{f})} and @code{bfct(@var{f})} implement +different algorithms and the efficiency depends on inputs. +@item @code{ann(@var{f})} returns the generator set of the annihilator +ideal of @code{@var{f}^s}. +@code{ann(@var{f})} returns a list @code{[@var{a},@var{list}]}, +where @var{a} is the minimal integral root of the global @var{b}-function +of @var{f}, and @var{list} is a list of polynomials obtained by +substituting @code{s} in @code{ann(@var{f})} with @var{a}. +@item See [Saito,Sturmfels,Takayama] for the details. +\E +@end itemize + +@example +[0] load("bfct")$ +[216] bfunction(x^3+y^3+z^3+x^2*y^2*z^2+x*y*z); +-9*s^5-63*s^4-173*s^3-233*s^2-154*s-40 +[217] fctr(@@); +[[-1,1],[s+2,1],[3*s+4,1],[3*s+5,1],[s+1,2]] +[218] F = [4*x^3*dt+y*z*dt+dx,x*z*dt+4*y^3*dt+dy, +x*y*dt+5*z^4*dt+dz,-x^4-z*y*x-y^4-z^5+t]$ +[219] generic_bfct(F,[t,z,y,x],[dt,dz,dy,dx],[1,0,0,0]); +20000*s^10-70000*s^9+101750*s^8-79375*s^7+35768*s^6-9277*s^5 ++1278*s^4-72*s^3 +[220] P=x^3-y^2$ +[221] ann(P); +[2*dy*x+3*dx*y^2,-3*dx*x-2*dy*y+6*s] +[222] ann0(P); +[-1,[2*dy*x+3*dx*y^2,-3*dx*x-2*dy*y-6]] +@end example + +@table @t +\JP @item 参照 +\EG @item References +\JP @fref{Weyl 代数}. +\EG @fref{Weyl algebra}. @end table