===================================================================
RCS file: /home/cvs/OpenXM/src/asir-contrib/packages/doc/Attic/sm1.oxweave,v
retrieving revision 1.8
retrieving revision 1.14
diff -u -p -r1.8 -r1.14
--- OpenXM/src/asir-contrib/packages/doc/Attic/sm1.oxweave	2003/05/18 02:20:21	1.8
+++ OpenXM/src/asir-contrib/packages/doc/Attic/sm1.oxweave	2004/03/05 15:30:50	1.14
@@ -1,12 +1,13 @@
-/*$OpenXM: OpenXM/src/asir-contrib/packages/doc/sm1.oxweave,v 1.7 2003/05/04 08:37:40 takayama Exp $ */
+/*$OpenXM: OpenXM/src/asir-contrib/packages/doc/sm1.oxweave,v 1.13 2003/07/28 01:36:36 takayama Exp $ */
 
 /*&C-texi
 @c DO NOT EDIT THIS FILE   oxphc.texi
 */
 /*&C-texi
 @node SM1 Functions,,, Top
+
 */
-/*&jp-texi
+/*&ja
 @chapter SM1 $BH!?t(B
 
 $B$3$N@a$G$O(B sm1 $B$N(B ox $B%5!<%P(B @code{ox_sm1_forAsir}
@@ -32,7 +33,7 @@ $X$ $B$OJ?LL$KFs$D$N7j$r$"$1$?6u4V$G$"$k$N$G(B, $BE
 $B<!85$rEz$($k(B.
 @end tex
 */
-/*&eg-texi
+/*&en
 @chapter SM1 Functions
 
 This chapter describes  interface functions for
@@ -86,16 +87,15 @@ Grobner Deformations of Hypergeometric Differential Eq
 See the appendix.
 */
 
-/*
+/*&C-texi
 @menu
 * ox_sm1_forAsir::
 * sm1.start::
-* sm1::
+* sm1.sm1::
 * sm1.push_int0::
 * sm1.gb::
 * sm1.deRham::
 * sm1.hilbert::
-* hilbert_polynomial::
 * sm1.genericAnn::
 * sm1.wTensor0::
 * sm1.reduction::
@@ -109,18 +109,23 @@ See the appendix.
 * sm1.rank::
 * sm1.auto_reduce::
 * sm1.slope::
+* sm1.ahg::
+* sm1.bfunction::
+* sm1.generalized_bfunction::
+* sm1.restriction::
+* sm1.saturation::
 @end menu
 */
 
-/*&jp-texi
+/*&ja
 @section @code{ox_sm1_forAsir} $B%5!<%P(B
 */ 
-/*&eg-texi
+/*&en
 @section @code{ox_sm1_forAsir} Server
 */ 
 
-/*&eg-texi
-@node ox_sm1_forAsir,,, Top
+/*&en
+@node ox_sm1_forAsir,,, SM1 Functions
 @subsection @code{ox_sm1_forAsir}
 @findex ox_sm1_forAsir
 @table @t
@@ -150,8 +155,8 @@ See the appendix.
 to build your own server by reading @code{sm1} macros.
 @end itemize
 */
-/*&jp-texi
-@node ox_sm1_forAsir,,, Top
+/*&ja
+@node ox_sm1_forAsir,,, SM1 Functions
 @subsection @code{ox_sm1_forAsir}
 @findex ox_sm1_forAsir
 @table @t
@@ -184,14 +189,14 @@ to build your own server by reading @code{sm1} macros.
 */
 
 
-/*&jp-texi
+/*&ja
 @section $BH!?t0lMw(B
 */ 
-/*&eg-texi
+/*&en
 @section Functions
 */ 
 
-/*&eg-texi
+/*&en
 @c sort-sm1.start
 @node sm1.start,,, SM1 Functions
 @subsection @code{sm1.start}
@@ -233,7 +238,7 @@ The descriptor can be obtained by the function
 @code{sm1.get_Sm1_proc()}.
 @end itemize
 */
