Changeset d2b2a7 in git for Singular/LIB/normal.lib
 Timestamp:
 May 5, 1998, 1:55:40 PM (26 years ago)
 Branches:
 (u'spielwiese', 'a719bcf0b8dbc648b128303a49777a094b57592c')
 Children:
 97f92aa6d280f6022eaae47195ccc02503ccb984
 Parents:
 4996f5286c7671191ad22e654499fd8b752fe4f0
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/normal.lib
r4996f52 rd2b2a7 6 6 /////////////////////////////////////////////////////////////////////////////// 7 7 8 version="$Id: normal.lib,v 1. 4 19980403 22:47:08krueger Exp $";8 version="$Id: normal.lib,v 1.5 19980505 11:55:32 krueger Exp $"; 9 9 info=" 10 10 LIBRARY: normal.lib: PROCEDURE FOR NORMALIZATION (I) … … 22 22 23 23 proc isR_HomJR (list Li) 24 USAGE: isR_HomJR (Li); Li = list: ideal SBid, ideal J, poly p24 "USAGE: isR_HomJR (Li); Li = list: ideal SBid, ideal J, poly p 25 25 COMPUTE: module Hom_R(J,R) = R:J and compare with R 26 26 ASSUME: R = P/SBid, P = basering … … 30 30 RETURN: 1 if R = R:J, 0 if not 31 31 EXAMPLE: example isR_HomJR; shows an example 32 " 32 33 { 33 34 int n, ii; … … 71 72 72 73 proc extraweight (list # ) 73 USAGE: extraweight (P); P=name of an existing ring (true name, not a string)74 "USAGE: extraweight (P); P=name of an existing ring (true name, not a string) 74 75 RETURN: intvec, size=nvars(P), consisting of the weights of the variables of P 75 76 NOTE: This is useful when enlarging P but keeping the weights of the old 76 77 variables 77 78 EXAMPLE: example extraweight; shows an example 79 " 78 80 { 79 81 int ii,q,fi,fo,fia; … … 152 154 153 155 proc HomJJ (list Li,list #) 154 USAGE: HomJJ (Li); Li = list: SBid,id,J,poly p156 "USAGE: HomJJ (Li); Li = list: SBid,id,J,poly p 155 157 ASSUME: R = P/id, P = basering, a polynomial ring, id an ideal of P, 156 158 SBid = standard basis of id, … … 165 167 _[2]: an integer which is 1 if phi is an isomorphism, 0 if not 166 168 EXAMPLE: example HomJJ; shows an example 169 " 167 170 { 168 171 // initialisation  … … 513 516 /////////////////////////////////////////////////////////////////////////////// 514 517 proc normal(ideal id, list #) 515 USAGE: normal(i,choose); i ideal,choose empty or 1518 "USAGE: normal(i,choose); i ideal,choose empty or 1 516 519 in case you choose 1 the factorizing Buchberger algorithm 517 520 is not used which is sometimes more efficient … … 521 524 NOTE: to use the rings: def r=L[i];setring r; 522 525 EXAMPLE: example normal; shows an example 526 " 523 527 { 524 528 int i,j,y; … … 654 658 655 659 proc normalizationPrimes(ideal i,ideal ihp, list #) 656 USAGE: normalizationPrimes(i); i prime ideal660 "USAGE: normalizationPrimes(i); i prime ideal 657 661 RETURN: a list of one ring L=R, in R are two ideals 658 662 S,M such that R/M is the normalization … … 660 664 NOTE: to use the ring: def r=L[1];setring r; 661 665 EXAMPLE: example normalizationPrimes; shows an example 666 " 662 667 { 663 668 int y;
Note: See TracChangeset
for help on using the changeset viewer.