Changeset 22c0fc9 in git


Ignore:
Timestamp:
Jun 9, 1999, 11:49:47 AM (24 years ago)
Author:
Hans Schönemann <hannes@…>
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
Children:
8ef5750b7a3298e63ae583dd8949e9ec89e70622
Parents:
6047f66a1c9dd5e774d56bb4724616bc964ab76c
Message:
*hannes/pfister: fixes for small characteristics


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

Legend:

Unmodified
Added
Removed

  • Singular/LIB/primdec.lib

    r6047f6 r22c0fc9  
    1 // $Id: primdec.lib,v 1.32 1999-06-08 15:54:46 pfister Exp $
     1// $Id: primdec.lib,v 1.33 1999-06-09 09:49:47 Singular Exp $
    22////////////////////////////////////////////////////////////////////////////////
    33// primdec.lib                                                                //
    … …  
    1111////////////////////////////////////////////////////////////////////////////////
    1212
    13 version="$Id: primdec.lib,v 1.32 1999-06-08 15:54:46 pfister Exp $";
     13version="$Id: primdec.lib,v 1.33 1999-06-09 09:49:47 Singular Exp $";
    1414info="
    1515LIBRARY: primdec.lib: PROCEDURE FOR PRIMARY DECOMPOSITION
    … …  
    2929                      of the ideal I
    3030  prepareAss(I);    computes the radicals of the equidimensional parts of I
     31These procedures are implemented to be used in characteristic 0.
     32They work also in positive characteristic >> 0.
     33In small characteristic primdecGTZ, minAssGTZ, radical and equiRadical may not
     34terminate and primdecSY and minAssChar may not give a complete decomposition.
    3135";
    3236
    … …  
    491495         "Warning: The characteristic ist too small to use";
    492496         "the Algorithm of Gianni/Trager/Zacharias.";
    493          "The result may be incomplete.";
    494          "Try primdecSY";
    495          "The result may be also imcomplete.";
     497         "This may result in an infinte loop";
    496498      }
    497499      if (reduce(i[m]-t^e,prm,1) !=0)
    … …  
    40324034                and their associated primes
    40334035NOTE:    Algorithm of Gianni, Traeger, Zacharias
     4036         designed for characteristic 0, works also in char k >> 0,
     4037         may result in an infinite loop in small characteristic
    40344038EXAMPLE: example primdecGTZ; shows an example
    40354039"
    … …  
    40534057                and their associated primes
    40544058NOTE:    Algorithm of Shimoyama-Yokoyama
     4059         implemented for characteristic 0, works also in char k >> 0,
     4060         the result may be not compltely decomposed in small characteristic
    40554061EXAMPLE: example primdecSY; shows an example
    40564062"
    … …  
    40714077"USAGE:  minAssGTZ(i); i ideal
    40724078RETURN:  list = the minimal associated prime ideals of i
    4073 NOTE:
     4079NOTE:    designed for characteristic 0, works also in char k >> 0,
     4080         may result in an infinite loop in small characteristic
    40744081EXAMPLE: example minAssGTZ; shows an example
    40754082"
    … …  
    40914098"USAGE:  minAssChar(i); i ideal
    40924099RETURN:  list = the minimal associated prime ideals of i
    4093 NOTE:
     4100NOTE:    implemented for characteristic 0, works also in char k >> 0,
     4101         the result may be not compltely decomposed in small characteristic
     4102EXAMPLE: example primdecSY; shows an example
     4103"
     4104{
     4105   return(prim_dec(i,1));
     4106}
     4107example
     4108{ "EXAMPLE:";  echo = 2;
     4109   ring  r = 32003,(x,y,z),lp;
     4110   poly  p = z2+1;
     4111   poly  q = z4+2;
     4112   ideal i = p^2*q^3,(y-z3)^3,(x-yz+z4)^4;
     4113   list pr= primdecSY(i);
     4114   pr;
     4115}
     4116///////////////////////////////////////////////////////////////////////////////
     4117proc minAssGTZ(ideal i)
     4118"USAGE:  minAssGTZ(i); i ideal
     4119RETURN:  list = the minimal associated prime ideals of i
     4120NOTE:    designed for characteristic 0, works also in char k >> 0,
     4121         may result in an infinite loop in small characteristic
     4122EXAMPLE: example minAssGTZ; shows an example
     4123"
     4124{
     4125   return(minAssPrimes(i,1));
     4126}
     4127example
     4128{ "EXAMPLE:";  echo = 2;
     4129   ring  r = 32003,(x,y,z),dp;
     4130   poly  p = z2+1;
     4131   poly  q = z4+2;
    40944132EXAMPLE: example minAssChar; shows an example
    40954133"
    … …  
    41134151RETURN:  ideal = the intersection of associated primes
    41144152         of i of dimension of i
    4115 NOTE:
     4153NOTE:    designed for characteristic 0, works also in char k >> 0,
     4154         may result in an infinite loop in small characteristic
    41164155EXAMPLE: example equiRadical; shows an example
    41174156"
    … …  
    41344173NOTE:    a combination of the algorithms of Krick/Logar
    41354174         and Eisenbud/Huneke/Vasconcelos
     4175         designed for characteristic 0, works also in char k >> 0,
     4176         may result in an infinite loop in small characteristic
    41364177EXAMPLE: example radical; shows an example
    41374178"
Note: See TracChangeset for help on using the changeset viewer.