1.2.5 `sm1.deRham'
------------------

sm1.deRham([F,V]|proc=P)
     ::  ask the server to evaluate the dimensions of the de Rham
     cohomology  groups of C^n - (the zero set of F=0).

RETURN
     List

P
     Number

F
     String or polynomial

V
     List

   * It returns the dimensions of the de Rham cohomology groups     of
     X = C^n \ V(F).     In other words,  it returns       [dim
     H^0(X,C), dim H^1(X,C), dim H^2(X,C), ..., dim H^n(X,C)].

   * V is a list of variables. n = `length(V)'.

   *    `sm1.deRham' requires huge computer resources.      For
     example, `sm1.deRham(0,[x*y*z*(x+y+z-1)*(x-y),[x,y,z]])'     is
     already very hard.

   *  To efficiently analyze the roots of b-function, `ox_asir' should
     be used   from `ox_sm1_forAsir'.      It is recommended to load
     the communication module for `ox_asir'     by the command
     `sm1(0,"[(parse) (oxasir.sm1) pushfile] extension");'  This
     command is automatically executed when `ox_sm1_forAsir' is started.

   * If you make an interruption to the function `sm1.deRham' by
     `ox_reset(sm1.get_Sm1_proc());', the server might get out of the
     standard mode. So, it is strongly recommended to execute the
     command `ox_shutdown(sm1.get_Sm1_proc());' to interrupt and
     restart the server.

     [332] sm1.deRham([x^3-y^2,[x,y]]);
     [1,1,0]
     [333] sm1.deRham([x*(x-1),[x]]);
     [1,2]

Reference
     `sm1.start', `deRham' (sm1 command)

Algorithm:
     Oaku, Takayama, An algorithm for de Rham cohomology groups of the
       complement of an affine variety via D-module computation,
     Journal of pure and applied algebra 139 (1999), 201-233.

