version 1.9, 2003/05/19 05:15:52 |
version 1.13, 2003/07/28 01:36:36 |
|
|
/*$OpenXM: OpenXM/src/asir-contrib/packages/doc/sm1.oxweave,v 1.8 2003/05/18 02:20:21 takayama Exp $ */ |
/*$OpenXM: OpenXM/src/asir-contrib/packages/doc/sm1.oxweave,v 1.12 2003/07/28 01:17:39 takayama Exp $ */ |
|
|
/*&C-texi |
/*&C-texi |
@c DO NOT EDIT THIS FILE oxphc.texi |
@c DO NOT EDIT THIS FILE oxphc.texi |
*/ |
*/ |
/*&C-texi |
/*&C-texi |
@node SM1 Functions,,, Top |
@node SM1 Functions,,, Top |
|
|
*/ |
*/ |
/*&jp-texi |
/*&jp-texi |
@chapter SM1 $BH!?t(B |
@chapter SM1 $BH!?t(B |
Line 86 Grobner Deformations of Hypergeometric Differential Eq |
|
Line 87 Grobner Deformations of Hypergeometric Differential Eq |
|
See the appendix. |
See the appendix. |
*/ |
*/ |
|
|
/* |
/*&C-texi |
@menu |
@menu |
* ox_sm1_forAsir:: |
* ox_sm1_forAsir:: |
* sm1.start:: |
* sm1.start:: |
* sm1:: |
* sm1.sm1:: |
* sm1.push_int0:: |
* sm1.push_int0:: |
* sm1.gb:: |
* sm1.gb:: |
* sm1.deRham:: |
* sm1.deRham:: |
* sm1.hilbert:: |
* sm1.hilbert:: |
* hilbert_polynomial:: |
|
* sm1.genericAnn:: |
* sm1.genericAnn:: |
* sm1.wTensor0:: |
* sm1.wTensor0:: |
* sm1.reduction:: |
* sm1.reduction:: |
Line 109 See the appendix. |
|
Line 109 See the appendix. |
|
* sm1.rank:: |
* sm1.rank:: |
* sm1.auto_reduce:: |
* sm1.auto_reduce:: |
* sm1.slope:: |
* sm1.slope:: |
|
* sm1.ahg:: |
|
* sm1.bfunction:: |
|
* sm1.generalized_bfunction:: |
|
* sm1.restriction:: |
|
* sm1.saturation:: |
@end menu |
@end menu |
*/ |
*/ |
|
|
Line 120 See the appendix. |
|
Line 125 See the appendix. |
|
*/ |
*/ |
|
|
/*&eg-texi |
/*&eg-texi |
@node ox_sm1_forAsir,,, Top |
@node ox_sm1_forAsir,,, SM1 Functions |
@subsection @code{ox_sm1_forAsir} |
@subsection @code{ox_sm1_forAsir} |
@findex ox_sm1_forAsir |
@findex ox_sm1_forAsir |
@table @t |
@table @t |
Line 151 to build your own server by reading @code{sm1} macros. |
|
Line 156 to build your own server by reading @code{sm1} macros. |
|
@end itemize |
@end itemize |
*/ |
*/ |
/*&jp-texi |
/*&jp-texi |
@node ox_sm1_forAsir,,, Top |
@node ox_sm1_forAsir,,, SM1 Functions |
@subsection @code{ox_sm1_forAsir} |
@subsection @code{ox_sm1_forAsir} |
@findex ox_sm1_forAsir |
@findex ox_sm1_forAsir |
@table @t |
@table @t |
|
|
|
|
/*&eg-texi |
/*&eg-texi |
@c sort-sm1 |
@c sort-sm1 |
@node sm1,,, SM1 Functions |
@node sm1.sm1,,, SM1 Functions |
@subsection @code{sm1} |
@subsection @code{sm1.sm1} |
@findex sm1 |
@findex sm1.sm1 |
@table @t |
@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}. |
:: ask the @code{sm1} server to execute the command string @var{s}. |
@end table |
@end table |
|
|
Line 333 to execute the command string @var{s}. |
|
Line 338 to execute the command string @var{s}. |
|
@end itemize |
@end itemize |
*/ |
*/ |
/*&jp-texi |
/*&jp-texi |
@node sm1,,, SM1 Functions |
@node sm1.sm1,,, SM1 Functions |
@subsection @code{sm1} |
@subsection @code{sm1.sm1} |
@findex sm1 |
@findex sm1.sm1 |
@table @t |
@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. |
:: $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 |
@end table |
|
|
Line 358 to execute the command string @var{s}. |
|
Line 363 to execute the command string @var{s}. |
|
*/ |
*/ |
/*&C-texi |
/*&C-texi |
@example |
@example |
[261] sm1(0," ( (x-1)^2 ) . "); |
[261] sm1.sm1(0," ( (x-1)^2 ) . "); |
0 |
0 |
[262] ox_pop_string(0); |
[262] ox_pop_string(0); |
x^2-2*x+1 |
x^2-2*x+1 |
[263] sm1(0," [(x*(x-1)) [(x)]] deRham "); |
[263] sm1.sm1(0," [(x*(x-1)) [(x)]] deRham "); |
0 |
0 |
[264] ox_pop_string(0); |
[264] ox_pop_string(0); |
[1 , 2] |
[1 , 2] |
@end example |
@end example |
*/ |
*/ |
def sm1(P,F) { |
|
ox_execute_string(P,F); |
|
sm1flush(P); |
|
} |
|
/*&jp-texi |
/*&jp-texi |
@table @t |
@table @t |
@item $B;2>H(B |
@item $B;2>H(B |
|
|
/*&eg-texi |
/*&eg-texi |
@c sort-sm1.gb |
@c sort-sm1.gb |
@node sm1.gb,,, SM1 Functions |
@node sm1.gb,,, SM1 Functions |
@node sm1.gb_d,,, SM1 Functions |
|
@subsection @code{sm1.gb} |
@subsection @code{sm1.gb} |
@findex sm1.gb |
@findex sm1.gb |
@findex sm1.gb_d |
@findex sm1.gb_d |
|
|
/*&jp-texi |
/*&jp-texi |
@c sort-sm1.gb |
@c sort-sm1.gb |
@node sm1.gb,,, SM1 Functions |
@node sm1.gb,,, SM1 Functions |
@node sm1.gb_d,,, SM1 Functions |
|
@subsection @code{sm1.gb} |
@subsection @code{sm1.gb} |
@findex sm1.gb |
@findex sm1.gb |
@findex sm1.gb_d |
@findex sm1.gb_d |
Line 1221 sm1.reduction_d(P,F,G) $B$*$h$S(B sm1.reduction_noH_ |
|
Line 1221 sm1.reduction_d(P,F,G) $B$*$h$S(B sm1.reduction_noH_ |
|
/*&eg-texi |
/*&eg-texi |
@table @t |
@table @t |
@item Reference |
@item Reference |
@code{sm1.start}, @code{Sm1_find_proc}, @code{d_true_nf} |
@code{sm1.start}, @code{d_true_nf} |
@end table |
@end table |
*/ |
*/ |
/*&jp-texi |
/*&jp-texi |
@table @t |
@table @t |
@item $B;2>H(B |
@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 |
@end table |
*/ |
*/ |
|
|
Line 1323 basic_plus(basic_times(basic_power(x,4),1),basic_times |
|
Line 1323 basic_plus(basic_times(basic_power(x,4),1),basic_times |
|
/*&eg-texi |
/*&eg-texi |
@c sort-sm1.syz |
@c sort-sm1.syz |
@node sm1.syz,,, SM1 Functions |
@node sm1.syz,,, SM1 Functions |
@node sm1.syz_d,,, SM1 Functions |
|
@subsection @code{sm1.syz} |
@subsection @code{sm1.syz} |
@findex sm1.syz |
@findex sm1.syz |
@findex sm1.syz_d |
@findex sm1.syz_d |
Line 1350 Here @var{s} is the syzygy of @var{f} in the ring of d |
|
Line 1349 Here @var{s} is the syzygy of @var{f} in the ring of d |
|
operators with the variable @var{v}. |
operators with the variable @var{v}. |
@var{g} is a Groebner basis of @var{f} with the weight vector @var{w}, |
@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 |
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}. |
@var{t} is the syzygy of the Gr\"obner basis @var{g}. |
In summary, @var{g} = @var{m} @var{f} and |
In summary, @var{g} = @var{m} @var{f} and |
@var{s} @var{f} = 0 hold as matrices. |
@var{s} @var{f} = 0 hold as matrices. |
Line 1367 In summary, @var{g} = @var{m} @var{f} and |
|
Line 1366 In summary, @var{g} = @var{m} @var{f} and |
|
/*&jp-texi |
/*&jp-texi |
@c sort-sm1.syz |
@c sort-sm1.syz |
@node sm1.syz,,, SM1 Functions |
@node sm1.syz,,, SM1 Functions |
@node sm1.syz_d,,, SM1 Functions |
|
@subsection @code{sm1.syz} |
@subsection @code{sm1.syz} |
@findex sm1.syz |
@findex sm1.syz |
@findex sm1.syz_d |
@findex sm1.syz_d |
Line 2059 Slope $B$N@dBPCM$rLa$9(B. |
|
Line 2057 Slope $B$N@dBPCM$rLa$9(B. |
|
/*&eg-texi |
/*&eg-texi |
@table @t |
@table @t |
@item Reference |
@item Reference |
@code{sm_gb} |
@code{sm.gb} |
@end table |
@end table |
*/ |
*/ |
/*&jp-texi |
/*&jp-texi |
@table @t |
@table @t |
@item $B;2>H(B |
@item $B;2>H(B |
@code{sm_gb} |
@code{sm.gb} |
@end table |
@end table |
*/ |
*/ |
|
|