Changeset da05799 in git
- Timestamp:
- Nov 23, 2023, 2:55:20 PM (6 months ago)
- Branches:
- (u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')
- Children:
- 314804350c1c90de217107755f6c8496d424a4a8
- Parents:
- aa56047b340ec16bc4b83c34472830b3a59783cd
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/JMBTest.lib
raa56047 rda05799 1 1 ////////////////////////////////////////////////////////////////////// 2 version="version JMBTest.lib 4. 2.0.2 dec_2021"; // $Id$2 version="version JMBTest.lib 4.4.0.0 Nov_2023 "; // $Id$ 3 3 category="Algebraic Geometry"; 4 4 // summary description of the library … … 24 24 mod Vm is different from zero, the given one is not a J-Marked basis. 25 25 26 The algorithm terminates only if the ordering is rp.26 The algorithm terminates only if the ordering is ip. 27 27 Anyway, the number of reduction steps is bounded. 28 28 … … 72 72 example 73 73 { "EXAMPLE:"; echo = 2; 74 ring r=0, (x,y,z), rp;74 ring r=0, (x,y,z), ip; 75 75 jmp r1; 76 76 r1.h=z^3; … … 148 148 example 149 149 { "EXAMPLE:"; echo = 2; 150 ring r=0, (x,y,z), rp;150 ring r=0, (x,y,z), ip; 151 151 jmp r1; 152 152 r1.h=z^3; … … 181 181 example 182 182 { "EXAMPLE:"; echo = 2; 183 ring r=0, (x,y,z), rp;183 ring r=0, (x,y,z), ip; 184 184 ideal I=y,x,z; 185 185 Minimus(I); … … 203 203 example 204 204 { "EXAMPLE:"; echo = 2; 205 ring r=0, (x,y,z), rp;205 ring r=0, (x,y,z), ip; 206 206 ideal I=y,x,z; 207 207 Maximus(I); … … 246 246 example 247 247 { "EXAMPLE:"; echo = 2; 248 ring r=0, (x,y,z), rp;248 ring r=0, (x,y,z), ip; 249 249 jmp p1; 250 250 p1.h=poly(1); … … 292 292 if(A[1]>B[1]) 293 293 { 294 //the ordering MUST be rp294 //the ordering MUST be ip 295 295 //print("Maggiore per Lex"); 296 296 d=1; … … 301 301 example 302 302 { "EXAMPLE:"; echo = 2; 303 ring r=0, (x,y,z), rp;303 ring r=0, (x,y,z), ip; 304 304 jmp r1; 305 305 r1.h=z^3; … … 345 345 example 346 346 { "EXAMPLE:"; echo = 2; 347 ring r=0, (x,y,z), rp;347 ring r=0, (x,y,z), ip; 348 348 jmp r1; 349 349 r1.h=z^3; … … 387 387 example 388 388 { "EXAMPLE:"; echo = 2; 389 ring r=0, (x,y,z), rp;389 ring r=0, (x,y,z), ip; 390 390 jmp r1; 391 391 r1.h=z^3; … … 415 415 example 416 416 { "EXAMPLE:"; echo = 2; 417 ring r=0, (x,y,z), rp;417 ring r=0, (x,y,z), ip; 418 418 jmp r1; 419 419 r1.h=z^3; … … 447 447 example 448 448 { "EXAMPLE:"; echo = 2; 449 ring r=0, (x,y,z), rp;449 ring r=0, (x,y,z), ip; 450 450 list P=x^2,1,1; 451 451 jmp r1; … … 492 492 example 493 493 { "EXAMPLE:"; echo = 2; 494 ring r=0, (x,y,z,t), rp;494 ring r=0, (x,y,z,t), ip; 495 495 jmp r1; 496 496 r1.h=z^3; … … 633 633 example 634 634 { "EXAMPLE:"; echo = 2; 635 ring r=0, (x,y,z), rp;635 ring r=0, (x,y,z), ip; 636 636 jmp r1; 637 637 r1.h=z^3; … … 676 676 example 677 677 { "EXAMPLE:"; echo = 2; 678 ring r=0, (x,y,z), rp;678 ring r=0, (x,y,z), ip; 679 679 jmp r1; 680 680 r1.h=z^3; … … 730 730 example 731 731 { "EXAMPLE:"; echo = 2; 732 ring r=0, (x,y,z), rp;732 ring r=0, (x,y,z), ip; 733 733 jmp A; 734 734 A.h=y*z^2; … … 786 786 example 787 787 { "EXAMPLE:"; echo = 2; 788 ring r=0, (x,y,z), rp;788 ring r=0, (x,y,z), ip; 789 789 jmp r1; 790 790 r1.h=z^3; … … 816 816 example 817 817 { "EXAMPLE:"; echo = 2; 818 ring r=0, (x,y,z), rp;818 ring r=0, (x,y,z), ip; 819 819 jmp r1; 820 820 r1.h=z^3; … … 959 959 example 960 960 { "EXAMPLE:"; echo = 2; 961 ring r=0, (x,y,z), rp;961 ring r=0, (x,y,z), ip; 962 962 jmp r1; 963 963 r1.h=z^3; -
Singular/LIB/pointid.lib
raa56047 rda05799 1 1 ///////////////////////////////////////////////////////////////////////////// 2 version="version pointid.lib 4. 1.2.0 Feb_2019"; // $Id$2 version="version pointid.lib 4.4.0.0 Nov_2023 "; // $Id$ 3 3 category="Commutative Algebra"; 4 4 info=" … … 88 88 - a module s.t. the ai are generators or@* 89 89 - a matrix s.t. the ai are columns 90 ASSUME: basering must have ordering rp, i.e., be of the form 0,x(1..n),rp;90 ASSUME: basering must have ordering ip, i.e., be of the form 0,x(1..n),ip; 91 91 (the first entry of a point belongs to the lex-smallest variable, etc.) 92 92 RETURN: ideal, the non-monomials of the vanishing ideal I(A) of A … … 218 218 example 219 219 { "EXAMPLE:"; echo = 2; 220 ring R1 = 0,x(1..3), rp;220 ring R1 = 0,x(1..3),ip; 221 221 vector a1 = [4,0,0]; 222 222 vector a2 = [2,1,4]; … … 240 240 nonMonomials(MOD); 241 241 242 ring R2 = 0,x(1..2), rp;242 ring R2 = 0,x(1..2),ip; 243 243 list l1 = 0,0; 244 244 list l2 = 0,1; … … 362 362 example 363 363 { "EXAMPLE:"; echo = 2; 364 ring R = 0,x(1..3), rp;364 ring R = 0,x(1..3),ip; 365 365 poly n1 = 1; 366 366 poly n2 = x(1); … … 387 387 - a module s.t. the ai are generators or@* 388 388 - a matrix s.t. the ai are columns 389 ASSUME: basering must have ordering rp, i.e., be of the form 0,x(1..n),rp;389 ASSUME: basering must have ordering ip, i.e., be of the form 0,x(1..n),ip; 390 390 (the first entry of a point belongs to the lex-smallest variable, etc.) 391 391 RETURN: a list where the first entry contains the Groebner basis G of I(A) … … 641 641 example 642 642 { "EXAMPLE:"; echo = 2; 643 ring R = 0,x(1..3), rp;643 ring R = 0,x(1..3),ip; 644 644 vector a1 = [4,0,0]; 645 645 vector a2 = [2,1,4];
Note: See TracChangeset
for help on using the changeset viewer.