Changeset fff61a7 in git for Singular/LIB/hnoether.lib
 Timestamp:
 May 27, 1998, 12:54:24 PM (25 years ago)
 Branches:
 (u'spielwiese', 'a7324b6e0b44a1a8ed3fa4d9ca3e2ff210ddd52c')
 Children:
 c73e2fb1900677386955dd960db01046688c0993
 Parents:
 7653af46ea6133081d48d2bfd8ea8a3e3c6f5540
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/hnoether.lib
r7653af rfff61a7 1 // $Id: hnoether.lib,v 1. 7 19980514 18:45:05Singular Exp $1 // $Id: hnoether.lib,v 1.8 19980527 10:54:24 Singular Exp $ 2 2 // author: Martin Lamm, email: lamm@mathematik.unikl.de 3 3 // last change: 26.03.98 4 4 /////////////////////////////////////////////////////////////////////////////// 5 5 6 version="$Id: hnoether.lib,v 1. 7 19980514 18:45:05Singular Exp $";6 version="$Id: hnoether.lib,v 1.8 19980527 10:54:24 Singular Exp $"; 7 7 info=" 8 8 LIBRARY: hnoether.lib PROCEDURES FOR THE HAMBURGERNOETHERDEVELOPMENT … … 19 19 intersection(hne1,hne2); intersection multiplicity of two curves 20 20 stripHNE(hne); reduce amount of memory consumed by hne 21 22 perhaps useful procedures:23 puiseux2generators(m,n); convert puiseux pairs to generators of semigroup24 multiplicities(hne); multiplicities of blowed up curves25 newtonpoly(f); newtonpolygon of polynom f26 newtonhoehne(f); same as newtonpoly, but uses internal procedure27 getnm(f); intersection points of the Newtonpolygon with the axes28 T_Transform(f,Q,N); returns f(y,xy^Q)/y^NQ (type f(x,y): poly, Q,N: int)29 T1_Transform(f,d,M); returns f(x,y+d*x^M) (type f(x,y): poly,d:number,M:int)30 T2_Transform(f,d,M,N); a composition of T1 & T31 koeff(f,I,J); gets coefficient of indicated monomial of poly f (I,J:int)32 redleit(f,S,E); restriction of monomials of f to line (SE)33 squarefree(f); returns a squarefree divisor of the poly f34 allsquarefree(f,l); returns the maximal squarefree divisor of the poly f35 set_list(L,v,l); managing interconnected lists36 37 procedures (more or less) for internal use:38 leit(f,n,m); special case of redleit (for irred. polynomials)39 testreducible(f,n,m); tests whether f is reducible40 polytest(f); tests coefficients and exponents of poly f41 charPoly(f,M,N); characteristic polynomial of f42 find_in_list(L,p); find int p in list L43 get_last_divisor(M,N); last divisor in Euclid's algorithm44 factorfirst(f,M,N); try to factor f in a trivial way before using 'factorize'45 extrafactor(f,M,N); try to factor charPoly(f,M,N) where 'factorize' cannot46 extractHNEs(H,t); extracts output H of HN to output of reddevelop47 HN(f,grenze); recursive subroutine for reddevelop48 constructHNEs(...); subroutine for HN49 21 "; 50 22 //////////////////////////////////////////////////////////////////////////// 23 // perhaps useful procedures: 24 // puiseux2generators(m,n); convert puiseux pairs to generators of semigroup 25 // multiplicities(hne); multiplicities of blowed up curves 26 // newtonpoly(f); newtonpolygon of polynom f 27 // newtonhoehne(f); same as newtonpoly, but uses internal procedure 28 // getnm(f); intersection points of the Newtonpolygon with the axes 29 // T_Transform(f,Q,N); returns f(y,xy^Q)/y^NQ (type f(x,y): poly, Q,N: int) 30 // T1_Transform(f,d,M); returns f(x,y+d*x^M) (type f(x,y): poly,d:number,M:int) 31 // T2_Transform(f,d,M,N); a composition of T1 & T 32 // koeff(f,I,J); gets coefficient of indicated monomial of poly f (I,J:int) 33 // redleit(f,S,E); restriction of monomials of f to line (SE) 34 // squarefree(f); returns a squarefree divisor of the poly f 35 // allsquarefree(f,l); returns the maximal squarefree divisor of the poly f 36 // set_list(L,v,l); managing interconnected lists 37 // 38 // procedures (more or less) for internal use: 39 // leit(f,n,m); special case of redleit (for irred. polynomials) 40 // testreducible(f,n,m); tests whether f is reducible 41 // polytest(f); tests coefficients and exponents of poly f 42 // charPoly(f,M,N); characteristic polynomial of f 43 // find_in_list(L,p); find int p in list L 44 // get_last_divisor(M,N); last divisor in Euclid's algorithm 45 // factorfirst(f,M,N); try to factor f in a trivial way before using 'factorize' 46 // extrafactor(f,M,N); try to factor charPoly(f,M,N) where 'factorize' cannot 47 // extractHNEs(H,t); extracts output H of HN to output of reddevelop 48 // HN(f,grenze); recursive subroutine for reddevelop 49 // constructHNEs(...); subroutine for HN 51 50 /////////////////////////////////////////////////////////////////////////////// 52 51 LIB "primitiv.lib";
Note: See TracChangeset
for help on using the changeset viewer.