Changeset 075bc5 in git
- Timestamp:
- Oct 24, 2018, 2:56:54 PM (6 years ago)
- Branches:
- (u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')
- Children:
- 141c69129ce626a1c7c898edb6ab66c0632a1759
- Parents:
- 99d02931f1b01b2ae7d88ca405c300918c8c6919
- Files:
-
- 25 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/atkins.lib
r99d029 r075bc5 248 248 if((((4*p-b^2) mod absValue(D))!=0)||(c!=root_c^2)) 249 249 { 250 "3";251 250 return(-1); 252 251 // ERROR("The Diophantine equation has no solution!"); -
Singular/LIB/bfun.lib
r99d029 r075bc5 345 345 { 346 346 M[i+sZeros] = gen(posNonZero[i]); 347 } 347 } 348 348 kill posNonZero; 349 349 } -
Singular/LIB/classify2.lib
r99d029 r075bc5 33 33 Complex Singularities of Corank and Modality up to Two, Singularities and 34 34 Computer Algebra - Festschrift for Gert-Martin Greuel on the Occasion of his 35 70th Birthday, Springer 2017, http://arxiv.org/abs/1604.04774, 35 70th Birthday, Springer 2017, http://arxiv.org/abs/1604.04774, 36 36 https://doi.org/10.1007/978-3-319-28829-1_2 37 37 … … 39 39 the complex type of the singularity. 40 40 41 Acknowledgements: This research was supported by 42 the Staff Exchange Bursary Programme of the University of Pretoria, DFG SPP 1489, 41 Acknowledgements: This research was supported by 42 the Staff Exchange Bursary Programme of the University of Pretoria, DFG SPP 1489, 43 43 DFG TRR 195. The financial assistance of the National Research Foundation (NRF), 44 South Africa, towards this research is hereby acknowledged. Opinions expressed 45 and conclusions arrived at are those of the author and are not necessarily to be 44 South Africa, towards this research is hereby acknowledged. Opinions expressed 45 and conclusions arrived at are those of the author and are not necessarily to be 46 46 attributed to the National Research Foundation, South Africa. 47 47 -
Singular/LIB/general.lib
r99d029 r075bc5 369 369 if ( @marie[@joni] != "LIB" && @marie[@joni] != "Top" 370 370 && typeof(`@marie[@joni]`) != "proc" 371 371 && typeof(`@marie[@joni]`) != "cring") 372 372 { 373 373 no_kill = 0; -
Singular/LIB/nets.lib
r99d029 r075bc5 19 19 20 20 TYPES: 21 Net 21 Net The class of all nets 22 22 23 23 PROCEDURES: … … 56 56 57 57 58 /* 59 // 60 61 // 62 63 // 64 65 // 66 67 // 68 69 // 70 71 // 72 73 // 74 75 // 76 77 // 78 79 // 80 81 82 // 83 84 // 85 86 // 87 88 // 89 90 // 91 92 // 93 94 // 95 96 97 // 98 99 // 100 101 // 102 58 /* test rings 59 // 60 ring r1 = 32003,(x,y,z),dp; 61 // 62 ring r2 = 32003,(x(1..10)),dp; 63 // 64 ring r3 = 32003,(x(1..5)(1..8)),dp; 65 // 66 ring r4 = 0,(a,b,c,d),lp; 67 // 68 ring r5 = 7,(x,y,z),ds; 69 // 70 ring r6 = 10,(x,y,z),ds; 71 // 72 ring r7 = 7,(x(1..6)),(lp(3),dp); 73 // 74 ring r8 = 0,(x,y,z,a,b,c),(ds(3), dp(3)); 75 // 76 ring r9 = 0,(x,y,z),(c,wp(2,1,3)); 77 // 78 ring r10 = (7,a,b,c),(x,y,z),Dp; 79 // 80 ring r11 = (7,a),(x,y,z),dp; 81 minpoly = a^2+a+3; 82 // 83 ring r12 = (7^2,a),(x,y,z),dp; 84 // 85 ring r13 = real,(x,y,z),dp; 86 // 87 ring r14 = (real,50),(x,y,z),dp; 88 // 89 ring r15 = (real,10,50),(x,y,z),dp; 90 // 91 ring r16 = (complex,30,j),(x,y,z),dp; 92 // 93 ring r17 = complex,(x,y,z),dp; 94 // 95 ring R = 7,(x,y,z), dp; 96 qring r18 = std(maxideal(2)); 97 // 98 ring r19 = integer,(x,y,z), dp; 99 // 100 ring r20 = (integer, 6, 3),(x,y,z), dp; 101 // 102 ring r21 = (integer, 100),(x,y,z), dp; 103 103 */ 104 104 … … 109 109 static proc mod_init() 110 110 { 111 112 113 114 111 LIB "methods.lib"; 112 newstruct("Net","list rows"); 113 system("install","Net","print",printNet,1); 114 system("install","Net","+",catNets,2); 115 115 HashTable F = hashTable(list(list("ring"),list("matrix"),list("int"),list("string"),list("list"),list("poly"),list("map"),list("number"),list("bigint"),list("vector"),list("ideal"),list("intvec"),list("intmat"),list("bigintmat")), 116 116 list("netRing", "netmatrix", "netInt", "netString", "netList", "netPoly", "netMap", "netNumber", "netBigInt", "netvector", "netIdeal", "netIntVector","netIntMat","netBigIntMat")); 117 118 117 Method net_ = method(F); 118 export(net_); 119 119 installMethod(net_,"net"); 120 120 } … … 127 127 static proc emptyString(int n) 128 128 { 129 130 131 132 133 129 string S=""; 130 for (int j=1; j<=n; j++) 131 { 132 S=S+" "; 133 } 134 134 135 135 return(S); … … 142 142 // 143 143 static proc printNet(Net N) 144 145 146 147 148 149 144 { 145 list L = N.rows; 146 for (int j=1; j<=size(L); j++) 147 { 148 print(L[j]); 149 } 150 150 } 151 151 … … 163 163 " 164 164 { 165 166 167 168 165 list LN=N.rows; 166 list LM=M.rows; 167 Net NM; 168 NM.rows=LN+LM; 169 169 170 170 return(NM); … … 192 192 " 193 193 { 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 194 list L, MAX; 195 list LN=N.rows; 196 list LM=M.rows; 197 int widthN=size(LN[1]); 198 int widthM=size(LM[1]); 199 MAX[1]=size(LN); 200 MAX[2]=size(LM); 201 int nm=Max(MAX); /*Eine Funktion max() ist in der Bib qhmoduli.lib und heiÃt Max(), als Argumente nimmt die Funktion Integer-Vektoren oder -Listen*/ 202 for (int j=1; j<=nm; j++) 203 { 204 if (j>size(LN)){LN[j]=emptyString(widthN);} 205 if (j>size(LM)){LM[j]=emptyString(widthM);} 206 L[j]=LN[j]+LM[j]; 207 } 208 Net NM; 209 NM.rows=L; 210 210 211 211 return(NM); … … 345 345 " 346 346 { 347 348 349 350 351 352 353 347 /* 348 if (r==1) 349 { 350 return(string("n")); 351 } 352 */ 353 string S=string(n)+string("^")+string(m); 354 354 return(net(/*(n)+net("^")+net(r)*/ S)); 355 355 } … … 376 376 " 377 377 { 378 378 list RL = ringlist(R); 379 379 if (size(RL[4])==0){ 380 380 Net N=netCoefficientRing(R)+net("[")+net(string(RL[2]))+net("]"); … … 388 388 { 389 389 "EXAMPLE:"; // from 3.3.1 Examples of ring declarations 390 391 392 // 393 394 395 // 396 397 398 // 399 400 401 // 402 403 404 // 405 406 407 // 408 409 410 // 411 412 413 // 414 415 416 // 417 418 419 // 420 421 422 423 // 424 425 426 // 427 428 429 // 430 431 432 // 433 434 435 // 436 437 438 // 439 440 441 // 442 443 444 390 ring r1 = 32003,(x,y,z),dp; 391 netRing(r1); 392 // 393 ring r2 = 32003,(x(1..10)),dp; 394 netRing(r2); 395 // 396 ring r3 = 32003,(x(1..5)(1..8)),dp; 397 netRing(r3); 398 // 399 ring r4 = 0,(a,b,c,d),lp; 400 netRing(r4); 401 // 402 ring r5 = 7,(x,y,z),ds; 403 netRing(r5); 404 // 405 ring r6 = 10,(x,y,z),ds; 406 netRing(r6); 407 // 408 ring r7 = 7,(x(1..6)),(lp(3),dp); 409 netRing(r7); 410 // 411 ring r8 = 0,(x,y,z,a,b,c),(ds(3), dp(3)); 412 netRing(r8); 413 // 414 ring r9 = 0,(x,y,z),(c,wp(2,1,3)); 415 netRing(r9); 416 // 417 ring r10 = (7,a,b,c),(x,y,z),Dp; 418 netRing(r10); 419 // 420 ring r11 = (7,a),(x,y,z),dp; 421 minpoly = a^2+a+3; 422 netRing(r11); 423 // 424 ring r12 = (7^2,a),(x,y,z),dp; 425 netRing(r12); 426 // 427 ring r13 = real,(x,y,z),dp; 428 netRing(r13); 429 // 430 ring r14 = (real,50),(x,y,z),dp; 431 netRing(r14); 432 // 433 ring r15 = (real,10,50),(x,y,z),dp; 434 netRing(r15); 435 // 436 ring r16 = (complex,30,j),(x,y,z),dp; 437 netRing(r16); 438 // 439 ring r17 = complex,(x,y,z),dp; 440 netRing(r17); 441 // 442 ring R = 7,(x,y,z), dp; 443 qring r18 = std(maxideal(2)); 444 netRing(r18); 445 445 } 446 446 … … 461 461 { 462 462 // 0 463 464 465 466 463 list Output; 464 string Map, Source, Target; 465 int i, v, empty; 466 Net M; 467 467 468 468 // 1 469 470 471 472 473 474 475 469 Map=string(nameof(f)); 470 Source=string(nameof(preimage(f))); 471 Target=string(nameof(basering)); 472 Output[1]="Map"+": "+Source+" --> "+Target; 473 v=size(ringlist(preimage(f))[2]); 474 empty=size(Output[1]); 475 Output[1]=Output[1]+" , "+string(ringlist(preimage(f))[2][1])+" -> "+string(f[1]); 476 476 477 477 // 2 478 479 480 478 for (i=2; i<=v; i++){// +2 479 Output[i]=emptyString(empty)+" , "+string(ringlist(preimage(f))[2][i])+" -> "+string(f[i]); 480 }// -2 481 481 482 482 // 3 483 483 M.rows=Output; 484 484 485 485 // - 486 486 return(M); 487 487 } 488 488 … … 511 511 { 512 512 // 0 513 514 515 516 513 list Output; 514 string Map, Source, Target; 515 int i, v, empty; 516 Net M; 517 517 518 518 // 1 519 520 521 522 523 524 525 519 Map=string(nameof(f)); 520 Source=string(nameof(preimage(f))); 521 Target=string(nameof(basering)); 522 Output[1]=Map+": "+Source+" --> "+Target; 523 v=size(ringlist(preimage(f))[2]); 524 empty=size(Output[1]); 525 Output[1]=Output[1]+" , "+string(ringlist(preimage(f))[2][1])+" -> "+string(f[1]); 526 526 527 527 // 2 528 529 530 528 for (i=2; i<=v; i++){// +2 529 Output[1]=Output[1]+" , "+string(ringlist(preimage(f))[2][i])+" -> "+string(f[i]); 530 }// -2 531 531 532 532 // 3 533 533 M.rows=Output; 534 534 535 535 // - 536 536 return(M); 537 537 } 538 538 example … … 560 560 { 561 561 // 0 562 562 int Length=100; //Length of Output 563 563 564 564 // - 565 565 return(netBigIntMatShort(M,Length)); 566 566 } 567 567 example … … 592 592 { 593 593 // 0 594 595 594 int Length=10; // LÀnge der Ausgabe 595 string S; 596 596 list L, SizeCol, SizeColShort; 597 597 int wd,defect; … … 599 599 600 600 // 1 601 602 603 601 if( size(#)!=0 ){// + 1 602 Length=#[1]; 603 }// - 1 604 604 605 605 // 2 606 606 for (j=1; j <= ncols(M); j++){// +2 607 608 607 SizeCol[j]=0; 608 }// -2 609 609 610 610 // 3 611 612 613 611 for (j=1; j <= ncols(M); j++){// +3 612 SizeColShort[j]=0; 613 }// -3 614 614 615 615 // 4 616 617 618 619 620 621 622 623 616 for (j=1; j <= ncols(M); j++){// +4 617 for (i=1; i <= nrows(M) ; i++){// +4.1 618 if ( SizeColShort[j] < size(string(M[i,j])) ){// +4.1.1 619 SizeCol[j]=size(string(M[i,j])); 620 SizeColShort[j]=size(string(M[i,j])); 621 }// -4.1.1 622 }// -4.1 623 }// -4 624 624 625 625 // 5 626 627 628 629 630 626 for (j=1; j <= ncols(M); j++){// +5 627 if( SizeColShort[j] > Length ){// +5.1 628 SizeColShort[j]=Length; 629 }// -5.1 630 }// -5 631 631 632 632 // 6 633 633 for (i=1; i<=nrows(M); i++ ){// +6 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 634 for (j=1; j<=ncols(M); j++ ){// +6.1 635 if ( j!=1 ){// +6.1.1 636 S=S+" "; 637 }// -6.1.1 638 if ( SizeCol[j] > Length ){// -6.1.2 639 if ( size(string(M[i,j])) > Length ){// +6.1.2.1 640 S=S+string(M[i,j])[1,Length]+"..."; 641 }// -6.1.2.1 642 else{// +6.1.2.2 643 defect=SizeColShort[j]+3-size(string(M[i,j])); 644 S=S+string(M[i,j])+emptyString(defect); 645 }// -6.1.2.2 646 }// -6.1.2 647 else{// +6.1.3 648 defect=SizeColShort[j]-size(string(M[i,j])); 649 S=S+string(M[i,j])+emptyString(defect); 650 }// -6.1.3 651 }// -6.1 652 L[i]=S; 653 S=""; 654 654 }// -6 655 655 … … 664 664 665 665 // - 666 666 return(NM); 667 667 } 668 668 example … … 693 693 { 694 694 // 0 695 696 695 int m=nrows(M); 696 int n=ncols(M); 697 697 698 698 // 1 699 700 699 bigintmat B[m][n]=M; 700 Net Output=netBigIntMat(B); 701 701 702 702 // - 703 703 return(Output); 704 704 } 705 705 example … … 730 730 { 731 731 // 0 732 733 732 int m=nrows(M); 733 int n=ncols(M); 734 734 735 735 // 1 736 736 bigintmat B[m][n]=bigintmat(M); 737 737 738 738 // 2 739 740 741 742 743 744 739 if( size(#)!=0 ){// +2.1 740 Net Output=netBigIntMatShort(B, #[1]); 741 }// -2.1 742 else{// +2.1 743 Net Output=netBigIntMatShort(B); 744 }// -2.2 745 745 746 746 // - 747 747 return(Output); 748 748 } 749 749 example … … 779 779 { 780 780 // 0 781 781 intmat M=intmat(V); 782 782 783 783 // 1 784 785 784 Net Output; 785 Output=netIntMat(M); 786 786 787 787 // - 788 788 return(Output); 789 789 } 790 790 example … … 815 815 { 816 816 // 0 817 817 intmat M=intmat(V); 818 818 819 819 // 1 820 820 Net Output; 821 821 822 822 // 2 823 824 825 826 827 828 823 if( size(#) != 0){// +2.1 824 Output=netIntMatShort(M, #[1]); 825 }// -2.1 826 else{// +2.2 827 Output=netIntMatShort(M); 828 }// -2.2 829 829 830 830 // - 831 831 return(Output); 832 832 } 833 833 example … … 858 858 { 859 859 // 0 860 860 int Size=50; 861 861 862 862 // 1 863 864 865 863 if( size(#)!=0 ){// +1 864 Size=#[1]; 865 }// -1 866 866 867 867 // - 868 869 } 870 example 871 { 872 873 874 875 876 877 878 879 880 881 882 868 return(netmatrixShort(M, Size)); 869 } 870 example 871 { 872 "EXAMPLE:"; 873 ring r1=101,(x,y,z),lp; 874 poly a=2x3y4+300xy-234z23; 875 poly b=2x3y4z; 876 poly c=x3y4z5; 877 poly d=5x6y7z10; 878 poly e=2x3y; 879 poly f=4y5z8; 880 matrix M[2][3]=a,b,c,d,e,f; 881 print(M); 882 netmatrix(M); 883 883 } 884 884 … … 897 897 " 898 898 { 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 } 926 example 927 { 928 929 930 931 932 933 934 935 936 937 899 int i, j; 900 list breite = list(); 901 Net Output; 902 string Zeile; 903 904 //maximale Spaltenbreite setzen 905 for (i=1; i<=ncols(M); i++){ 906 breite = breite + list(0); 907 for (j=1; j<=nrows(M); j++){ 908 if (breite[i] < size(string(M[j,i]))){ 909 breite[i] = size(string(M[j,i])); 910 } 911 } 912 } 913 914 //einfÃŒgen 915 for (i=1; i<=nrows(M); i++){ 916 Zeile = "| "; 917 for (j=1; j<=ncols(M); j++){ 918 Zeile = Zeile + string(M[i,j]) + emptyString( breite[j] - size(string(M[i,j])) + 1); 919 920 } 921 Output.rows[i] = Zeile + "|"; 922 } 923 924 return (Output); 925 } 926 example 927 { 928 "EXAMPLE:"; 929 ring r1=101,(x,y,z),lp; 930 poly a=2x3y4+300xy-234z23; 931 poly b=2x3y4z; 932 poly c=x3y4z5; 933 poly d=5x6y7z10; 934 poly e=2x3y-2x3y4+300xy-234z23; 935 poly f=4y5z8; 936 matrix M[2][3]=a,b,c,d,e,f; 937 netmatrixShort(M, 10); 938 938 } 939 939 … … 953 953 { 954 954 // 0 955 956 955 Net N; 956 list L; 957 957 958 958 // 1 959 960 959 L[1]=string(M); 960 N.rows=L; 961 961 962 962 // - 963 964 } 965 example 966 { 967 968 969 970 963 return(N); 964 } 965 example 966 { 967 "EXAMPLE:"; 968 ring r; 969 int M=5; 970 netInt(M); 971 971 } 972 972 … … 983 983 { 984 984 // 0 985 986 985 Net N; 986 list L; 987 987 988 988 // 1 989 990 989 L[1]=string(M); 990 N.rows=L; 991 991 992 992 // - 993 994 } 995 example 996 { 997 998 999 1000 993 return(N); 994 } 995 example 996 { 997 "EXAMPLE:"; 998 ring r; 999 bigint M=5; 1000 netBigInt(M); 1001 1001 } 1002 1002 … … 1015 1015 { 1016 1016 // 0 1017 1018 1017 Net N; 1018 list L; 1019 1019 1020 1020 // 1 1021 1022 1021 L[1]=M; 1022 N.rows=L; 1023 1023 1024 1024 // - 1025 1026 } 1027 example 1028 { 1029 1030 1031 1025 return(N); 1026 } 1027 example 1028 { 1029 "EXAMPLE:"; 1030 string M="Hallo"; 1031 netString(M); 1032 1032 } 1033 1033 … … 1047 1047 { 1048 1048 // 0 1049 1050 1049 matrix M=matrix(V); 1050 int Size=25; 1051 1051 1052 1052 // 1 1053 1054 1055 1053 if( size(#)!=0 ){// +1 1054 Size=#{1}; 1055 }// -1 1056 1056 1057 1057 // 2 1058 1059 1058 Net Output; 1059 Output=netmatrix(M, Size); 1060 1060 1061 1061 // - 1062 1063 } 1064 example 1065 { 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1062 return(Output); 1063 } 1064 example 1065 { 1066 "EXAMPLE:"; 1067 ring r1=101,(x,y,z),lp; 1068 poly a=2x3y4; 1069 poly b=2x3y4z; 1070 poly c=x3y4z5; 1071 poly d=5x6y7z10; 1072 poly e=2x3y; 1073 poly f=4y5z8; 1074 vector V=[a,b,c,d,e,f]; 1075 netvector(V); 1076 1076 } 1077 1077 … … 1091 1091 { 1092 1092 // 0 1093 1094 1095 1093 matrix M=matrix(V); 1094 Net Output; 1095 int Size=10; 1096 1096 1097 1097 // 1 1098 1099 1100 1098 if( size(#)!=0 ){// +1 1099 Size=#[1]; 1100 }// -1 1101 1101 1102 1102 // 2 1103 1103 Output=netmatrixShort(M, Size); 1104 1104 1105 1105 // - 1106 1107 } 1108 example 1109 { 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1106 return(Output); 1107 } 1108 example 1109 { 1110 "EXAMPLE:"; 1111 ring r1=101,(x,y,z),lp; 1112 poly a=2x3y4; 1113 poly b=2x3y4z-5x6y7z10; 1114 poly c=x3y4z5; 1115 poly d=5x6y7z10; 1116 poly e=2x3y; 1117 poly f=4y5z8+5x6y7z10; 1118 vector V=[a,b,c,d,e,f]; 1119 netvectorShort(V); 1120 1120 } 1121 1121 … … 1134 1134 " 1135 1135 { 1136 1137 1138 1139 1140 1141 1142 1136 /* 1137 0. Erstellung der benötigten Datenstrukturen 1138 2. ÃberprÃŒfung ob P das Nullpolynom ist und dieses gegenfalls ausgeben 1139 3. Entscheidung ob es sich um den ersten Term handel oder nicht 1140 3.1 Verarbeitung des ersten Term 1141 3.2 Verarbeitung foldender Terme 1142 */ 1143 1143 1144 1144 // (0.) 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1145 poly Q; 1146 list Output; 1147 Net N; 1148 string Up, Down, Test; 1149 int S, i; 1150 1151 if( P == 0 ) { // (1a) 1152 Down="0"; 1153 Up=" "; 1154 } // (1a) 1155 1156 if( P == 1 ) { // (1b) 1157 Down="1"; 1158 Up=" "; 1159 P=0; 1160 } // (1b) 1161 1162 if( P == -1 ) { // (1c) 1163 Down="-1"; 1164 Up=" "; 1165 P=0; 1166 } // (1c) 1167 1167 1168 1168 // (2.) 1169 1169 while ( P != 0 ) { // (2) 1170 1170 // (3.) 1171 1171 // (3.1.) 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1172 if ( Down == "" ){ // (2.1) 1173 Q=lead(P); 1174 P=P-lead(P); 1175 if ( leadcoef(Q) == 1 ) { // (2.1.1) 1176 } // (2.1.1) 1177 else { // (2.1.2) 1178 Test=string( leadcoef(Q) ); 1179 if( Test[1] == "-" ) { // (2.1.2.1)) 1180 if ( Test[2] == "1" && Test[3] == "" ) { // (2.1.2.1.1) 1181 Down=Down+"-"; 1182 Up=Up+emptyString(1); 1183 } // (2.1.2.1.1) 1184 else { // (2.1.2.1.2) 1185 Down=Down+string( leadcoef(Q) ); 1186 Up=Up+emptyString( size( string( leadcoef(Q) ) ) ); //size(leadcoef(-1))=1, deshalb size(string ... 1187 }// (2.1.2.1.2) 1188 } // (2.1.2.1) 1189 else { // (2.1.2.2) 1190 Down=Down+string( leadcoef(Q) ); // leading coef 1191 Up=Up+emptyString( size( string( leadcoef(Q) ) ) ); 1192 }// (2.1.2.2 1193 } // (2.1.2) 1194 S=size( ringlist(basering)[2] ); //variables 1195 for ( i=1; i<=S; i++) { // (2.1.1) 1196 if ( leadexp(Q)[i] == 0 ) { // (2.1.1.1) 1197 } 1198 else { // (2.1.1.2)) 1199 Down=Down+string( ringlist( basering )[2][i] ); 1200 Up=Up+emptyString( size (string( ringlist( basering )[2][i] ) ) ); 1201 if ( leadexp(Q)[i] == 1 ){ // (2.1.1.2.1)) 1202 } // (2.1.1.2.1) 1203 else { // (2.1.1.2.2) 1204 Up=Up+string( leadexp(Q)[i] ); 1205 Down=Down+emptyString( size( string( leadexp(Q)[i]) ) ); 1206 } // (2.1.1.2.2) 1207 } // (2.2.5.2) 1208 } // (2.1.1) 1209 } // (2.1) 1210 1210 // (3.2.) 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1211 else { // (2.2) 1212 Q=lead(P); 1213 P=P-lead(P); 1214 if ( leadcoef(Q) == 1 ) { // (2.2.1) 1215 Down=Down+"+"; 1216 Up=Up+" "; 1217 } // (2.2.1) 1218 else { // (2.2.2) 1219 Test=string( leadcoef(Q) ); 1220 if ( Test[1] == "-" ) { // (2.2.2.1) 1221 if ( Test[2] == "1" && Test[3] == "" ) { // (2.2.2.1.1)) 1222 Down=Down+"-"; 1223 Up=Up+emptyString(1); 1224 } // (2.2.2.1.1) 1225 else { // () 1226 Down=Down+string( leadcoef(Q) ); 1227 Up=Up+emptyString( size( string( leadcoef(Q) ) ) ); //size(leadcoef(-1))=1 1228 }// (2.2.2.1.2) 1229 } // (2.2.2.1) 1230 else { // (2.2.2.2) 1231 Down=Down+"+"; 1232 Up=Up+" "; 1233 Down=Down+string( leadcoef(Q) ); // leading coef 1234 Up=Up+emptyString( size( string( leadcoef(Q) ) ) ); 1235 } // (2.2.2.2) 1236 } // (2.2.2) 1237 1238 S=size( ringlist(basering)[2] ); //variables 1239 for ( i=1; i<=S; i++) { // (2.2.3) 1240 if ( leadexp(Q)[i] == 0 ) { // (2.2.3.1) 1241 } // (2.2.3.1) 1242 else { // (2.2.3.2) 1243 Down=Down+string( ringlist( basering )[2][i] ); 1244 Up=Up+emptyString( size (string( ringlist( basering )[2][i] ) ) ); 1245 if ( leadexp(Q)[i] == 1 ){ // (2.2.3.2.1) 1246 } // (2.2.3.2.1) 1247 else { // (2.2.3.2.2) 1248 Up=Up+string( leadexp(Q)[i] ); 1249 Down=Down+emptyString( size( string( leadexp(Q)[i]) ) ); 1250 } // (2.2.3.2.2) 1251 } // (2.2.3.2) 1252 } // (2.2.3) 1253 1254 } // (2.2) 1255 } // (2) 1256 1256 1257 1257 // 4 1258 1259 1258 Output=Up,Down; 1259 N.rows=Output; 1260 1260 1261 1261 // - 1262 1262 return(N); 1263 1263 } 1264 1264 example … … 1266 1266 "EXAMPLE:"; // from 3.3.1 Examples of ring declarations 1267 1267 // 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1268 ring R1 = 32003,(x,y,z),dp; 1269 poly q6=1; 1270 print(q6); 1271 netPoly(q6); 1272 poly q7=-1; 1273 print(q7); 1274 netPoly(q7); 1275 poly q8=2; 1276 print(q8); 1277 netPoly(q8); 1278 poly q9=-2; 1279 print(q9); 1280 netPoly(q9); 1281 poly q1=x+y+z; 1282 print(q1); 1283 netPoly(q1); 1284 poly q2=xy+xz+yz; 1285 print(q2); 1286 netPoly(q2); 1287 poly q3=2x3y3z4-3x4y5z6; 1288 print(q3); 1289 netPoly(q3); 1290 poly q4=x3y3z4-x4y5z6; 1291 print(q4); 1292 netPoly(q4); 1293 poly q5=-x3y3z4+x4y5z6; 1294 print(q5); 1295 netPoly(q5); 1296 1297 ring R2 = 32003,(x(1..10)),dp; 1298 1299 poly w6=1; 1300 print(w6); 1301 netPoly(w6); 1302 1303 poly w7=-1; 1304 print(w7); 1305 netPoly(w7); 1306 1307 poly w2=-x(1)-(2)-x(3); 1308 print(w2); 1309 netPoly(w2); 1310 1311 poly w3=x(1)*x(2)+x(1)*x(2)+x(2)*x(3); 1312 print(w3); 1313 netPoly(w3); 1314 1315 poly w4=x(1)*x(2)-x(1)*x(2)-x(2)*x(3); 1316 print(w4); 1317 netPoly(w4); 1318 1319 poly w5=x(1)^2*x(2)^3*x(3)^4; 1320 print(w5); 1321 netPoly(w5); 1322 1323 poly w8=x(1)+x(2)+x(3); 1324 print(w8); 1325 netPoly(w8); 1326 1327 poly w9=x(1)+x(2)+x(3); 1328 print(w9); 1329 netPoly(w9); 1330 1331 ring R3 = 32003,(x(1..5)(1..8)),dp; 1332 1333 poly e1=x(1)(1)+x(2)(2)+x(3)(3); 1334 print(e1); 1335 netPoly(e1); 1336 1337 poly e2=x(1)(1)*x(2)(2)*x(3)(3); 1338 print(e2); 1339 netPoly(e2); 1340 1341 poly e3=x(1)(1)^2*x(2)(2)^3*x(3)(3)^4; 1342 print(e3); 1343 netPoly(e3); 1344 1345 poly e4=-x(1)(1)^2*x(2)(2)^3*x(3)(3)^4-x(1)(1)^3*x(2)(2)^3*x(3)(3)^4; 1346 print(e4); 1347 netPoly(e4); 1348 1349 ring r=32003,(x,y,z),lp; 1350 poly p=x4+4y4+4z4-x3-3y3-3z3+1x2+2y2+z2-x-1y-z1; 1351 p; 1352 netPoly(p); 1353 1354 poly p2=x3yz+xy3z+xyz3-2x2yz-2xy2z-2xyz2+1xyz+x1yzxy1z; 1355 p2; 1356 netPoly(p2); 1357 1358 poly p3=x+y+z-x2-3y-4z4+xy+xz+2xy-x2y-xz2-y2z2; 1359 p3; 1360 netPoly(p3); 1361 1362 ring r2=32003,(x(1..10)),lp; 1363 poly p=x(1)*x(2)*x(3)+2*x(1)^2+2*x(1)*x(2); 1364 p; 1365 netPoly(p); 1366 1367 poly p2=x(1)^2*x(2)^3*x(3)^4-2*x(1)^1*x(2)^2+2*x(1)*x(2)*x(10); 1368 p2; 1369 netPoly(p2); 1370 1371 ring r3=7,(x,y,z),lp; 1372 poly p=17x2+24y; 1373 p; 1374 1374 netPoly(p); 1375 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1376 ring r4=(7,a,b,c),(x,y,z),Dp; 1377 poly p=2ax2+by-cz3; 1378 p; 1379 netPoly(p); 1380 1381 ring r5=(7,a),(x,y,z),dp; 1382 minpoly = a^2+a+3; 1383 poly p=2ax2+y-az3; 1384 p; 1385 netPoly(p); 1386 1387 ring r6 = (complex,30,j),(x,y,z),dp; 1388 poly p=2x2+y-z3+20*j; 1389 p; 1390 netPoly(p); 1391 1391 } 1392 1392 … … 1404 1404 " 1405 1405 { 1406 1407 1408 1409 1410 1411 1412 1413 1406 string N=string("<"); 1407 1408 for (int i=1; i<size(I); i++){ // (1) 1409 N=N+string(I[i])+string(", "); 1410 } // (1) 1411 1412 N=N+string(I[size(I)])+string(">"); 1413 return(net(N)); 1414 1414 } 1415 1415 example 1416 1416 { 1417 1417 "EXAMPLE:"; 1418 1419 1420 1418 ring r; 1419 ideal I=2x3y4,2x3y4z+x3y4z5,5x6y7z10-2x3y+4y5z8; 1420 netIdeal(I); 1421 1421 } 1422 1422 -
Singular/LIB/polyclass.lib
r99d029 r075bc5 24 24 polynomial is defined then an interval containing the rational parameter value. 25 25 26 Acknowledgements: This research was supported by 27 the Staff Exchange Bursary Programme of the University of Pretoria, DFG SPP 1489, 26 Acknowledgements: This research was supported by 27 the Staff Exchange Bursary Programme of the University of Pretoria, DFG SPP 1489, 28 28 DFG TRR 195. The financial assistance of the National Research Foundation (NRF), 29 South Africa, towards this research is hereby acknowledged. Opinions expressed 30 and conclusions arrived at are those of the author and are not necessarily to be 29 South Africa, towards this research is hereby acknowledged. Opinions expressed 30 and conclusions arrived at are those of the author and are not necessarily to be 31 31 attributed to the National Research Foundation, South Africa. 32 32 -
Singular/LIB/primdec.lib
r99d029 r075bc5 8388 8388 ser=imap(@Phelp,ser); 8389 8389 } 8390 8390 // } 8391 8391 } 8392 8392 if(abspri) -
Singular/LIB/primdecint.lib
r99d029 r075bc5 1137 1137 //=== leading terms of the Groebner basis above 1138 1138 def quring=Primdec::prepareQuotientring(nvars(basering)-L[1][3],"lp"); 1139 1139 setring quring; 1140 1140 ideal I=imap(Shelp,I); 1141 1141 list C; -
Singular/LIB/realclassify.lib
r99d029 r075bc5 19 19 Birkh\"auser, Boston 1985 20 20 21 J. Boehm, M.S. Marais, A. Steenpass: The Classification of Real Singularities Using Singular. 21 J. Boehm, M.S. Marais, A. Steenpass: The Classification of Real Singularities Using Singular. 22 22 Part III: Unimodal Singularities of Corank 2, https://arxiv.org/abs/1512.09028 23 23 … … 26 26 27 27 M.S. Marais, A. Steenpass: The Classification of Real Singularities Using SINGULAR. Part I: 28 Splitting Lemma and Simple Singularities, J. Symb. Comput. 68 (2015), 61-71 29 30 M.S. Marais, A. Steenpass: The Classification of Real Singularities Using SINGULAR. Part II: 31 The Structure of the Equivalence Classes of the Unimodal Singularities, 32 J. Symb. Comput. 74 (2016), 346-366 33 34 35 36 Acknowledgements: This research was supported by 28 Splitting Lemma and Simple Singularities, J. Symb. Comput. 68 (2015), 61-71 29 30 M.S. Marais, A. Steenpass: The Classification of Real Singularities Using SINGULAR. Part II: 31 The Structure of the Equivalence Classes of the Unimodal Singularities, 32 J. Symb. Comput. 74 (2016), 346-366 33 34 35 36 Acknowledgements: This research was supported by 37 37 the Staff Exchange Bursary Programme of the University of Pretoria, DFG SPP 1489, and 38 38 DFG TRR 195. The financial assistance of the National Research Foundation (NRF), 39 South Africa, towards this research is hereby acknowledged. Opinions expressed 40 and conclusions arrived at are those of the author and are not necessarily to be 39 South Africa, towards this research is hereby acknowledged. Opinions expressed 40 and conclusions arrived at are those of the author and are not necessarily to be 41 41 attributed to the National Research Foundation, South Africa. 42 42 -
Singular/LIB/sets.lib
r99d029 r075bc5 208 208 if(isEqual(L[i],L[j])){ //and tag those appearances with 0 209 209 L1[j] = 0; 210 210 } 211 211 } 212 212 } -
Singular/Makefile.am
r99d029 r075bc5 171 171 Singular_SOURCES = tesths.cc fegetopt.c fegetopt.h utils.cc utils.h 172 172 173 Singular_LDADD = libSingular.la ${OMALLOC_LIBS} ${BUILTIN_FLAGS} 173 Singular_LDADD = libSingular.la ${OMALLOC_LIBS} ${BUILTIN_FLAGS} 174 174 175 175 Singular_LDFLAGS = -static ${AM_LDFLAGS} ${BUILTIN_FLAGS} -
Singular/distrib.h
r99d029 r075bc5 1 #undef MAKE_DISTRIBUTION 1 #undef MAKE_DISTRIBUTION -
Singular/dyn_modules/cohomo/cohomo.cc
r99d029 r075bc5 326 326 //Print("This is the first quotient generators %d:\n",i); 327 327 //id_print(rsr); 328 break; 328 break; 329 329 } 330 330 } -
Singular/ipassign.cc
r99d029 r075bc5 1147 1147 if (lt==DEF_CMD) 1148 1148 { 1149 1149 1150 1150 if (TEST_V_ALLWARN 1151 1151 && (rt!=RING_CMD) -
Singular/table.h
r99d029 r075bc5 1321 1321 // list -> resolution 1322 1322 { LIST_CMD, RESOLUTION_CMD, NULL_VAL , D(iiL2R) }, 1323 // matrix -> smatrix 1323 // matrix -> smatrix 1324 1324 { MATRIX_CMD, SMATRIX_CMD, D(iiMa2Mo), NULL_VAL }, 1325 // module -> smatrix 1325 // module -> smatrix 1326 1326 { MODUL_CMD, SMATRIX_CMD, D(iiDummy), NULL_VAL }, 1327 // smatrix -> matrix 1327 // smatrix -> matrix 1328 1328 { SMATRIX_CMD, MATRIX_CMD, D(iiMo2Ma) , NULL_VAL }, 1329 // smatrix -> module 1329 // smatrix -> module 1330 1330 { SMATRIX_CMD, MODUL_CMD, D(iiDummy) , NULL_VAL }, 1331 1331 #ifdef SINGULAR_4_2 -
Tst/Long/ffmodstd_l.tst
r99d029 r075bc5 132 132 +170917294964147477964/78125*x^56+27375956034589260316544/390625*x^55 133 133 +19378603191850308269589142/9765625*x^54+2448650350712503736801443296/48828125*x^53 134 +55672075194002311873568354064/48828125*x^52 134 +55672075194002311873568354064/48828125*x^52 135 135 +5731472812399299954951906571776/244140625*x^51 136 136 +537353482803997876746241024607976/1220703125*x^50 -
Tst/Long/fres_l.tst
r99d029 r075bc5 11 11 for (k = j-1; k >= i; k--) { 12 12 J[i-1+j-k] = I[k]; 13 } 13 } 14 14 i = j; 15 15 } … … 23 23 // AGR2@10007n09d5 24 24 ring r = 10007, (a,b,c,d,e,f,g,h,i,j), dp; 25 ideal I = 25 ideal I = 26 26 i^3-1564*a^2*j+4777*a*b*j+1689*b^2*j+3558*a*c*j-153*b*c*j-2220*c^2*j+4914*a*d*j-4868*b*d*j-2913*c*d*j-1334*d^2*j+4072*a*e*j+69*b*e*j-2701*c*e*j+3773*d*e*j-574*e^2*j-4413*a*f*j+1491*b*f*j-4626*c*f*j-2123*d*f*j+303*e*f*j+3147*f^2*j+1276*a*g*j+1812*b*g*j+4120*c*g*j-4795*d*g*j+934*e*g*j+1072*f*g*j+3527*g^2*j+3547*a*h*j-2371*b*h*j-1902*c*h*j+4864*d*h*j-1428*e*h*j-801*f*h*j+4787*g*h*j+4996*h^2*j-72*a*i*j+333*b*i*j+3900*c*i*j-4743*d*i*j+3328*e*i*j-1100*f*i*j-3058*g*i*j-1292*h*i*j-2096*i^2*j+4993*a*j^2+3831*b*j^2+888*c*j^2-557*d*j^2-4256*e*j^2+198*f*j^2-1576*g*j^2-2009*h*j^2+3843*i*j^2+2482*j^3, 27 27 h*i^2-2494*a^2*j+2054*a*b*j+4076*b^2*j-2542*a*c*j-3461*b*c*j+1101*c^2*j+2651*a*d*j+199*b*d*j+985*c*d*j+1849*d^2*j-1546*a*e*j+1651*b*e*j+933*c*e*j+3021*d*e*j-805*e^2*j-3540*a*f*j-1731*b*f*j+2985*c*f*j-1018*d*f*j-1412*e*f*j-2889*f^2*j+3517*a*g*j-336*b*g*j-2331*c*g*j+144*d*g*j-3224*e*g*j+4781*f*g*j-1174*g^2*j+1477*a*h*j+2028*b*h*j+2755*c*h*j-717*d*h*j-4136*e*h*j-4870*f*h*j+3690*g*h*j+1748*h^2*j-2375*a*i*j+4513*b*i*j-1418*c*i*j+4832*d*i*j+74*e*i*j+743*f*i*j+4834*g*i*j+2898*h*i*j-4514*i^2*j-502*a*j^2+4670*b*j^2-2800*c*j^2-3874*d*j^2-4045*e*j^2-3913*f*j^2-2786*g*j^2+4105*h*j^2-3938*i*j^2+2870*j^3, … … 207 207 // CNC@32003g14%1 208 208 ring r = 32003, (t_0,t_1,t_2,t_3,t_4,t_5,t_6,t_7,t_8,t_9,t_10,t_11,t_12,t_13), dp; 209 ideal I = 209 ideal I = 210 210 t_10^2+2652*t_0*t_11-6555*t_1*t_11+10309*t_2*t_11-13575*t_3*t_11-9153*t_4*t_11+8721*t_5*t_11-11676*t_6*t_11-15242*t_7*t_11-7792*t_8*t_11-2459*t_9*t_11+12327*t_10*t_11-8487*t_11^2+12310*t_0*t_12+15808*t_1*t_12-2153*t_2*t_12-3423*t_3*t_12-12591*t_4*t_12-6341*t_5*t_12-12789*t_6*t_12-9762*t_7*t_12+9138*t_8*t_12+5058*t_9*t_12-7003*t_10*t_12-3746*t_11*t_12-2842*t_12^2+5886*t_0*t_13+15728*t_1*t_13+12576*t_2*t_13+3870*t_3*t_13-13986*t_4*t_13-3972*t_5*t_13-14449*t_6*t_13-6680*t_7*t_13+14618*t_8*t_13+15490*t_9*t_13+3746*t_10*t_13+2842*t_11*t_13, 211 211 t_9*t_10+6661*t_0*t_11+3543*t_1*t_11+7900*t_2*t_11+615*t_3*t_11-11883*t_4*t_11-7057*t_5*t_11-2572*t_6*t_11-2352*t_7*t_11+2400*t_8*t_11+14478*t_9*t_11+3634*t_10*t_11-3396*t_11^2+12932*t_0*t_12+2137*t_1*t_12+6710*t_2*t_12-8634*t_3*t_12-13636*t_4*t_12-5254*t_5*t_12+10266*t_6*t_12-12601*t_7*t_12-14761*t_8*t_12-8022*t_9*t_12-1832*t_10*t_12-14080*t_11*t_12-7974*t_12^2-10037*t_0*t_13-7325*t_1*t_13-11486*t_2*t_13-11310*t_3*t_13+7826*t_4*t_13-7914*t_5*t_13+10200*t_6*t_13+283*t_7*t_13+4388*t_8*t_13+5228*t_9*t_13+14080*t_10*t_13+7974*t_11*t_13, … … 292 292 // PCNC@16183g14_2%1 293 293 ring r = 16183, (t_0,t_1,t_2,t_3,t_4,t_5,t_6,t_7,t_8,t_9,t_10,t_11,t_12), dp; 294 ideal I = 294 ideal I = 295 295 t_6*t_9+4738*t_7*t_9-1150*t_8*t_9-6021*t_9^2-2099*t_0*t_10-250*t_1*t_10-708*t_2*t_10-4870*t_3*t_10+1978*t_4*t_10-3869*t_5*t_10-4563*t_6*t_10+1710*t_7*t_10-5237*t_8*t_10+6689*t_9*t_10-2205*t_10^2+4452*t_0*t_11+981*t_1*t_11-7579*t_2*t_11-4460*t_3*t_11-1286*t_4*t_11-6578*t_5*t_11-1087*t_6*t_11+5192*t_7*t_11+5955*t_8*t_11+4918*t_9*t_11-5757*t_10*t_11+3331*t_11^2-273*t_0*t_12-3734*t_1*t_12+2482*t_2*t_12+5154*t_3*t_12+6403*t_4*t_12+527*t_5*t_12+6066*t_6*t_12+3539*t_7*t_12-2713*t_8*t_12+5757*t_9*t_12-3331*t_10*t_12, 296 296 t_5*t_9+4468*t_7*t_9+3024*t_8*t_9+2551*t_9^2-821*t_0*t_10-6233*t_1*t_10+2169*t_2*t_10-7556*t_3*t_10+6599*t_4*t_10+6120*t_5*t_10+5930*t_6*t_10-4419*t_7*t_10+542*t_8*t_10+2512*t_9*t_10+5747*t_10^2+1054*t_0*t_11+6197*t_1*t_11+5846*t_2*t_11-4058*t_3*t_11-1092*t_4*t_11+746*t_5*t_11-4088*t_6*t_11-3922*t_7*t_11+4094*t_8*t_11+5196*t_9*t_11+4763*t_10*t_11+5738*t_11^2+7817*t_0*t_12+1710*t_1*t_12-2542*t_2*t_12-5028*t_3*t_12+5039*t_4*t_12+5483*t_5*t_12+829*t_6*t_12-6606*t_7*t_12+5240*t_8*t_12-4763*t_9*t_12-5738*t_10*t_12, -
Tst/Short/fres_s.tst
r99d029 r075bc5 11 11 for (k = j-1; k >= i; k--) { 12 12 J[i-1+j-k] = I[k]; 13 } 13 } 14 14 i = j; 15 15 } … … 23 23 // AGR@10007n6d5s12%1 24 24 ring r = 10007, (a,b,c,d,e,f,g), dp; 25 ideal I = 25 ideal I = 26 26 a*g+3049*b*g-3031*c*g-3872*d*g-1218*e*g-4936*f*g, 27 27 e*f+2193*b*g+2675*c*g+1570*d*g+334*e*g+3234*f*g, … … 67 67 // CNC@32003g08%1 68 68 ring r = 32003, (t_0,t_1,t_2,t_3,t_4,t_5,t_6,t_7), dp; 69 ideal I = 69 ideal I = 70 70 t_4^2-11562*t_0*t_5+7830*t_1*t_5+15848*t_2*t_5+15318*t_3*t_5+14862*t_4*t_5-2359*t_5^2-8147*t_0*t_6+8135*t_1*t_6-10982*t_2*t_6+10294*t_3*t_6+8855*t_4*t_6+13975*t_5*t_6+10574*t_6^2+8020*t_0*t_7-4337*t_1*t_7+6847*t_2*t_7-6496*t_3*t_7-13975*t_4*t_7-10574*t_5*t_7, 71 71 t_3*t_4+11991*t_0*t_5-3476*t_1*t_5-14374*t_2*t_5-2073*t_3*t_5+15332*t_4*t_5-12792*t_5^2-2016*t_0*t_6-7341*t_1*t_6-13969*t_2*t_6-9983*t_3*t_6-2784*t_4*t_6+13194*t_5*t_6-7842*t_6^2-10289*t_0*t_7-15961*t_1*t_7-5349*t_2*t_7+15576*t_3*t_7-13194*t_4*t_7+7842*t_5*t_7, … … 105 105 // PCNC@15187g08_2%1 106 106 ring r = 15187, (t_0,t_1,t_2,t_3,t_4,t_5,t_6), dp; 107 ideal I = 107 ideal I = 108 108 t_0*t_3-3644*t_1*t_3-7273*t_2*t_3+5401*t_3^2-2661*t_0*t_4+6152*t_1*t_4-3933*t_2*t_4+1737*t_3*t_4-1074*t_4^2-2635*t_0*t_5+1869*t_1*t_5-3554*t_2*t_5+3969*t_3*t_5+4742*t_4*t_5-1304*t_5^2-3337*t_0*t_6+1817*t_1*t_6-2895*t_2*t_6-4742*t_3*t_6+1304*t_4*t_6, 109 109 t_2^2-2264*t_1*t_3+1177*t_2*t_3-3592*t_3^2-6351*t_0*t_4-1812*t_1*t_4+3443*t_2*t_4+5781*t_3*t_4+2493*t_4^2+6075*t_0*t_5+3311*t_1*t_5-1124*t_2*t_5+3768*t_3*t_5-6805*t_4*t_5+6770*t_5^2-3162*t_0*t_6-4657*t_1*t_6-6261*t_2*t_6+6805*t_3*t_6-6770*t_4*t_6, -
Tst/Short/modules.tst
r99d029 r075bc5 102 102 matrix m[2][2]=x,y3,z,xz; 103 103 Matrix Ma=m; 104 FreeModule M=Source(Ma); 104 FreeModule M=Source(Ma); 105 105 M; 106 106 Degree(M); -
Tst/Short/nets.tst
r99d029 r075bc5 53 53 54 54 kill r; 55 ring r = 0,(x,y,z,a,b,c),(ds(3), dp(3)); 55 ring r = 0,(x,y,z,a,b,c),(ds(3), dp(3)); 56 56 netRing(r); 57 57 … … 242 242 kill r; 243 243 244 ring r=7,(x,y,z),lp; 245 poly p=17x2+24y; 244 ring r=7,(x,y,z),lp; 245 poly p=17x2+24y; 246 246 p; 247 247 netPoly(p); -
doc/NEWS.texi
r99d029 r075bc5 32 32 @item freegb.lib: lpDivision, lpPrint (@nref{freegb_lib}) 33 33 @item fpadim.lib (@nref{fpadim_lib}) 34 @item schreyer.lib: deprecated 34 @item schreyer.lib: deprecated 35 35 @item goettsche.lib: new, extended version (The Nakajima-Yoshioka formula up to n-th degree,Poincare Polynomial of the punctual Quot-scheme of rank r on n planar points Betti numbers of the punctual Quot-scheme of rank r on n planar points)(@nref{goettsche_lib}) 36 36 @item grobcov.lib: small bug fix (@nref{grobcov_lib}) -
libpolys/polys/monomials/p_polys.h
r99d029 r075bc5 1517 1517 } 1518 1518 const long* _ordsgn = (long*) r->ordsgn; 1519 #if 1 /* two variants*/ 1519 #if 1 /* two variants*/ 1520 1520 if (_v1 > _v2) 1521 1521 { -
misc/lt.cc
r99d029 r075bc5 31 31 } 32 32 } 33 return FALSE; /* not found */ 33 return FALSE; /* not found */ 34 34 } 35 35 WerrorS("same_lt(ideal)"); -
misc/lt2.cc
r99d029 r075bc5 32 32 } 33 33 } 34 return FALSE; /* not found */ 34 return FALSE; /* not found */ 35 35 } 36 36 WerrorS("same_lt(ideal)");
Note: See TracChangeset
for help on using the changeset viewer.