===================================================================
RCS file: /home/cvs/OpenXM/src/asir-doc/parts/appendix.texi,v
retrieving revision 1.7
retrieving revision 1.14
diff -u -p -r1.7 -r1.14
--- OpenXM/src/asir-doc/parts/appendix.texi	2001/03/16 05:18:04	1.7
+++ OpenXM/src/asir-doc/parts/appendix.texi	2003/04/28 03:09:23	1.14
@@ -1,4 +1,4 @@
-@comment $OpenXM: OpenXM/src/asir-doc/parts/appendix.texi,v 1.6 2000/03/17 08:27:28 noro Exp $
+@comment $OpenXM: OpenXM/src/asir-doc/parts/appendix.texi,v 1.13 2003/04/24 08:13:24 noro Exp $
 \BJP
 @node 付録,,, Top
 @appendix 付録
@@ -80,8 +80,8 @@
     <list>
 \E
 @end example
-\JP (@xref{さまざまな式})
-\EG (@xref{various expressions})
+\JP (@xref{さまざまな式}.)
+\EG (@xref{various expressions}.)
 
 @example
 \BJP
@@ -133,7 +133,7 @@
 \E
 \BEG
 <option>:
-    Character sequence beginning with an alphabetical letter @samp{=} <expression>
+    Character sequence beginning with an alphabetical letter @samp{=} <expr>
 \E
 @end example
 
@@ -174,8 +174,8 @@
    (X,Y,Japan etc.)
 \E
 @end example
-\JP (@xref{変数および不定元})
-\EG (@xref{variables and indeterminates})
+\JP (@xref{変数および不定元}.)
+\EG (@xref{variables and indeterminates}.)
 
 @example
 \BJP
@@ -215,8 +215,8 @@
    (a,bCD,c1_2 etc.)
 \E
 @end example
-\JP (@xref{変数および不定元})
-\EG (@xref{variables and indeterminates})
+\JP (@xref{変数および不定元}.)
+\EG (@xref{variables and indeterminates}.)
 
 @example
 \BJP
@@ -234,8 +234,8 @@
    <complex number>
 \E
 @end example
-\JP (@xref{数の型})
-\EG (@xref{Types of numbers})
+\JP (@xref{数の型}.)
+\EG (@xref{Types of numbers}.)
 
 @example
 \JP <有理数>:
@@ -254,8 +254,8 @@
 \EG <algebraic number>: 
    newalg(x^2+1), alg(0)^2+1
 @end example
-\JP (@xref{代数的数に関する演算})
-\EG (@xref{Algebraic numbers})
+\JP (@xref{代数的数に関する演算}.)
+\EG (@xref{Algebraic numbers}.)
 
 @example
 \JP <複素数>:
@@ -284,8 +284,8 @@
    @samp{<<} <expr list> @samp{>>}
 \E
 @end example
-\JP (@xref{グレブナ基底の計算})
-\EG (@xref{Groebner basis computation})
+\JP (@xref{グレブナ基底の計算}.)
+\EG (@xref{Groebner basis computation}.)
 
 @example
 \BJP
@@ -321,8 +321,8 @@
     @samp{end(quit)} <terminator>
 \E
 @end example
-\JP (@xref{文})
-\EG (@xref{statements})
+\JP (@xref{文}.)
+\EG (@xref{statements}.)
 
 @example
 \JP <終端>:
@@ -386,14 +386,14 @@ Here, we explain some of them.
 
 @table @samp
 @item fff
-\JP 大標数素体および標数 2 の有限体上の一変数多項式因数分解 (@xref{有限体に関する演算})
-\EG Univariate factorizer over large finite fields (@xref{Finite fields})
+\JP 大標数素体および標数 2 の有限体上の一変数多項式因数分解 (@xref{有限体に関する演算}.)
+\EG Univariate factorizer over large finite fields (@xref{Finite fields}.)
 @item gr
-\JP グレブナ基底計算パッケージ.  (@xref{グレブナ基底の計算})
-\EG Groebner basis package.  (@xref{Groebner basis computation})
+\JP グレブナ基底計算パッケージ.  (@xref{グレブナ基底の計算}.)
+\EG Groebner basis package.  (@xref{Groebner basis computation}.)
 @item sp
