Changeset bbf49b8 in git
- Timestamp:
- Jan 15, 2014, 4:49:05 PM (10 years ago)
- Branches:
- (u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'c5facdfddea2addfd91babd8b9019161dea4b695')
- Children:
- 538c8cd688adf1bd3fa4ae496c26a69ae0abe8b1
- Parents:
- 112fd151f309f96d3629bc82576ad75cef64eb2c
- git-author:
- Hans Schoenemann <hannes@mathematik.uni-kl.de>2014-01-15 16:49:05+01:00
- git-committer:
- Hans Schoenemann <hannes@mathematik.uni-kl.de>2014-01-15 16:49:20+01:00
- Location:
- Singular/LIB
- Files:
-
- 14 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/JMBTest.lib
r112fd15 rbbf49b8 533 533 } 534 534 //////////////////////////////////////////////////////////////////// 535 proc FinalVm(list V1 , list G1 , r)535 proc FinalVm(list V1 , list G1 ,def r) 536 536 "USAGE: FinalVm(V1, G1, r); V1 list, G1 list , r 537 537 RETURN: intvec: u … … 663 663 } 664 664 //////////////////////////////////////////////////////////////////// 665 proc ConstructorMain(list G, int c, r)665 proc ConstructorMain(list G, int c,def r) 666 666 "USAGE: Costruttore(G,c); G list, c int 667 667 RETURN: list: R … … 855 855 } 856 856 //////////////////////////////////////////////////////////////////// 857 proc TestJMark(list G1, r)857 proc TestJMark(list G1,def r) 858 858 "USAGE: TestJMark(G); G list 859 859 RETURN: int: i -
Singular/LIB/brnoeth.lib
r112fd15 rbbf49b8 595 595 } 596 596 /////////////////////////////////////////////////////////////////////////////// 597 static proc Frobenius ( etwas,int r)597 static proc Frobenius (def etwas,int r) 598 598 { 599 599 // applies the Frobenius map over F_{p^r} to an object defined over an … … 762 762 } 763 763 /////////////////////////////////////////////////////////////////////////////// 764 static proc subfield ( sf)764 static proc subfield (def sf) 765 765 { 766 766 // writes the generator "a" of a subfield of the coefficients field of … … 858 858 } 859 859 /////////////////////////////////////////////////////////////////////////////// 860 static proc importdatum ( sf,string datum,string rel)860 static proc importdatum (def sf,string datum,string rel) 861 861 { 862 862 // fetchs a poly with name "datum" to the current basering from the ring sf … … 891 891 } 892 892 /////////////////////////////////////////////////////////////////////////////// 893 static proc rationalize ( lf,string datum,string rel)893 static proc rationalize (def lf,string datum,string rel) 894 894 { 895 895 // fetchs a poly with name "datum" to the current basering from the ring lf … … 1779 1779 } 1780 1780 /////////////////////////////////////////////////////////////////////////////// 1781 static proc local_conductor (int k, SS)1781 static proc local_conductor (int k,def SS) 1782 1782 { 1783 1783 // computes the degree of the local conductor at a place of a plane curve -
Singular/LIB/ncfactor.lib
r112fd15 rbbf49b8 1239 1239 ////////////////////////////////////////////////// 1240 1240 1241 static proc checkForHomogInhomogInterchangability(list factors, posLeft,posRight)1241 static proc checkForHomogInhomogInterchangability(list factors,int posLeft,int posRight) 1242 1242 " 1243 1243 INPUT: A list consisting of factors of a certain polynomial in the first Weyl … … 3046 3046 //the two arguments, which are also given by the user. 3047 3047 3048 proc facSubWeyl(poly h, X,D)3049 "USAGE: facSubWeyl(h,x, y); h, X, D polynomials3048 proc facSubWeyl(poly h, def X, def D) 3049 "USAGE: facSubWeyl(h,x,D); h, X, D polynomials 3050 3050 RETURN: list 3051 3051 ASSUME: X and D are variables of a basering, which satisfy DX = XD +1. … … 3530 3530 }//combineNonnegative 3531 3531 3532 static proc fromWeylToShiftPoly(poly h, sAlgebra)3532 static proc fromWeylToShiftPoly(poly h,def sAlgebra) 3533 3533 " 3534 3534 USAGE: Given a polynomial in the first Weyl algebra, this method returns it -- if possible -- -
Singular/LIB/nctools.lib
r112fd15 rbbf49b8 192 192 // This procedure computes ei+ej-f with f running in Newton(pij) and deletes the zero rows 193 193 194 static proc Cij(intmat M, int i, j)194 static proc Cij(intmat M, int i,int j) 195 195 { 196 196 M=(-1)*M; -
Singular/LIB/normaliz.lib
r112fd15 rbbf49b8 818 818 819 819 820 static proc runNormaliz(intmat sgr, nmz_mode, list #)820 static proc runNormaliz(intmat sgr,def nmz_mode, list #) 821 821 { 822 822 if(!queryInt("nmz_files_keep_switch")) -
Singular/LIB/phindex.lib
r112fd15 rbbf49b8 28 28 29 29 ///////////////////////////////////////////////////////////////////////////// 30 proc signatureL( M,int #)30 proc signatureL(matrix M,int #) 31 31 "USAGE: signatureL(M[,r]); M symmetric matrix, r int (optional). 32 32 RETURN: the signature of M of type int or if r is given and !=0 then … … 96 96 } 97 97 //////////////////////////////////////////////////////////////////////// 98 proc signatureLqf( h,int #)98 proc signatureLqf(poly h,int #) 99 99 "USAGE: signatureLqf(h); h quadratic form (poly type). 100 100 RETURN: the signature of h of type int or if r is given and !=0 then … … 224 224 } 225 225 ///////////////////////////////////////////////////////////////////////////// 226 proc PH_ais( I)226 proc PH_ais(def I) 227 227 "USAGE: PH_ais(I); I ideal of coordinates of the vector field. 228 228 RETURN: the Poincare-Hopf index of type int. … … 347 347 } 348 348 /////////////////////////////////////////////////////////////////////////// 349 proc PH_nais( I)349 proc PH_nais(def I) 350 350 "USAGE: PH_nais(I); I ideal of coordinates of the vector field. 351 351 RETURN: the Poincare-Hopf index of type int. -
Singular/LIB/pointid.lib
r112fd15 rbbf49b8 50 50 //////////////////////////////////////////////////////////////////////////////// 51 51 52 static proc subst1( id, int m)52 static proc subst1(def id, int m) 53 53 { 54 54 //id = poly/ideal/list, substitute the first m variables occuring in id by 1 … … 79 79 //////////////////////////////////////////////////////////////////////////////// 80 80 81 proc nonMonomials( id)81 proc nonMonomials(def id) 82 82 "USAGE: nonMonomials(id); id = <list of vectors> or <list of lists> or <module> 83 83 or <matrix>.@* … … 378 378 //////////////////////////////////////////////////////////////////////////////// 379 379 380 proc facGBIdeal( id)380 proc facGBIdeal(def id) 381 381 "USAGE: facGBIdeal(id); id = <list of vectors> or <list of lists> or <module> 382 382 or <matrix>.@* -
Singular/LIB/poly.lib
r112fd15 rbbf49b8 92 92 93 93 /////////////////////////////////////////////////////////////////////////////// 94 proc substitute ( I,list #)94 proc substitute (def I,list #) 95 95 "USAGE: - case 1: typeof(#[1])==poly: 96 96 substitute (I,v,f[,v1,f1,v2,f2,...]); I object of basering which … … 381 381 /////////////////////////////////////////////////////////////////////////////// 382 382 383 proc maxcoef ( f)383 proc maxcoef (def f) 384 384 "USAGE: maxcoef(f); f poly/ideal/vector/module/matrix 385 385 RETURN: maximal length of coefficient of f of type int (by measuring the … … 418 418 /////////////////////////////////////////////////////////////////////////////// 419 419 420 proc maxdeg ( id)420 proc maxdeg (def id) 421 421 "USAGE: maxdeg(id); id poly/ideal/vector/module/matrix 422 422 RETURN: int/intmat, each component equals maximal degree of monomials in the … … 553 553 /////////////////////////////////////////////////////////////////////////////// 554 554 555 proc mindeg ( id)555 proc mindeg (def id) 556 556 "USAGE: mindeg(id); id poly/ideal/vector/module/matrix 557 557 RETURN: minimal degree/s of monomials of id, independent of ring ordering … … 606 606 /////////////////////////////////////////////////////////////////////////////// 607 607 608 proc mindeg1 ( id, list #)608 proc mindeg1 (def id, list #) 609 609 "USAGE: mindeg1(id[,v]); id=poly/ideal/vector/module/matrix, v=intvec 610 610 RETURN: integer, minimal [weighted] degree of monomials of id independent of … … 687 687 /////////////////////////////////////////////////////////////////////////////// 688 688 689 proc normalize ( id)689 proc normalize (def id) 690 690 "USAGE: normalize(id); id=poly/vector/ideal/module 691 691 RETURN: object of same type … … 769 769 /////////////////////////////////////////////////////////////////////////////// 770 770 771 proc lcm ( id, list #)771 proc lcm (def id, list #) 772 772 "USAGE: lcm(p[,q]); p int/intvec q a list of integers or 773 773 p poly/ideal q a list of polynomials … … 886 886 /////////////////////////////////////////////////////////////////////////////// 887 887 888 proc content( f)888 proc content(def f) 889 889 "USAGE: content(f); f polynomial/vector 890 890 RETURN: number, the content (greatest common factor of coefficients) -
Singular/LIB/polybori.lib
r112fd15 rbbf49b8 256 256 // converts a Singular ring into a Boolean ring 257 257 258 proc ring2bring( r)258 proc ring2bring(def r) 259 259 { 260 260 bring rb; … … 315 315 316 316 // look up whether we cached this conversion before 317 static proc bring_from_cache( r)317 static proc bring_from_cache(def r) 318 318 { 319 319 bring_mark_cache(); … … 324 324 325 325 // insert computed result into cache 326 static proc bring_to_cache( r, pyobject newring)326 static proc bring_to_cache(def r, pyobject newring) 327 327 { 328 328 def value = WeakRingRef(newring); … … 333 333 // converts a Singular ring into a python ring 334 334 335 proc boolean_poly_ring( r)335 proc boolean_poly_ring(def r) 336 336 { 337 337 def cached = bring_from_cache(r); … … 396 396 // checks the equality of two bpolys 397 397 398 proc bpoly_check(bpoly pb1, pb2)398 proc bpoly_check(bpoly pb1,bpoly pb2) 399 399 { 400 400 return(pb1.boolpoly==pb2.boolpoly); … … 404 404 // computes the multiplication of two bpolys 405 405 406 proc bpoly_mult(bpoly pb1, pb2)406 proc bpoly_mult(bpoly pb1,bpoly pb2) 407 407 { 408 408 bpoly bpol; -
Singular/LIB/presolve.lib
r112fd15 rbbf49b8 31 31 LIB "elim.lib"; 32 32 /////////////////////////////////////////////////////////////////////////////// 33 proc shortid ( id,int n,list #)33 proc shortid (def id,int n,list #) 34 34 "USAGE: shortid(id,n[,e]); id= ideal/module, n,e=integers 35 35 RETURN: - if called with two arguments or e=0: … … 86 86 /////////////////////////////////////////////////////////////////////////////// 87 87 88 proc degreepart ( id,int d1,int d2,list #)88 proc degreepart (def id,int d1,int d2,list #) 89 89 "USAGE: degreepart(id,d1,d2[,v]); id=ideal/module, d1,d1=integers, v=intvec 90 90 RETURN: list of size 2, … … 142 142 /////////////////////////////////////////////////////////////////////////////// 143 143 144 proc linearpart ( id)144 proc linearpart (def id) 145 145 "USAGE: linearpart(id); id=ideal/module 146 146 RETURN: list of size 2, … … 666 666 /////////////////////////////////////////////////////////////////////////////// 667 667 668 proc faststd ( @id, list #)668 proc faststd (def @id, list #) 669 669 "USAGE: faststd(id [,\"hilb\",\"sort\",\"dec\",o,\"blocks\"]); 670 670 id=ideal/module, o=string (allowed:\"lp\",\"dp\",\"Dp\",\"ls\", … … 836 836 /////////////////////////////////////////////////////////////////////////////// 837 837 838 proc findvars( id, list #)838 proc findvars(def id, list #) 839 839 "USAGE: findvars(id [,any] ); id=poly/ideal/vector/module/matrix, any=any type 840 840 RETURN: if no second argument is present: ideal of variables occuring in id,@* … … 885 885 /////////////////////////////////////////////////////////////////////////////// 886 886 887 proc hilbvec ( @id, list #)887 proc hilbvec (def @id, list #) 888 888 "USAGE: hilbvec(id[,c,o]); id=poly/ideal/vector/module/matrix, c,o=strings,@* 889 889 c=char, o=ordering used by @code{hilb} (default: c=\"32003\", o=\"dp\") … … 916 916 /////////////////////////////////////////////////////////////////////////////// 917 917 918 proc tolessvars ( id ,list #)918 proc tolessvars (def id ,list #) 919 919 "USAGE: tolessvars(id [,s1,s2] ); id poly/ideal/vector/module/matrix, 920 920 s1=string (new ordering)@* … … 983 983 /////////////////////////////////////////////////////////////////////////////// 984 984 985 proc solvelinearpart ( id,list #)985 proc solvelinearpart (def id,list #) 986 986 "USAGE: solvelinearpart(id [,n] ); id=ideal/module, n=integer (default: n=0) 987 987 RETURN: (interreduced) generators of id of degree <=1 in reduced triangular … … 1032 1032 /////////////////////////////////////////////////////////////////////////////// 1033 1033 1034 proc sortandmap ( @id, list #)1034 proc sortandmap (def @id, list #) 1035 1035 "USAGE: sortandmap(id [,n1,p1,n2,p2...,o1,m1,o2,m2...]);@* 1036 1036 id=poly/ideal/vector/module,@* … … 1128 1128 /////////////////////////////////////////////////////////////////////////////// 1129 1129 1130 proc sortvars ( id, list #)1130 proc sortvars (def id, list #) 1131 1131 "USAGE: sortvars(id[,n1,p1,n2,p2,...]);@* 1132 1132 id=poly/ideal/vector/module,@* … … 1190 1190 /////////////////////////////////////////////////////////////////////////////// 1191 1191 1192 proc valvars ( id, list #)1192 proc valvars (def id, list #) 1193 1193 "USAGE: valvars(id[,n1,p1,n2,p2,...]);@* 1194 1194 id=poly/ideal/vector/module,@* -
Singular/LIB/qhmoduli.lib
r112fd15 rbbf49b8 643 643 /////////////////////////////////////////////////////////////////////////////// 644 644 static 645 proc ArnoldFormMain(poly f, B, poly Fs, ideal reduceIdeal, int nrs, int nrt)645 proc ArnoldFormMain(poly f,def B, poly Fs, ideal reduceIdeal, int nrs, int nrt) 646 646 "USAGE: ArnoldFormMain(f, B, Fs, rI, nrs, nrt); 647 647 poly f,Fs; ideal B, rI; int nrs, nrt … … 733 733 /////////////////////////////////////////////////////////////////////////////// 734 734 735 static proc MonosAndTerms(poly f, wt, int ub)735 static proc MonosAndTerms(poly f,def wt, int ub) 736 736 "USAGE: MonosAndTerms(f, w, ub); poly f, intvec w, int ub 737 737 PURPOSE: returns a list of all monomials and terms occuring in f of … … 771 771 /////////////////////////////////////////////////////////////////////////////// 772 772 773 static proc SelectMonos( parts, intvec wt, int d)773 static proc SelectMonos(def parts, intvec wt, int d) 774 774 "USAGE: SelectMonos(parts, w, d); list/ideal parts, intvec w, int d 775 775 PURPOSE: returns a list of all monomials and terms occuring in f of … … 808 808 /////////////////////////////////////////////////////////////////////////////// 809 809 810 static proc Expand( substitution,degVec, ideal reduceI, intvec w1, int ub, list truncated)810 static proc Expand(def substitution,def degVec, ideal reduceI, intvec w1, int ub, list truncated) 811 811 "USAGE: Expand(substitution, degVec, reduceI, w, ub, truncated); 812 812 ideal/list substitution, list/intvec degVec, ideal reduceI, intvec w, … … 1455 1455 /////////////////////////////////////////////////////////////////////////////// 1456 1456 1457 static proc FirstEntryQHM(d ata,elem)1457 static proc FirstEntryQHM(def data,def elem) 1458 1458 // Type : int 1459 1459 // Purpose : position of first entry equal to elem in data (from left to right) … … 1473 1473 /////////////////////////////////////////////////////////////////////////////// 1474 1474 1475 static proc PSum( e)1475 static proc PSum(def e) 1476 1476 { 1477 1477 poly f; … … 1485 1485 /////////////////////////////////////////////////////////////////////////////// 1486 1486 1487 proc Max(d ata)1487 proc Max(def data) 1488 1488 "USAGE: Max(data); intvec/list of integers 1489 1489 PURPOSE: find the maximal integer contained in 'data' … … 1508 1508 /////////////////////////////////////////////////////////////////////////////// 1509 1509 1510 proc Min(d ata)1510 proc Min(def data) 1511 1511 "USAGE: Min(data); intvec/list of integers 1512 1512 PURPOSE: find the minimal integer contained in 'data' -
Singular/LIB/qmatrix.lib
r112fd15 rbbf49b8 279 279 // n is the order of the quantum matrix algebra where we are working. 280 280 281 static proc itoij(int i, n)281 static proc itoij(int i,int n) 282 282 { 283 283 intvec ij=0,0; … … 287 287 } 288 288 289 static proc ijtoi(int i, j,n)289 static proc ijtoi(int i,int j,int n) 290 290 { 291 291 return((j-1)+n*(i-1)+1); -
Singular/LIB/random.lib
r112fd15 rbbf49b8 26 26 /////////////////////////////////////////////////////////////////////////////// 27 27 28 proc genericid ( id, list #)28 proc genericid (def id, list #) 29 29 "USAGE: genericid(id[,p,b]); id ideal/module, p,b integers 30 30 RETURN: system of generators of id which are generic, sparse, triagonal linear … … 54 54 /////////////////////////////////////////////////////////////////////////////// 55 55 56 proc randomid ( id, list #)56 proc randomid (def id, list #) 57 57 "USAGE: randomid(id[,k,b]); id ideal/module, b,k integers 58 58 RETURN: ideal/module having k generators which are random linear combinations -
Singular/LIB/redcgs.lib
r112fd15 rbbf49b8 249 249 } 250 250 251 proc memberpos( f,J)251 proc memberpos(def f,def J) 252 252 "USAGE: memberpos(f,J); 253 253 (f,J) expected (polynomial,ideal) … … 373 373 374 374 375 proc subset( J,K)375 proc subset(def J,def K) 376 376 "USAGE: subset(J,K); 377 377 (J,K) expected (ideal,ideal) … … 3132 3132 3133 3133 // gives the first child of vertex fu 3134 proc firstchild( labfu)3134 proc firstchild(def labfu) 3135 3135 { 3136 3136 intvec labfu0=labfu; … … 3569 3569 // input: poly f 3570 3570 // output 1 if f is homogeneous, 0 if not 3571 proc ishomog( f)3571 proc ishomog(def f) 3572 3572 { 3573 3573 int i; poly r; int d; int dr;
Note: See TracChangeset
for help on using the changeset viewer.