-/*&jp-texi
+/*&ja
 @c sort-sm1.start
 @node sm1.start,,, SM1 Functions
 @subsection @code{sm1.start}
@@ -290,14 +295,14 @@ a*da+1                  
 a*da
 @end example
 */
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
     @code{ox_launch}, @code{sm1.push_int0}, @code{sm1.push_poly0},
     @code{ord}
 @end table
 */
-/*&jp-texi
+/*&ja
 @table @t
 @item $B;2>H(B
     @code{ox_launch}, @code{sm1.push_int0}, @code{sm1.push_poly0},
@@ -307,13 +312,13 @@ a*da
 
 
 
-/*&eg-texi
+/*&en
 @c sort-sm1
-@node sm1,,, SM1 Functions
-@subsection @code{sm1}
-@findex sm1
+@node sm1.sm1,,, SM1 Functions
+@subsection @code{sm1.sm1}
+@findex sm1.sm1
 @table @t
-@item sm1(@var{p},@var{s})
+@item sm1.sm1(@var{p},@var{s})
 ::  ask the @code{sm1} server to execute the command string @var{s}.
 @end table
 
@@ -329,14 +334,15 @@ String
 @itemize @bullet
 @item  It asks the @code{sm1} server of the descriptor number @var{p}
 to execute the command string @var{s}.
+(In the next example, the descriptor number is 0.)
 @end itemize
 */
-/*&jp-texi
-@node sm1,,, SM1 Functions
-@subsection @code{sm1}
-@findex sm1
+/*&ja
+@node sm1.sm1,,, SM1 Functions
+@subsection @code{sm1.sm1}
+@findex sm1.sm1
 @table @t
-@item sm1(@var{p},@var{s})
+@item sm1.sm1(@var{p},@var{s})
 ::  $B%5!<%P(B @code{sm1} $B$K%3%^%s%INs(B @var{s} $B$r<B9T$7$F$/$l$k$h$&$K$?$N$`(B.
 @end table
 
@@ -352,31 +358,29 @@ to execute the command string @var{s}.
 @itemize @bullet
 @item  $B<1JLHV9f(B @var{p} $B$N(B @code{sm1} $B%5!<%P$K(B
 $B%3%^%s%INs(B @var{s} $B$r<B9T$7$F$/$l$k$h$&$KMj$`(B.
+ ($B<!$NNc$G$O(B, $B<1JLHV9f(B 0)
 @end itemize
 */
 /*&C-texi
 @example
-[261] sm1(0," ( (x-1)^2 ) . ");
+[261] sm1.sm1(0," ( (x-1)^2 ) . ");
 0
 [262] ox_pop_string(0);
 x^2-2*x+1
-[263] sm1(0," [(x*(x-1))  [(x)]] deRham ");
+[263] sm1.sm1(0," [(x*(x-1))  [(x)]] deRham ");
 0
 [264] ox_pop_string(0);
 [1 , 2]
 @end example
 */
-def sm1(P,F) {
-  ox_execute_string(P,F);
-  sm1flush(P);
-}
-/*&jp-texi
+
+/*&ja
 @table @t
 @item $B;2>H(B
     @code{sm1.start}, @code{ox_push_int0}, @code{sm1.push_poly0}, @code{sm1.get_Sm1_proc()}. 
 @end table
 */
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
     @code{sm1.start}, @code{ox_push_int0}, @code{sm1.push_poly0}, @code{sm1.get_Sm1_proc()}. 
