Changeset 906458 in git for Singular/LIB/normal.lib


Ignore:
Timestamp:
Apr 7, 2009, 6:18:06 PM (15 years ago)
Author:
Frank Seelisch <seelisch@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
5d98f437864469b655868be585350eeb57da2863
Parents:
2ae96e40fc5453bcb155aec76d376d79dd549cbe
Message:
removed some docu errors prior to release 3-1-0


git-svn-id: file:///usr/local/Singular/svn/trunk@11638 2c84dea3-7e68-4137-9b89-c4e89433aadc
File:
1 edited

Legend:

Unmodified
Added
Removed
  • Singular/LIB/normal.lib

    r2ae96e r906458  
    11///////////////////////////////////////////////////////////////////////////////
    2 version="$Id: normal.lib,v 1.50 2009-03-26 16:37:19 Singular Exp $";
     2version="$Id: normal.lib,v 1.51 2009-04-07 16:18:05 seelisch Exp $";
    33category="Commutative Algebra";
    44info="
     
    19041904
    19051905proc genus(ideal I,list #)
    1906 "USAGE:   genus(i) or genus(i,1); I a 1-dimensional ideal
     1906"USAGE:   genus(I) or genus(I,1); I a 1-dimensional ideal
    19071907RETURN:  an integer, the geometric genus p_g = p_a - delta of the projective
    19081908         curve defined by i, where p_a is the arithmetic genus.
     
    19101910         i.e. dim(R'/R), R' the normalization of the local ring R of the
    19111911         singularity. @*
    1912          genus(i,1) uses the normalization to compute delta. Usually genus(i,1)
     1912         genus(I,1) uses the normalization to compute delta. Usually genus(i,1)
    19131913         is slower than genus(i) but sometimes not.
    19141914EXAMPLE: example genus; shows an example
     
    25412541"USAGE:    primeClosure(L [,c]); L a list of a ring containing a prime ideal
    25422542                                 ker, c an optional integer
    2543 RETURN:   a list L (of size n+1) consisting of rings L[1],...,L[n] such that
    2544           - L[1] is a copy of (not a reference to!) the input ring L[1]
     2543RETURN:   a list L (of size n+1) consisting of rings L[1],...,L[n] such that@*
     2544          - L[1] is a copy of (not a reference to!) the input ring L[1]@*
    25452545          - all rings L[i] contain ideals ker, L[2],...,L[n] contain ideals phi
    2546             such that
    2547                     L[1]/ker --> ... --> L[n]/ker
    2548             are injections given by the corresponding ideals phi, and L[n]/ker
    2549             is the integral closure of L[1]/ker in its quotient field.
     2546            such that L[1]/ker --> ... --> L[n]/ker are injections given by the
     2547            corresponding ideals phi, and L[n]/ker is the integral closure of
     2548            L[1]/ker in its quotient field.@*
    25502549          - all rings L[i] contain a polynomial nzd such that elements of
    25512550            L[i]/ker are quotients of elements of L[i-1]/ker with denominator
    2552             nzd via the injection phi.
    2553             L[n+1] is the delta invariant 
    2554 NOTE:     - L is constructed by recursive calls of primeClosure itself.
    2555           - c determines the choice of nzd:
     2551            nzd via the injection phi.@*
     2552            L[n+1] is the delta invariant
     2553NOTE:     - L is constructed by recursive calls of primeClosure itself.@*
     2554          - c determines the choice of nzd:@*
    25562555               - c not given or equal to 0: first generator of the ideal SL,
    2557                  the singular locus of Spec(L[i]/ker)
     2556                 the singular locus of Spec(L[i]/ker)@*
    25582557               - c<>0: the generator of SL with least number of monomials.
    25592558EXAMPLE:  example primeClosure; shows an example
Note: See TracChangeset for help on using the changeset viewer.