-\JP 代数的数の演算および因数分解, 最小分解体. (@xref{代数的数に関する演算})
-\EG Operations over algebraic numbers and factorization, Splitting fields. (@xref{Algebraic numbers})
+\JP 代数的数の演算および因数分解, 最小分解体. (@xref{代数的数に関する演算}.)
+\EG Operations over algebraic numbers and factorization, Splitting fields. (@xref{Algebraic numbers}.)
 @item alpi
 @itemx bgk
 @itemx cyclic
@@ -401,10 +401,10 @@ Here, we explain some of them.
 @itemx kimura
 \JP グレブナ基底計算において, ベンチマークその他で用いられる例. 
 \EG Example polynomial sets for benchmarks of Groebner basis computation.
-(@xref{katsura hkatsura cyclic hcyclic})
+(@xref{katsura hkatsura cyclic hcyclic}.)
 @item defs.h
-\JP いくつかのマクロ定義. (@xref{プリプロセッサ})
-\EG Macro definitions. (@xref{preprocessor})
+\JP いくつかのマクロ定義. (@xref{プリプロセッサ}.)
+\EG Macro definitions. (@xref{preprocessor}.)
 @item fctrtest
 \BJP
 整数上の多項式の因数分解のテスト. REDUCE の @samp{factor.tst} および
@@ -423,13 +423,13 @@ correctly.
 @item fctrdata
 \BJP
 @samp{fctrtest} で使われている例を含む, 因数分解テスト用の例. 
-@code{Alg[]} に収められている例は, @code{af()} (@xref{asq af af_noalg}) 用の例である. 
+@code{Alg[]} に収められている例は, @code{af()} (@ref{asq af af_noalg}) 用の例である. 
 \E
 \BEG
 This contains example polynomials for factorization.  It includes
 polynomials used in @samp{fctrtest}.
 Polynomials contained in vector @code{Alg[]} is for the algebraic
-factorization @code{af()} (@xref{asq af af_noalg}).
+factorization @code{af()}. (@xref{asq af af_noalg}.)
 \E
 @example
 [45] load("sp")$
@@ -440,20 +440,22 @@ factorization @code{af()} (@xref{asq af af_noalg}).
 x^9-15*x^6-87*x^3-125
 0msec
 [177] af(Alg[5],[newalg(Alg[5])]);