@@ -384,7 +388,7 @@ def sm1(P,F) {
 */
 
 
-/*&eg-texi
+/*&en
 @c sort-sm1.push_int0
 @node sm1.push_int0,,, SM1 Functions
 @subsection @code{sm1.push_int0}
@@ -422,7 +426,7 @@ Note that @code{ox_push_cmo(@var{p},1234)} send the bi
 @item In other cases,  @code{ox_push_cmo} is called without data conversion.
 @end itemize
 */
-/*&jp-texi
+/*&ja
 @c sort-sm1.push_int0
 @node sm1.push_int0,,, SM1 Functions
 @subsection @code{sm1.push_int0}
@@ -478,13 +482,13 @@ x*dx+1
 [1,2]
 @end example
 */
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
     @code{ox_push_cmo}
 @end table
 */
-/*&jp-texi
+/*&ja
 @table @t
 @item Reference
     @code{ox_push_cmo}
@@ -493,10 +497,9 @@ x*dx+1
 
 
 
-/*&eg-texi
+/*&en
 @c sort-sm1.gb
 @node sm1.gb,,, SM1 Functions
-@node sm1.gb_d,,, SM1 Functions
 @subsection @code{sm1.gb}
 @findex sm1.gb
 @findex sm1.gb_d
@@ -551,10 +554,9 @@ List
    the polynomials are dehomogenized (,i.e., h is set to 1).
 @end itemize
 */
-/*&jp-texi
+/*&ja
 @c sort-sm1.gb
 @node sm1.gb,,, SM1 Functions
-@node sm1.gb_d,,, SM1 Functions
 @subsection @code{sm1.gb}
 @findex sm1.gb
 @findex sm1.gb_d
@@ -608,7 +610,7 @@ List
 [[x*dx+y*dy-1,y^2*dy^2+2],[x*dx,y^2*dy^2]]
 @end example
 */
-/*&eg-texi
+/*&en
 In the example above,
 @tex the set $\{ x \partial_x + y \partial_y -1,
                  y^2 \partial_y^2+2\}$ 
@@ -619,7 +621,7 @@ The set $\{x \partial_x, y^2 \partial_y\}$ is the lead
 (the initial monominals) of the Gr\"obner basis.
 @end tex
 */
-/*&jp-texi
+/*&ja
 $B>e$NNc$K$*$$$F(B,
 @tex $B=89g(B $\{ x \partial_x + y \partial_y -1,
                  y^2 \partial_y^2+2\}$ 
@@ -637,7 +639,7 @@ graded reverse lexicographic order $B$K4X$9$k%0%l%V%J
 [[dx+dy^3-4*dy,-dy^4+4*dy^2-1],[dx,-dy^4]]
 @end example
 */
-/*&eg-texi
+/*&en
 In the example above, two monomials 
 @tex
 $m = x^a y^b \partial_x^c \partial_y^d$ and 
@@ -650,7 +652,7 @@ compared by the reverse lexicographic order
 (i.e., if $50c+2d+a = 50c'+2d'+a'$, then use the reverse lexicogrpahic order).
 @end tex
 */
-/*&jp-texi
+/*&ja
 $B>e$NNc$K$*$$$FFs$D$N%b%N%_%"%k(B
 @tex
 $m = x^a y^b \partial_x^c \partial_y^d$ $B$*$h$S(B
@@ -698,13 +700,13 @@ $m' = x^{a'} y^{b'} \partial_x^{c'} \partial_y^{d'}$
 @end example
 */
 
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
     @code{sm1.reduction}, @code{sm1.rat_to_p}
 @end table
 */
-/*&jp-texi
+/*&ja
 @table @t
 @item $B;2>H(B
     @code{sm1.reduction}, @code{sm1.rat_to_p}
@@ -713,7 +715,7 @@ $m' = x^{a'} y^{b'} \partial_x^{c'} \partial_y^{d'}$
 
 
 
-/*&eg-texi
+/*&en
 @c sort-sm1.deRham
 @node sm1.deRham,,, SM1 Functions
 @subsection @code{sm1.deRham}
@@ -758,7 +760,7 @@ mode. So, it is strongly recommended to execute the co
 @code{ox_shutdown(sm1.get_Sm1_proc());} to interrupt and restart the server.
 @end itemize
 */
-/*&jp-texi
+/*&ja
 @c sort-sm1.deRham
 @node sm1.deRham,,, SM1 Functions
 @subsection @code{sm1.deRham}
@@ -810,7 +812,7 @@ mode. So, it is strongly recommended to execute the co
 [1,2]
 @end example
 */
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
     @code{sm1.start}, @code{deRham} (sm1 command)
@@ -820,7 +822,7 @@ mode. So, it is strongly recommended to execute the co
     Journal of pure and applied algebra 139 (1999), 201--233.
 @end table
 */
-/*&jp-texi
+/*&ja
 @table @t
 @item $B;2>H(B
     @code{sm1.start}, @code{deRham} (sm1 command)
@@ -834,7 +836,7 @@ mode. So, it is strongly recommended to execute the co
 
 
 
-/*&eg-texi
+/*&en
 @c sort-sm1.hilbert
 @node sm1.hilbert,,, SM1 Functions
 @subsection @code{sm1.hilbert}
@@ -876,7 +878,7 @@ List
    polynomials in @code{sm1} is  slower than in @code{asir}.
 @end itemize
 */
-/*&jp-texi
+/*&ja
 @c sort-sm1.hilbert
 @node sm1.hilbert,,, SM1 Functions
 @subsection @code{sm1.hilbert}
@@ -945,13 +947,13 @@ List
 @end example
 */
 
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
     @code{sm1.start}, @code{sm1.gb}, @code{longname}
 @end table
 */
-/*&jp-texi
+/*&ja
 @table @t
 @item $B;2>H(B
     @code{sm1.start}, @code{sm1.gb}, @code{longname}
@@ -959,7 +961,7 @@ List
 */
 
 
-/*&eg-texi
+/*&en
 @c sort-sm1.genericAnn
 @node sm1.genericAnn,,, SM1 Functions
 @subsection @code{sm1.genericAnn}
@@ -988,7 +990,7 @@ List
     @var{f} is a polynomial in the variables @code{rest}(@var{v}).
 @end itemize
 */
-/*&jp-texi
+/*&ja
 @c sort-sm1.genericAnn
 @node sm1.genericAnn,,, SM1 Functions
 @subsection @code{sm1.genericAnn}
@@ -1024,13 +1026,13 @@ List
 [-x*dx-y*dy-z*dz+3*s,z^2*dy-y^2*dz,z^2*dx-x^2*dz,y^2*dx-x^2*dy]
 @end example
 */
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
     @code{sm1.start}
 @end table
 */
-/*&jp-texi
+/*&ja
 @table @t
 @item $B;2>H(B
     @code{sm1.start}
@@ -1039,7 +1041,7 @@ List
 
 
 
-/*&eg-texi
+/*&en
 @c sort-sm1.wTensor0
 @node sm1.wTensor0,,, SM1 Functions
 @subsection @code{sm1.wTensor0}
@@ -1080,7 +1082,7 @@ the inputs @var{f} and @var{g} are left ideals of D.
 @end itemize
 */
 
-/*&jp-texi
+/*&ja
 @c sort-sm1.wTensor0
 @node sm1.wTensor0,,, SM1 Functions
 @subsection @code{sm1.wTensor0}
@@ -1131,7 +1133,7 @@ the inputs @var{f} and @var{g} are left ideals of D.
 
 
 
-/*&eg-texi
+/*&en
 @c sort-sm1.reduction
 @node sm1.reduction,,, SM1 Functions
 @subsection @code{sm1.reduction}
@@ -1169,7 +1171,7 @@ sm1.reduction_d(P,F,G) and sm1.reduction_noH_d(P,F,G)
 are for distributed polynomials.
 @end itemize
 */
-/*&jp-texi
+/*&ja
 @node sm1.reduction,,, SM1 Functions
 @subsection @code{sm1.reduction}
 @findex sm1.reduction
@@ -1216,21 +1218,21 @@ sm1.reduction_d(P,F,G) $B$*$h$S(B sm1.reduction_noH_
 [0,1,[-y^2+4,-x+y^3-4*y],[y^4-4*y^2+1,x+y^3-4*y]]
 @end example
 */
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
-    @code{sm1.start}, @code{Sm1_find_proc}, @code{d_true_nf}
+    @code{sm1.start}, @code{d_true_nf}
 @end table
 */
-/*&jp-texi
+/*&ja
 @table @t
 @item $B;2>H(B
-    @code{sm1.start}, @code{sm1_find_proc}, @code{d_true_nf}
+    @code{sm1.start}, @code{d_true_nf}
 @end table
 */
 
 
-/*&eg-texi
+/*&en
 @node sm1.xml_tree_to_prefix_string,,, SM1 Functions
 @subsection @code{sm1.xml_tree_to_prefix_string}
 @findex sm1.xml_tree_to_prefix_string
@@ -1258,7 +1260,7 @@ asir has not yet understood this CMO.
 command search path.)
 @end itemize
 */
-/*&jp-texi
+/*&ja
 @node sm1.xml_tree_to_prefix_string,,, SM1 Functions
 @subsection @code{sm1.xml_tree_to_prefix_string}
 @findex sm1.xml_tree_to_prefix_string
@@ -1302,13 +1304,13 @@ Trying to connect to the server... Done.
 basic_plus(basic_times(basic_power(x,4),1),basic_times(basic_power(x,0),-1))
 @end example
 */
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
     @code{om_*}, @code{OpenXM/src/OpenMath}, @code{eval_str}
 @end table
 */
-/*&jp-texi
+/*&ja
 @table @t
 @item $B;2>H(B
     @code{om_*}, @code{OpenXM/src/OpenMath},  @code{eval_str}
@@ -1318,10 +1320,9 @@ basic_plus(basic_times(basic_power(x,4),1),basic_times
 
 
 
-/*&eg-texi
+/*&en
 @c sort-sm1.syz
 @node sm1.syz,,, SM1 Functions
-@node sm1.syz_d,,, SM1 Functions
 @subsection @code{sm1.syz}
 @findex sm1.syz
 @findex sm1.syz_d
@@ -1348,7 +1349,7 @@ Here @var{s} is the syzygy of @var{f} in the ring of d
 operators with the variable @var{v}. 
 @var{g} is a Groebner basis of @var{f} with the weight vector @var{w},
 and @var{m} is a matrix that translates the input matrix @var{f} to the Gr\"obner
-basis @var {g}.
+basis @var{g}.
 @var{t} is the syzygy of the Gr\"obner basis @var{g}.
 In summary, @var{g} = @var{m} @var{f} and
 @var{s} @var{f} = 0 hold as matrices.
@@ -1362,10 +1363,9 @@ In summary, @var{g} = @var{m} @var{f} and
    The homogenization variable h is automatically added.
 @end itemize
 */
-/*&jp-texi
+/*&ja
 @c sort-sm1.syz
 @node sm1.syz,,, SM1 Functions
-@node sm1.syz_d,,, SM1 Functions
 @subsection @code{sm1.syz}
 @findex sm1.syz
 @findex sm1.syz_d
@@ -1427,7 +1427,7 @@ syzygy $B$G$"$k(B.
 
 
 
-/*&eg-texi
+/*&en
 @node sm1.mul,,, SM1 Functions
 @subsection @code{sm1.mul}
 @findex sm1.mul
@@ -1453,7 +1453,7 @@ List
 @end itemize
 */
 
-/*&jp-texi
+/*&ja
 @node sm1.mul,,, SM1 Functions
 @subsection @code{sm1.mul}
 @findex sm1.mul
@@ -1497,7 +1497,7 @@ x+2*y
 	
  
 
-/*&eg-texi
+/*&en
 @node sm1.distraction,,, SM1 Functions
 @subsection @code{sm1.distraction}
 @findex sm1.distraction
@@ -1528,7 +1528,7 @@ See Saito, Sturmfels, Takayama : Grobner Deformations 
 @end itemize
 */
 
-/*&jp-texi
+/*&ja
 @node sm1.distraction,,, SM1 Functions
 
 @subsection @code{sm1.distraction}
@@ -1575,14 +1575,14 @@ x^2+3*x+2
 @end example
 */
 
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
     @code{distraction2(sm1)}, 
 @end table
 */
 
-/*&jp-texi
+/*&ja
 @table @t
 @item $B;2>H(B
     @code{distraction2(sm1)}, 
@@ -1591,7 +1591,7 @@ x^2+3*x+2
 
 
 
-/*&eg-texi
+/*&en
 @node sm1.gkz,,, SM1 Functions
 @subsection @code{sm1.gkz}
 @findex sm1.gkz
@@ -1616,7 +1616,7 @@ List
 @end itemize
 */
 
-/*&jp-texi
+/*&ja
 @node sm1.gkz,,, SM1 Functions
 @subsection @code{sm1.gkz}
 @findex sm1.gkz
@@ -1655,7 +1655,7 @@ List
 
 
 
-/*&eg-texi
+/*&en
 @node sm1.appell1,,, SM1 Functions
 @subsection @code{sm1.appell1}
 @findex sm1.appell1
@@ -1682,7 +1682,7 @@ The parameters a, c, b1, ..., bn may be rational numbe
 @end itemize
 */
 
-/*&jp-texi
+/*&ja
 @node sm1.appell1,,, SM1 Functions
 @subsection @code{sm1.appell1}
 @findex sm1.appell1
@@ -1739,7 +1739,7 @@ F_D(a,b1,b2,...,bn,c;x1,...,xn)
 
 */
 
-/*&eg-texi
+/*&en
 @node sm1.appell4,,, SM1 Functions
 @subsection @code{sm1.appell4}
 @findex sm1.appell4
@@ -1766,7 +1766,7 @@ The parameters a, b, c1, ..., cn may be rational numbe
 @end itemize
 */
 
-/*&jp-texi
+/*&ja
 @node sm1.appell4,,, SM1 Functions
 @subsection @code{sm1.appell4}
 @findex sm1.appell4
@@ -1813,7 +1813,7 @@ F_C(a,b,c1,c2,...,cn;x1,...,xn)
 
 
 
-/*&eg-texi
+/*&en
 @node sm1.rank,,, SM1 Functions
 @subsection @code{sm1.rank}
 @findex sm1.rank
@@ -1842,7 +1842,7 @@ holonomic. It is generally faster than @code{sm1.rank}
 @end itemize
 */
 
-/*&jp-texi
+/*&ja
 @node sm1.rank,,, SM1 Functions
 @subsection @code{sm1.rank}
 @findex sm1.rank
@@ -1893,7 +1893,7 @@ holonomic. It is generally faster than @code{sm1.rank}
 */
 
 
-/*&eg-texi
+/*&en
 @node sm1.auto_reduce,,, SM1 Functions
 @subsection @code{sm1.auto_reduce}
 @findex sm1.auto_reduce
@@ -1919,7 +1919,7 @@ Grobner bases.  This is the default.
 @end itemize
 */
 
-/*&jp-texi
+/*&ja
 @node sm1.auto_reduce,,, SM1 Functions
 @subsection @code{sm1.auto_reduce}
 @findex sm1.auto_reduce
@@ -1947,7 +1947,7 @@ reduced $B%0%l%V%J4pDl$H$O$+$.$i$J$$(B. $B$3$A$i$,%
 
   
 
-/*&eg-texi
+/*&en
 @node sm1.slope,,, SM1 Functions
 @subsection @code{sm1.slope}
 @findex sm1.slope
@@ -1992,7 +1992,7 @@ of the slopes are returned.
 
 */
 
-/*&jp-texi
+/*&ja
 @node sm1.slope,,, SM1 Functions
 @subsection @code{sm1.slope}
 @findex sm1.slope
@@ -2054,25 +2054,25 @@ Slope $B$N@dBPCM$rLa$9(B.
 @end example
 
 */
-/*&eg-texi
+/*&en
 @table @t
 @item Reference
-    @code{sm_gb}
+    @code{sm.gb}
 @end table
 */
-/*&jp-texi
+/*&ja
 @table @t
 @item $B;2>H(B
-    @code{sm_gb}
+    @code{sm.gb}
 @end table
 */
 
 
-/*&eg-texi
+/*&en
 @include sm1-auto-en.texi
 */
 
-/*&jp-texi
+/*&ja
 @include sm1-auto-ja.texi
 */