Changeset fff61a7 in git for Singular/LIB/hnoether.lib

Timestamp:

May 27, 1998, 12:54:24 PM (26 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

c73e2fb1900677386955dd960db01046688c0993

Parents:

7653af46ea6133081d48d2bfd8ea8a3e3c6f5540

Message:

* hannes: modified info-string


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

File:

• Singular/LIB/hnoether.lib (modified) (2 diffs)

Singular/LIB/hnoether.lib

@@ -1 @@
-// $Id: hnoether.lib,v 1.7 1998-05-14 18:45:05 Singular Exp $
+// $Id: hnoether.lib,v 1.8 1998-05-27 10:54:24 Singular Exp $
 // author:  Martin Lamm,  email: lamm@mathematik.uni-kl.de
 // last change:           26.03.98
 ///////////////////////////////////////////////////////////////////////////////
 
-version="$Id: hnoether.lib,v 1.7 1998-05-14 18:45:05 Singular Exp $";
+version="$Id: hnoether.lib,v 1.8 1998-05-27 10:54:24 Singular Exp $";
 info="
 LIBRARY:  hnoether.lib   PROCEDURES FOR THE HAMBURGER-NOETHER-DEVELOPMENT
@@ -19 +19 @@
  intersection(hne1,hne2); intersection multiplicity of two curves
  stripHNE(hne);      reduce amount of memory consumed by hne
-
-           perhaps useful procedures:
- puiseux2generators(m,n); convert puiseux pairs to generators of semigroup
- multiplicities(hne);     multiplicities of blowed up curves
- newtonpoly(f);      newtonpolygon of polynom f
- newtonhoehne(f);    same as newtonpoly, but uses internal procedure
- getnm(f);           intersection points of the Newton-polygon with the axes
- T_Transform(f,Q,N); returns f(y,xy^Q)/y^NQ (type f(x,y): poly, Q,N: int)
- T1_Transform(f,d,M); returns f(x,y+d*x^M)  (type f(x,y): poly,d:number,M:int)
- T2_Transform(f,d,M,N);   a composition of T1 & T
- koeff(f,I,J);       gets coefficient of indicated monomial of poly f (I,J:int)
- redleit(f,S,E);     restriction of monomials of f to line (S-E)
- squarefree(f);      returns a squarefree divisor of the poly f
- allsquarefree(f,l); returns the maximal squarefree divisor of the poly f
- set_list(L,v,l);    managing interconnected lists
-
-           procedures (more or less) for internal use:
- leit(f,n,m);        special case of redleit (for irred. polynomials)
- testreducible(f,n,m); tests whether f is reducible
- polytest(f);        tests coefficients and exponents of poly f
- charPoly(f,M,N);    characteristic polynomial of f
- find_in_list(L,p);  find int p in list L
- get_last_divisor(M,N); last divisor in Euclid's algorithm
- factorfirst(f,M,N); try to factor f in a trivial way before using 'factorize'
- extrafactor(f,M,N); try to factor charPoly(f,M,N) where 'factorize' cannot
- extractHNEs(H,t);   extracts output H of HN to output of reddevelop
- HN(f,grenze);       recursive subroutine for reddevelop
- constructHNEs(...); subroutine for HN
 ";
-
+////////////////////////////////////////////////////////////////////////////
+//           perhaps useful procedures:
+// puiseux2generators(m,n); convert puiseux pairs to generators of semigroup
+// multiplicities(hne);     multiplicities of blowed up curves
+// newtonpoly(f);      newtonpolygon of polynom f
+// newtonhoehne(f);    same as newtonpoly, but uses internal procedure
+// getnm(f);           intersection points of the Newton-polygon with the axes
+// T_Transform(f,Q,N); returns f(y,xy^Q)/y^NQ (type f(x,y): poly, Q,N: int)
+// T1_Transform(f,d,M); returns f(x,y+d*x^M)  (type f(x,y): poly,d:number,M:int)
+// T2_Transform(f,d,M,N);   a composition of T1 & T
+// koeff(f,I,J);       gets coefficient of indicated monomial of poly f (I,J:int)
+// redleit(f,S,E);     restriction of monomials of f to line (S-E)
+// squarefree(f);      returns a squarefree divisor of the poly f
+// allsquarefree(f,l); returns the maximal squarefree divisor of the poly f
+// set_list(L,v,l);    managing interconnected lists
+//
+//           procedures (more or less) for internal use:
+// leit(f,n,m);        special case of redleit (for irred. polynomials)
+// testreducible(f,n,m); tests whether f is reducible
+// polytest(f);        tests coefficients and exponents of poly f
+// charPoly(f,M,N);    characteristic polynomial of f
+// find_in_list(L,p);  find int p in list L
+// get_last_divisor(M,N); last divisor in Euclid's algorithm
+// factorfirst(f,M,N); try to factor f in a trivial way before using 'factorize'
+// extrafactor(f,M,N); try to factor charPoly(f,M,N) where 'factorize' cannot
+// extractHNEs(H,t);   extracts output H of HN to output of reddevelop
+// HN(f,grenze);       recursive subroutine for reddevelop
+// constructHNEs(...); subroutine for HN
 ///////////////////////////////////////////////////////////////////////////////
 LIB "primitiv.lib";