-[[1,1],[75*x^2+(10*#0^7-175*#0^4-470*#0)*x+(3*#0^8-45*#0^5-261*#0^2),1],
-[75*x^2+(-10*#0^7+175*#0^4+395*#0)*x+(3*#0^8-45*#0^5-261*#0^2),1],
-[25*x^2+(25*#0)*x+(#0^8-15*#0^5-87*#0^2),1],[x^2+(#0)*x+(#0^2),1],
-[x+(-#0),1]]
+[[1,1],[75*x^2+(10*#0^7-175*#0^4-470*#0)*x
++(3*#0^8-45*#0^5-261*#0^2),1],
+[75*x^2+(-10*#0^7+175*#0^4+395*#0)*x
++(3*#0^8-45*#0^5-261*#0^2),1],
+[25*x^2+(25*#0)*x+(#0^8-15*#0^5-87*#0^2),1],
+[x^2+(#0)*x+(#0^2),1],[x+(-#0),1]]
 3.600sec + gc : 1.040sec
 @end example
 @item ifplot
 \BJP
-描画 (@xref{ifplot conplot plot plotover}) のための例. @code{IS[]} には有名な
+描画 (@ref{ifplot conplot plot polarplot plotover}) のための例. @code{IS[]} には有名な
 曲線の例, 変数 @code{H, D, C, S} にはトランプのハート, ダイヤ, クラブ, 
 スペード (らしき) 曲線の例が入っている. 
 \E
 \BEG
-Examples for plotting (@xref{ifplot conplot plot plotover}).
+Examples for plotting. (@xref{ifplot conplot plot polarplot plotover}.)
 Vector @code{IS[]} contains several famous algebraic curves.
 Variables @code{H, D, C, S} contains something like the suits
 (Heart, Diamond, Club, and Spade) of cards.
@@ -480,7 +482,8 @@ is defined.  Its returns a rather complex result.
 [84] load("ratint")$
 [102] ratint(x^6/(x^5+x+1),x);
 [1/2*x^2,
-[[(#2)*log(-140*x+(-2737*#2^2+552*#2-131)),161*t#2^3-23*t#2^2+15*t#2-1],
+[[(#2)*log(-140*x+(-2737*#2^2+552*#2-131)),
+161*t#2^3-23*t#2^2+15*t#2-1],
 [(#1)*log(-5*x+(-21*#1-4)),21*t#1^2+3*t#1+1]]]
 @end example
 \BJP
@@ -513,13 +516,30 @@ result and then summing them up all.
 \E
 @item primdec
 \BJP
-多項式イデアルの準素イデアル分解とその根基の素イデアル分解
+有理数体上の多項式イデアルの準素イデアル分解とその根基の素イデアル分解
 (@pxref{primadec primedec}).
 \E
 \BEG
 Primary ideal decomposition of polynomial ideals and prime compotision
-of radicals (@pxref{primadec primedec}).
+of radicals over the rationals (@pxref{primadec primedec}).
 \E
+@item primdec_mod
+\BJP
+有限体上の多項式イデアルの根基の素イデアル分解
+(@pxref{primedec_mod}).
+\E
+\BEG
+Prime decomposition of radicals of polynomial ideals
+over finite fields (@pxref{primedec_mod}).
+\E
+@item bfct
+\BJP
+b 関数の計算.
+\E
+\BEG
+Computation of b-function.
+\E
+(@pxref{bfunction bfct generic_bfct ann ann0}).
 @end table
 
 \BJP
@@ -594,8 +614,8 @@ available for UNIX commands, including @samp{asir}.
 [[1,1],[x-1,1],[x^4+x^3+x^2+x+1,1]]
 [1] !!                              /* !!+Return                      */
 \BJP
-fctr(x^5-1);                        /* 直前の入力が現れるて編集できる */
-...                                 /* 編集+Return                    */
+fctr(x^5-1);                        /* 直前の入力が現れて編集できる */
+...                                 /* 編集+Return                  */
 \E
 \BEG
 fctr(x^5-1);                        /* The last input appears.        */
@@ -679,6 +699,9 @@ distribution (@code{http://www.math.kobe-u.ac.jp/OpenX
 It is possible to link an @b{Asir} library to use the functionalities of
 @b{Asir} from other programs.
 The necessary libraries are included in the @b{OpenXM} distribution
+@ifhtml
+(<A HREF="http://www.math.kobe-u.ac.jp/OpenXM">OpenXM </A>)
+@end ifhtml
 (@code{http://www.math.kobe-u.ac.jp/OpenXM}).
 At present only the @b{OpenXM} interfaces are available. Here we assume
 that @b{OpenXM} is already installed. In the following 
@@ -1194,6 +1217,10 @@ Proc. ISSAC'92, 387-396.
 Noro, M., Yokoyama, K., "A Modular Method to Compute the Rational Univariate
 Representation of Zero-Dimensional Ideals", 
 J. Symb. Comp. 28/1 (1999), 243-263.
+@item [Saito,Sturmfels,Takayama]
+Saito, M., Sturmfels, B., Takayama, N.,
+"Groebner deformations of hypergeometric differential equations",
+Algorithms and Computation in Mathematics 6, Springer-Verlag (2000).
 @item [Shimoyama,Yokoyama]
 Shimoyama, T., Yokoyama, K.,
 "Localization and primary decomposition of polynomial ideals",
@@ -1205,5 +1232,7 @@ J. Symb. Comp. 20 (1995), 364-397.
 Traverso, C., "Groebner trace algorithms", Proc. ISSAC '88(LNCS 358), 125-138.
 @item [Weber]
 Weber, K., "The accelerated Integer GCD Algorithm", ACM TOMS, 21, 1(1995), 111-122.
+@item [Yokoyama]
+Yokoyama, K., "Prime decomposition of polynomial ideals over finite fields", 
+Proc. ICMS, (2002), 217-227.
 @end table
-