- Timestamp:
- Nov 6, 2013, 6:07:39 PM (10 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 823679a657c538153cba3a477bf92e2c9102c451
- Parents:
- 2ea781ea236dc6d65399e46b262e9954538749a1d600e1863951bfc5135d0138b61badb20b1ec70a
- Location:
- Singular
- Files:
-
- 11 edited
-
LIB/binresol.lib (modified) (1 diff)
-
LIB/ellipticcovers.lib (modified) (2 diffs)
-
LIB/primdec.lib (modified) (3 diffs)
-
LIB/schubert.lib (modified) (38 diffs)
-
cntrlc.cc (modified) (2 diffs)
-
cntrlc.h (modified) (1 diff)
-
ipid.cc (modified) (1 diff)
-
links/semaphore.c (modified) (5 diffs)
-
links/simpleipc.h (modified) (2 diffs)
-
links/ssiLink.cc (modified) (1 diff)
-
misc_ip.cc (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/binresol.lib
rd600e18 r2fa80a 1 1 /////////////////////////////////////////////////////////////////////////// 2 2 version="version binresol.lib 4.0.0.0 Jun_2013 "; // $Id$ 3 category="Commuta ive algebra";3 category="Commutative algebra"; 4 4 info=" 5 5 LIBRARY: binresol.lib Combinatorial algorithm of resolution of singularities -
Singular/LIB/ellipticcovers.lib
rd600e18 r2fa80a 23 23 over a rational function. The path integral is computed as a residue. 24 24 25 The sum of N_(G,b) over all branch types b of sum d gives the25 The sum of N_(G,b) over all branch types b of sum d gives N_(G,d)*|Aut(G)|, with the 26 26 Gromov-Witten invariant N_(G,d) of degree d stable maps from a genus g curve 27 27 of topological type G to the elliptic curve. … … 380 380 THEORY: Computes @* 381 381 382 - the Gromov-Witten of a given propagator P, or @*383 384 - the invariant N_(G,d) where d is the degree of the covering, or @*382 - the Gromov-Witten invariant of a given propagator P, or @* 383 384 - the invariant N_(G,d)*|Aut(G)| where d is the degree of the covering, or @* 385 385 386 386 - the number N_(G,b) of coverings with source G and target an elliptic curves with branch type a over a -
Singular/LIB/primdec.lib
rd600e18 r2fa80a 3769 3769 I=interred(I+F);option(set,save);return(I); 3770 3770 } 3771 I=simplify(I,1);3771 //I=simplify(I,1); 3772 3772 3773 3773 for(i=1;i<=n;i++) //consider all polynomials over … … 3780 3780 ideal F=imap(R,F); 3781 3781 3782 string nR="ring @S="+string(p)+",(y(1..m),"+varstr(R)+","+parstr(R)+"),dp;"; 3782 string nR1="ring @S1="+string(p)+",("+varstr(R)+","+parstr(R)+",@y(1..m)),dp;"; 3783 execute(nR1); 3784 list lR=ringlist(@S1)[2]; 3785 lR=lR[(size(lR)-m+1)..(size(lR))]; 3786 3787 string nR="ring @S="+string(p)+",("+string(lR)+","+varstr(R)+","+parstr(R)+"),dp;"; 3783 3788 execute(nR); 3784 3789 … … 3792 3797 { 3793 3798 J=J,var(i)^k-var(m+n+i); 3794 el=el* y(i);3799 el=el*var(i); 3795 3800 } 3796 3801 -
Singular/LIB/schubert.lib
rd600e18 r2fa80a 1 1 //////////////////////////////////////////////////////////////////////////////// 2 version="version schubert.lib 4.0.0.0 Jun_2013 "; // $Id$2 version="version schubert.lib 4.0.0.0 Nov_2013 "; // $Id$ 3 3 category="Algebraic Geometry"; 4 4 info=" 5 LIBRARY: Schubert.lib Proceduces for Intersection Theory6 7 AUTHOR: Hiep Dang, email: hiep@mathematik.uni-kl.de5 LIBRARY: schubert.lib Proceduces for Intersection Theory 6 7 AUTHOR: Hiep Dang, email: hiep@mathematik.uni-kl.de 8 8 9 9 OVERVIEW: 10 10 11 11 We implement new classes (variety, sheaf, stack, graph) and methods for 12 computing with them. Here a variety is represented by a nonnegative integer13 which is its dimension and a graded ring which is its Chow ring. A sheaf is14 represented by a variety and a polynomial which is its Chern character.15 In particular, we implement the concrete varieties such as projective spaces16 , Grassmannians, and projective bundles.12 computing with them. An abstract variety is represented by a nonnegative 13 integer which is its dimension and a graded ring which is its Chow ring. 14 An abstract sheaf is represented by a variety and a polynomial which is its 15 Chern character. In particular, we implement the concrete varieties such as 16 projective spaces, Grassmannians, and projective bundles. 17 17 18 18 An important task of this library is related to the computation of … … 24 24 Kontsevich, and the graphs corresponding to the fixed point components of a 25 25 torus action on the moduli spaces of stable maps. 26 27 As an insightful example, the numbers of rational curves on general complete 28 intersection Calabi-Yau threefolds in projective spaces are computed up to 29 degree 6. The results are all in agreement with predictions made from mirror 30 symmetry computations. 26 31 27 32 REFERENCES: … … 95 100 dualPartition(list) compute the dual of a partition 96 101 97 KEYWORDS: Intersection Theory; Enumerative Geometry; Schubert Calculus;98 Bott's formula .102 KEYWORDS: Intersection theory; Enumerative geometry; Schubert calculus; 103 Bott's formula; Gromov-Witten invariants. 99 104 100 105 "; … … 217 222 " 218 223 { 219 int i,j,k,h,m,n,p ;224 int i,j,k,h,m,n,p,q; 220 225 list l; 221 226 int d = M.degreeCurve; … … 228 233 if (i <> j) 229 234 { 230 l = insert(l,list(graph1(d,i,j),2*d),size(l));235 l[size(l)+1] = list(graph1(d,i,j),2*d); 231 236 } 232 237 } … … 242 247 if (i <> j and j <> k) 243 248 { 244 l = insert(l,list(graph2(list(1,1),i,j,k),2),size(l));249 l[size(l)+1] = list(graph2(list(1,1),i,j,k),2); 245 250 } 246 251 } … … 258 263 if (i <> j and j <> k) 259 264 { 260 l = insert(l,list(graph2(list(2,1),i,j,k),2),size(l));265 l[size(l)+1] = list(graph2(list(2,1),i,j,k),2); 261 266 for (h=0;h<=r;h++) 262 267 { 263 268 if (h <> k) 264 269 { 265 l = insert(l,list(graph31(list(1,1,1),i,j,k,h),2),size(l));270 l[size(l)+1] = list(graph31(list(1,1,1),i,j,k,h),2); 266 271 } 267 272 if (h <> j) 268 273 { 269 l = insert(l,list(graph32(list(1,1,1),i,j,k,h),6),size(l));274 l[size(l)+1] = list(graph32(list(1,1,1),i,j,k,h),6); 270 275 } 271 276 } … … 285 290 if (i <> j and j <> k) 286 291 { 287 l = insert(l,list(graph2(list(3,1),i,j,k),3),size(l));288 l = insert(l,list(graph2(list(2,2),i,j,k),8),size(l));292 l[size(l)+1] = list(graph2(list(3,1),i,j,k),3); 293 l[size(l)+1] = list(graph2(list(2,2),i,j,k),8); 289 294 for (h=0;h<=r;h++) 290 295 { 291 296 if (h <> k) 292 297 { 293 l = insert(l,list(graph31(list(2,1,1),i,j,k,h),2),size(l));294 l = insert(l,list(graph31(list(1,2,1),i,j,k,h),4),size(l));298 l[size(l)+1] = list(graph31(list(2,1,1),i,j,k,h),2); 299 l[size(l)+1] = list(graph31(list(1,2,1),i,j,k,h),4); 295 300 } 296 301 if (h <> j) 297 302 { 298 l = insert(l,list(graph32(list(2,1,1),i,j,k,h),4),size(l));303 l[size(l)+1] = list(graph32(list(2,1,1),i,j,k,h),4); 299 304 } 300 305 for (m=0;m<=r;m++) … … 302 307 if (k <> h and m <> h) 303 308 { 304 l = insert(l,list(graph41(list(1,1,1,1),i,j,k,h,m),2),size(l));309 l[size(l)+1] = list(graph41(list(1,1,1,1),i,j,k,h,m),2); 305 310 } 306 311 if (k <> h and m <> k) 307 312 { 308 l = insert(l,list(graph42(list(1,1,1,1),i,j,k,h,m),2),size(l));313 l[size(l)+1] = list(graph42(list(1,1,1,1),i,j,k,h,m),2); 309 314 } 310 315 if (h <> j and m <> j) 311 316 { 312 l = insert(l,list(graph43(list(1,1,1,1),i,j,k,h,m),24),size(l));317 l[size(l)+1] = list(graph43(list(1,1,1,1),i,j,k,h,m),24); 313 318 } 314 319 } … … 329 334 if (i <> j and j <> k) 330 335 { 331 l = insert(l,list(graph2(list(4,1),i,j,k),4),size(l));332 l = insert(l,list(graph2(list(3,2),i,j,k),6),size(l));336 l[size(l)+1] = list(graph2(list(4,1),i,j,k),4); 337 l[size(l)+1] = list(graph2(list(3,2),i,j,k),6); 333 338 for (h=0;h<=r;h++) 334 339 { 335 340 if (k <> h) 336 341 { 337 l = insert(l,list(graph31(list(3,1,1),i,j,k,h),3),size(l));338 l = insert(l,list(graph31(list(1,3,1),i,j,k,h),6),size(l));339 l = insert(l,list(graph31(list(2,2,1),i,j,k,h),4),size(l));340 l = insert(l,list(graph31(list(2,1,2),i,j,k,h),8),size(l));342 l[size(l)+1] = list(graph31(list(3,1,1),i,j,k,h),3); 343 l[size(l)+1] = list(graph31(list(1,3,1),i,j,k,h),6); 344 l[size(l)+1] = list(graph31(list(2,2,1),i,j,k,h),4); 345 l[size(l)+1] = list(graph31(list(2,1,2),i,j,k,h),8); 341 346 } 342 347 if (j <> h) 343 348 { 344 l = insert(l,list(graph32(list(3,1,1),i,j,k,h),6),size(l));345 l = insert(l,list(graph32(list(2,2,1),i,j,k,h),8),size(l));349 l[size(l)+1] = list(graph32(list(3,1,1),i,j,k,h),6); 350 l[size(l)+1] = list(graph32(list(2,2,1),i,j,k,h),8); 346 351 } 347 352 for (m=0;m<=r;m++) … … 349 354 if (k <> h and h <> m) 350 355 { 351 l = insert(l,list(graph41(list(2,1,1,1),i,j,k,h,m),2),size(l));352 l = insert(l,list(graph41(list(1,2,1,1),i,j,k,h,m),2),size(l));356 l[size(l)+1] = list(graph41(list(2,1,1,1),i,j,k,h,m),2); 357 l[size(l)+1] = list(graph41(list(1,2,1,1),i,j,k,h,m),2); 353 358 } 354 359 if (k <> h and k <> m) 355 360 { 356 l = insert(l,list(graph42(list(2,1,1,1),i,j,k,h,m),4),size(l));357 l = insert(l,list(graph42(list(1,2,1,1),i,j,k,h,m),4),size(l));358 l = insert(l,list(graph42(list(1,1,2,1),i,j,k,h,m),2),size(l));361 l[size(l)+1] = list(graph42(list(2,1,1,1),i,j,k,h,m),4); 362 l[size(l)+1] = list(graph42(list(1,2,1,1),i,j,k,h,m),4); 363 l[size(l)+1] = list(graph42(list(1,1,2,1),i,j,k,h,m),2); 359 364 } 360 365 if (j <> h and j <> m) 361 366 { 362 l = insert(l,list(graph43(list(2,1,1,1),i,j,k,h,m),12),size(l));367 l[size(l)+1] = list(graph43(list(2,1,1,1),i,j,k,h,m),12); 363 368 } 364 369 for (n=0;n<=r;n++) … … 366 371 if (k <> h and h <> m and m <> n) 367 372 { 368 l = insert(l,list(graph51(list(1,1,1,1,1),i,j,k,h,m,n),2),size(l));373 l[size(l)+1] = list(graph51(list(1,1,1,1,1),i,j,k,h,m,n),2); 369 374 } 370 375 if (k <> h and h <> m and h <> n) 371 376 { 372 l = insert(l,list(graph52(list(1,1,1,1,1),i,j,k,h,m,n),2),size(l));377 l[size(l)+1] = list(graph52(list(1,1,1,1,1),i,j,k,h,m,n),2); 373 378 } 374 379 if (k <> h and k <> m and k <> n) 375 380 { 376 l = insert(l,list(graph53(list(1,1,1,1,1),i,j,k,h,m,n),6),size(l));381 l[size(l)+1] = list(graph53(list(1,1,1,1,1),i,j,k,h,m,n),6); 377 382 } 378 383 if (j <> h and h <> m and h <> n) 379 384 { 380 l = insert(l,list(graph54(list(1,1,1,1,1),i,j,k,h,m,n),8),size(l));385 l[size(l)+1] = list(graph54(list(1,1,1,1,1),i,j,k,h,m,n),8); 381 386 } 382 387 if (k <> h and k <> m and h <> n) 383 388 { 384 l = insert(l,list(graph55(list(1,1,1,1,1),i,j,k,h,m,n),2),size(l));389 l[size(l)+1] = list(graph55(list(1,1,1,1,1),i,j,k,h,m,n),2); 385 390 } 386 391 if (j <> h and j <> m and j <> n) 387 392 { 388 l = insert(l,list(graph56(list(1,1,1,1,1),i,j,k,h,m,n),120),size(l));393 l[size(l)+1] = list(graph56(list(1,1,1,1,1),i,j,k,h,m,n),120); 389 394 } 390 395 } … … 406 411 if (i <> j and j <> k) 407 412 { 408 l = insert(l,list(graph2(list(5,1),i,j,k),5),size(l));409 l = insert(l,list(graph2(list(4,2),i,j,k),8),size(l));410 l = insert(l,list(graph2(list(3,3),i,j,k),18),size(l));413 l[size(l)+1] = list(graph2(list(5,1),i,j,k),5); 414 l[size(l)+1] = list(graph2(list(4,2),i,j,k),8); 415 l[size(l)+1] = list(graph2(list(3,3),i,j,k),18); 411 416 for (h=0;h<=r;h++) 412 417 { 413 418 if (k <> h) 414 419 { 415 l = insert(l,list(graph31(list(4,1,1),i,j,k,h),4),size(l));416 l = insert(l,list(graph31(list(1,4,1),i,j,k,h),8),size(l));417 l = insert(l,list(graph31(list(3,2,1),i,j,k,h),6),size(l));418 l = insert(l,list(graph31(list(3,1,2),i,j,k,h),6),size(l));419 l = insert(l,list(graph31(list(1,3,2),i,j,k,h),6),size(l));420 l = insert(l,list(graph31(list(2,2,2),i,j,k,h),16),size(l));420 l[size(l)+1] = list(graph31(list(4,1,1),i,j,k,h),4); 421 l[size(l)+1] = list(graph31(list(1,4,1),i,j,k,h),8); 422 l[size(l)+1] = list(graph31(list(3,2,1),i,j,k,h),6); 423 l[size(l)+1] = list(graph31(list(3,1,2),i,j,k,h),6); 424 l[size(l)+1] = list(graph31(list(1,3,2),i,j,k,h),6); 425 l[size(l)+1] = list(graph31(list(2,2,2),i,j,k,h),16); 421 426 } 422 427 if (j <> h) 423 428 { 424 l = insert(l,list(graph32(list(4,1,1),i,j,k,h),8),size(l));425 l = insert(l,list(graph32(list(3,2,1),i,j,k,h),6),size(l));426 l = insert(l,list(graph32(list(2,2,2),i,j,k,h),48),size(l));429 l[size(l)+1] = list(graph32(list(4,1,1),i,j,k,h),8); 430 l[size(l)+1] = list(graph32(list(3,2,1),i,j,k,h),6); 431 l[size(l)+1] = list(graph32(list(2,2,2),i,j,k,h),48); 427 432 } 428 433 for (m=0;m<=r;m++) … … 430 435 if (k <> h and h <> m) 431 436 { 432 l = insert(l,list(graph41(list(3,1,1,1),i,j,k,h,m),3),size(l));433 l = insert(l,list(graph41(list(1,3,1,1),i,j,k,h,m),3),size(l));434 l = insert(l,list(graph41(list(2,2,1,1),i,j,k,h,m),4),size(l));435 l = insert(l,list(graph41(list(2,1,2,1),i,j,k,h,m),4),size(l));436 l = insert(l,list(graph41(list(2,1,1,2),i,j,k,h,m),8),size(l));437 l = insert(l,list(graph41(list(1,2,2,1),i,j,k,h,m),8),size(l));437 l[size(l)+1] = list(graph41(list(3,1,1,1),i,j,k,h,m),3); 438 l[size(l)+1] = list(graph41(list(1,3,1,1),i,j,k,h,m),3); 439 l[size(l)+1] = list(graph41(list(2,2,1,1),i,j,k,h,m),4); 440 l[size(l)+1] = list(graph41(list(2,1,2,1),i,j,k,h,m),4); 441 l[size(l)+1] = list(graph41(list(2,1,1,2),i,j,k,h,m),8); 442 l[size(l)+1] = list(graph41(list(1,2,2,1),i,j,k,h,m),8); 438 443 } 439 444 if (k <> h and k <> m) 440 445 { 441 l = insert(l,list(graph42(list(3,1,1,1),i,j,k,h,m),6),size(l));442 l = insert(l,list(graph42(list(1,3,1,1),i,j,k,h,m),6),size(l));443 l = insert(l,list(graph42(list(1,1,3,1),i,j,k,h,m),3),size(l));444 l = insert(l,list(graph42(list(2,2,1,1),i,j,k,h,m),8),size(l));445 l = insert(l,list(graph42(list(1,1,2,2),i,j,k,h,m),8),size(l));446 l = insert(l,list(graph42(list(2,1,2,1),i,j,k,h,m),4),size(l));447 l = insert(l,list(graph42(list(1,2,2,1),i,j,k,h,m),4),size(l));446 l[size(l)+1] = list(graph42(list(3,1,1,1),i,j,k,h,m),6); 447 l[size(l)+1] = list(graph42(list(1,3,1,1),i,j,k,h,m),6); 448 l[size(l)+1] = list(graph42(list(1,1,3,1),i,j,k,h,m),3); 449 l[size(l)+1] = list(graph42(list(2,2,1,1),i,j,k,h,m),8); 450 l[size(l)+1] = list(graph42(list(1,1,2,2),i,j,k,h,m),8); 451 l[size(l)+1] = list(graph42(list(2,1,2,1),i,j,k,h,m),4); 452 l[size(l)+1] = list(graph42(list(1,2,2,1),i,j,k,h,m),4); 448 453 } 449 454 if (j <> h and j <> m) 450 455 { 451 l = insert(l,list(graph43(list(3,1,1,1),i,j,k,h,m),18),size(l));452 l = insert(l,list(graph43(list(2,2,1,1),i,j,k,h,m),16),size(l));456 l[size(l)+1] = list(graph43(list(3,1,1,1),i,j,k,h,m),18); 457 l[size(l)+1] = list(graph43(list(2,2,1,1),i,j,k,h,m),16); 453 458 } 454 459 for (n=0;n<=r;n++) … … 456 461 if (k <> h and h <> m and m <> n) 457 462 { 458 l = insert(l,list(graph51(list(2,1,1,1,1),i,j,k,h,m,n),2),size(l));459 l = insert(l,list(graph51(list(1,2,1,1,1),i,j,k,h,m,n),2),size(l));460 l = insert(l,list(graph51(list(1,1,2,1,1),i,j,k,h,m,n),4),size(l));463 l[size(l)+1] = list(graph51(list(2,1,1,1,1),i,j,k,h,m,n),2); 464 l[size(l)+1] = list(graph51(list(1,2,1,1,1),i,j,k,h,m,n),2); 465 l[size(l)+1] = list(graph51(list(1,1,2,1,1),i,j,k,h,m,n),4); 461 466 } 462 467 if (k <> h and h <> m and h <> n) 463 468 { 464 l = insert(l,list(graph52(list(2,1,1,1,1),i,j,k,h,m,n),4),size(l));465 l = insert(l,list(graph52(list(1,2,1,1,1),i,j,k,h,m,n),4),size(l));466 l = insert(l,list(graph52(list(1,1,2,1,1),i,j,k,h,m,n),4),size(l));467 l = insert(l,list(graph52(list(1,1,1,2,1),i,j,k,h,m,n),2),size(l));469 l[size(l)+1] = list(graph52(list(2,1,1,1,1),i,j,k,h,m,n),4); 470 l[size(l)+1] = list(graph52(list(1,2,1,1,1),i,j,k,h,m,n),4); 471 l[size(l)+1] = list(graph52(list(1,1,2,1,1),i,j,k,h,m,n),4); 472 l[size(l)+1] = list(graph52(list(1,1,1,2,1),i,j,k,h,m,n),2); 468 473 } 469 474 if (k <> h and k <> m and k <> n) 470 475 { 471 l = insert(l,list(graph53(list(2,1,1,1,1),i,j,k,h,m,n),12),size(l));472 l = insert(l,list(graph53(list(1,2,1,1,1),i,j,k,h,m,n),12),size(l));473 l = insert(l,list(graph53(list(1,1,2,1,1),i,j,k,h,m,n),4),size(l));476 l[size(l)+1] = list(graph53(list(2,1,1,1,1),i,j,k,h,m,n),12); 477 l[size(l)+1] = list(graph53(list(1,2,1,1,1),i,j,k,h,m,n),12); 478 l[size(l)+1] = list(graph53(list(1,1,2,1,1),i,j,k,h,m,n),4); 474 479 } 475 480 if (j <> h and h <> m and h <> n) 476 481 { 477 l = insert(l,list(graph54(list(2,1,1,1,1),i,j,k,h,m,n),4),size(l));478 l = insert(l,list(graph54(list(1,1,2,1,1),i,j,k,h,m,n),16),size(l));482 l[size(l)+1] = list(graph54(list(2,1,1,1,1),i,j,k,h,m,n),4); 483 l[size(l)+1] = list(graph54(list(1,1,2,1,1),i,j,k,h,m,n),16); 479 484 } 480 485 if (k <> h and k <> m and h <> n) 481 486 { 482 l = insert(l,list(graph55(list(2,1,1,1,1),i,j,k,h,m,n),2),size(l));483 l = insert(l,list(graph55(list(1,2,1,1,1),i,j,k,h,m,n),2),size(l));484 l = insert(l,list(graph55(list(1,1,1,2,1),i,j,k,h,m,n),4),size(l));487 l[size(l)+1] = list(graph55(list(2,1,1,1,1),i,j,k,h,m,n),2); 488 l[size(l)+1] = list(graph55(list(1,2,1,1,1),i,j,k,h,m,n),2); 489 l[size(l)+1] = list(graph55(list(1,1,1,2,1),i,j,k,h,m,n),4); 485 490 } 486 491 if (j <> h and j <> m and j <> n) 487 492 { 488 l = insert(l,list(graph56(list(2,1,1,1,1),i,j,k,h,m,n),48),size(l));493 l[size(l)+1] = list(graph56(list(2,1,1,1,1),i,j,k,h,m,n),48); 489 494 } 490 495 for (p=0;p<=r;p++) … … 492 497 if (k <> h and h <> m and m <> n and n <> p) 493 498 { 494 l = insert(l,list(graph61(list(1,1,1,1,1,1),i,j,k,h,m,n,p),2),size(l));499 l[size(l)+1] = list(graph61(list(1,1,1,1,1,1),i,j,k,h,m,n,p),2); 495 500 } 496 501 if (k <> h and h <> m and m <> n and m <> p) 497 502 { 498 l = insert(l,list(graph62(list(1,1,1,1,1,1),i,j,k,h,m,n,p),2),size(l));503 l[size(l)+1] = list(graph62(list(1,1,1,1,1,1),i,j,k,h,m,n,p),2); 499 504 } 500 505 if (k <> h and h <> m and h <> n and n <> p) 501 506 { 502 l = insert(l,list(graph63(list(1,1,1,1,1,1),i,j,k,h,m,n,p),1),size(l));507 l[size(l)+1] = list(graph63(list(1,1,1,1,1,1),i,j,k,h,m,n,p),1); 503 508 } 504 509 if (k <> h and h <> m and h <> n and h <> p) 505 510 { 506 l = insert(l,list(graph64(list(1,1,1,1,1,1),i,j,k,h,m,n,p),6),size(l));511 l[size(l)+1] = list(graph64(list(1,1,1,1,1,1),i,j,k,h,m,n,p),6); 507 512 } 508 513 if (k <> h and k <> m and k <> n and n <> p) 509 514 { 510 l = insert(l,list(graph65(list(1,1,1,1,1,1),i,j,k,h,m,n,p),4),size(l));515 l[size(l)+1] = list(graph65(list(1,1,1,1,1,1),i,j,k,h,m,n,p),4); 511 516 } 512 517 if (k <> h and k <> m and m <> p and h <> n) 513 518 { 514 l = insert(l,list(graph66(list(1,1,1,1,1,1),i,j,k,h,m,n,p),6),size(l));519 l[size(l)+1] = list(graph66(list(1,1,1,1,1,1),i,j,k,h,m,n,p),6); 515 520 } 516 521 if (j <> h and h <> m and m <> n and m <> p) 517 522 { 518 l = insert(l,list(graph67(list(1,1,1,1,1,1),i,j,k,h,m,n,p),8),size(l));523 l[size(l)+1] = list(graph67(list(1,1,1,1,1,1),i,j,k,h,m,n,p),8); 519 524 } 520 525 if (j <> h and h <> m and h <> n and h <> p) 521 526 { 522 l = insert(l,list(graph68(list(1,1,1,1,1,1),i,j,k,h,m,n,p),12),size(l));527 l[size(l)+1] = list(graph68(list(1,1,1,1,1,1),i,j,k,h,m,n,p),12); 523 528 } 524 529 if (j <> h and h <> m and h <> n and n <> p) 525 530 { 526 l = insert(l,list(graph69(list(1,1,1,1,1,1),i,j,k,h,m,n,p),2),size(l));531 l[size(l)+1] = list(graph69(list(1,1,1,1,1,1),i,j,k,h,m,n,p),2); 527 532 } 528 533 if (k <> h and k <> m and k <> n and k <> p) 529 534 { 530 l = insert(l,list(graph610(list(1,1,1,1,1,1),i,j,k,h,m,n,p),24),size(l));535 l[size(l)+1] = list(graph610(list(1,1,1,1,1,1),i,j,k,h,m,n,p),24); 531 536 } 532 537 if (j <> h and j <> m and j <> n and j <> p) 533 538 { 534 l = insert(l,list(graph611(list(1,1,1,1,1,1),i,j,k,h,m,n,p),720),size(l));539 l[size(l)+1] = list(graph611(list(1,1,1,1,1,1),i,j,k,h,m,n,p),720); 535 540 } 536 541 } … … 548 553 { 549 554 "EXAMPLE:"; echo=2; 550 ring r = 0, (x),dp;555 ring r = 0,x,dp; 551 556 variety P = projectiveSpace(4); 552 557 stack M = moduliSpace(P,2); … … 573 578 for (i=0;i<=n;i++) 574 579 { 575 l = insert(l,number( 5^i),size(l));580 l = insert(l,number(10^i),size(l)); 576 581 } 577 582 return (l); … … 580 585 { 581 586 "EXAMPLE:"; echo=2; 582 ring r = 0, (x),dp;587 ring r = 0,x,dp; 583 588 variety P = projectiveSpace(4); 584 589 def L = torusList(P); … … 657 662 { 658 663 "EXAMPLE:"; echo=2; 659 ring r = 0, (x),dp;664 ring r = 0,x,dp; 660 665 variety P = projectiveSpace(4); 661 666 stack M = moduliSpace(P,2); … … 691 696 int d = e[j][3]; 692 697 number c = (-1)^d*factorial(d)^2; 693 number y = c*(L[e[j][1]+1]-L[e[j][2]+1])^(2*d)/( d^(2*d));698 number y = c*(L[e[j][1]+1]-L[e[j][2]+1])^(2*d)/(number(d)^(2*d)); 694 699 for (k=0;k<=n;k++) 695 700 { … … 749 754 { 750 755 "EXAMPLE:"; echo=2; 751 ring r = 0, (x),dp;756 ring r = 0,x,dp; 752 757 variety P = projectiveSpace(4); 753 758 stack M = moduliSpace(P,2); … … 788 793 { 789 794 "EXAMPLE:"; echo=2; 790 ring r = 0, (x),dp;795 ring r = 0,x,dp; 791 796 multipleCover(1); 792 797 multipleCover(2); … … 794 799 multipleCover(4); 795 800 multipleCover(5); 801 multipleCover(6); 796 802 } 797 803 … … 812 818 def F = fixedPoints(M); 813 819 int i; 814 polyr = 0;820 number r = 0; 815 821 for (i=1;i<=size(F);i++) 816 822 { … … 826 832 { 827 833 "EXAMPLE:"; echo=2; 828 ring r = 0, (x),dp;834 ring r = 0,x,dp; 829 835 linesHypersurface(2); 830 836 linesHypersurface(3); … … 874 880 { 875 881 "EXAMPLE:"; echo=2; 876 ring r = 0, (x),dp;882 ring r = 0,x,dp; 877 883 rationalCurve(1); 878 884 /* … … 880 886 rationalCurve(3); 881 887 rationalCurve(4); 882 rationalCurve(5);883 888 rationalCurve(1,list(4,2)); 884 889 rationalCurve(1,list(3,3)); … … 897 902 rationalCurve(4,list(3,2,2)); 898 903 rationalCurve(4,list(2,2,2,2)); 899 rationalCurve(5,list(4,2));900 rationalCurve(5,list(3,3));901 rationalCurve(5,list(3,2,2));902 rationalCurve(5,list(2,2,2,2));903 */904 904 } 905 905 … … 921 921 { 922 922 "EXAMPLE:"; echo=2; 923 ring R=(0,x1,x2,x3,x4),(q1,q2,q3,q4,q5,q6),dp;923 ring r = 0,x,dp; 924 924 graph G = makeGraph(list(list(0,1,list(0,1,2)),list(1,1,list(1,0,2))), 925 925 list(list(0,1,2))); … … 943 943 { 944 944 "EXAMPLE:"; echo=2; 945 ring R=(0,x1,x2,x3,x4),(q1,q2,q3,q4,q5,q6),dp;945 ring r = 0,x,dp; 946 946 graph G = makeGraph(list(list(0,1,list(0,1,2)),list(1,1,list(1,0,2))), 947 947 list(list(0,1,2))); … … 1373 1373 list v3 = k,3,f4,f5,f7; 1374 1374 list v4 = h,2,f6,f9; 1375 list v5 = m, 1,f8,f11;1375 list v5 = m,2,f8,f11; 1376 1376 list v6 = n,1,f10; 1377 1377 list v7 = p,1,f12; … … 1516 1516 } 1517 1517 1518 ////////////////////////////////////////////////////////////////////////////////1519 /// Auxilary Static Procedures in this Library /////////////////////////////////1520 ////////////////////////////////////////////////////////////////////////////////1521 1522 1518 proc part(poly f, int n) 1523 1519 "USAGE: part(f,n); f poly, n int … … 1646 1642 { 1647 1643 "EXAMPLE:"; echo=2; 1648 ring r = 0, (x),dp;1644 ring r = 0,x,dp; 1649 1645 poly f = 3+x; 1650 1646 expp(f,3); … … 1718 1714 { 1719 1715 "EXAMPLE:"; echo=2; 1720 ring r = 0, (h,e),wp(1,1);1716 ring r = 0,(h,e),wp(1,1); 1721 1717 ideal rels = he,h2+e2; 1722 1718 variety V = makeVariety(2,rels); … … 1744 1740 { 1745 1741 "EXAMPLE:"; echo=2; 1746 ring r = 0, (h,e),wp(1,1);1742 ring r = 0,(h,e),wp(1,1); 1747 1743 ideal rels = he,h2+e2; 1748 1744 variety V = makeVariety(2,rels); … … 1769 1765 { 1770 1766 "EXAMPLE:"; echo=2; 1771 ring r = 0, (h,e),wp(1,1);1767 ring r = 0,(h,e),wp(1,1); 1772 1768 ideal rels = he,h2+e2; 1773 1769 int d = 2; … … 2086 2082 2087 2083 //////////////////////////////////////////////////////////////////////////////// 2088 ////////// Procedures concerned with sheaves ///////////////////////////////////2084 ////////// Procedures concerned with abstract sheaves /////////////////////////////////// 2089 2085 //////////////////////////////////////////////////////////////////////////////// 2090 2086 -
Singular/cntrlc.cc
r2ea781 r2fa80a 30 30 #include <Singular/cntrlc.h> 31 31 #include <Singular/feOpt.h> 32 #include <Singular/misc_ip.h> 32 33 #include <Singular/si_signals.h> 33 34 #include <Singular/links/silink.h> … … 88 89 } 89 90 91 volatile BOOLEAN do_shutdown = FALSE; 92 volatile int defer_shutdown = 0; 93 90 94 void sig_term_hdl(int /*sig*/) 91 95 { 92 if (ssiToBeClosed_inactive) 93 { 94 ssiToBeClosed_inactive=FALSE; 95 while (ssiToBeClosed!=NULL) 96 { 97 slClose(ssiToBeClosed->l); 98 if (ssiToBeClosed==NULL) break; 99 ssiToBeClosed=(link_list)ssiToBeClosed->next; 100 } 101 exit(1); 102 } 103 //else: we already shutting down: let's do m2_end ist work 96 do_shutdown = TRUE; 97 if (!defer_shutdown) 98 { 99 m2_end(1); 100 } 104 101 } 105 102 -
Singular/cntrlc.h
r2ea781 r2fa80a 19 19 /* TRUE for child of a fork or started with --batch*/ 20 20 21 /* for deferring the call of m2_end() in SIGTERM handler if necessary */ 22 extern volatile BOOLEAN do_shutdown; 23 extern volatile int defer_shutdown; 24 21 25 #endif -
Singular/ipid.cc
rd600e18 r2fa80a 48 48 //omBin ip_package_bin = omGetSpecBin(sizeof(ip_package)); 49 49 omBin idrec_bin = omGetSpecBin(sizeof(idrec)); 50 omBin char_ptr_bin = omGetSpecBin(sizeof(char*));51 50 52 51 coeffs coeffs_BIGINT; -
Singular/links/semaphore.c
r2ea781 r2fa80a 9 9 # include "simpleipc.h" 10 10 11 #include <Singular/cntrlc.h> 11 12 #include <Singular/si_signals.h> 12 13 … … 23 24 // but are supported more widely. 24 25 25 static sem_t *semaphore[SIPC_MAX_SEMAPHORES]; 26 sem_t *semaphore[SIPC_MAX_SEMAPHORES]; 27 int sem_acquired[SIPC_MAX_SEMAPHORES]; 26 28 27 29 /* return 1 on success, … … 74 76 { 75 77 if ((id<0) || (id >= SIPC_MAX_SEMAPHORES) || (semaphore[id]==NULL)) return -1; 78 defer_shutdown++; 76 79 si_sem_wait(semaphore[id]); 80 sem_acquired[id]++; 81 defer_shutdown--; 82 if (!defer_shutdown && do_shutdown) m2_end(1); 77 83 return 1; 78 84 } … … 81 87 { 82 88 if ((id<0) || (id >= SIPC_MAX_SEMAPHORES) || (semaphore[id]==NULL)) return -1; 83 return !si_sem_trywait(semaphore[id]); 89 defer_shutdown++; 90 int trywait = si_sem_trywait(semaphore[id]); 91 if (!trywait) 92 { 93 sem_acquired[id]++; 94 } 95 defer_shutdown--; 96 if (!defer_shutdown && do_shutdown) m2_end(1); 97 return !trywait; 84 98 } 85 99 … … 87 101 { 88 102 if ((id<0) || (id >= SIPC_MAX_SEMAPHORES) || (semaphore[id]==NULL)) return -1; 103 defer_shutdown++; 89 104 sem_post(semaphore[id]); 105 sem_acquired[id]--; 106 defer_shutdown--; 107 if (!defer_shutdown && do_shutdown) m2_end(1); 90 108 return 1; 91 109 } -
Singular/links/simpleipc.h
r2ea781 r2fa80a 1 #include <semaphore.h> 2 1 3 #ifndef _SIMPLEIPC_H 2 4 #define _SIMPLEIPC_H … … 9 11 10 12 #define USE_SEM_INIT 0 13 14 extern sem_t *semaphore[SIPC_MAX_SEMAPHORES]; 15 extern int sem_acquired[SIPC_MAX_SEMAPHORES]; 11 16 12 17 int sipc_semaphore_init(int id, int count); -
Singular/links/ssiLink.cc
r2ea781 r2fa80a 805 805 } 806 806 ssiToBeClosed->next=NULL; 807 #ifdef HAVE_SIMPLEIPC 808 memset(sem_acquired, 0, SIPC_MAX_SEMAPHORES*sizeof(sem_acquired[0])); 809 #endif // HAVE_SIMPLEIPC 807 810 si_close(pc[1]); si_close(cp[0]); 808 811 d->f_write=fdopen(cp[1],"w"); -
Singular/misc_ip.cc
r2ea781 r2fa80a 23 23 #define SI_DONT_HAVE_GLOBAL_VARS 24 24 #include <factory/factory.h> 25 #endif 26 27 #ifdef HAVE_SIMPLEIPC 28 #include <Singular/links/simpleipc.h> 25 29 #endif 26 30 … … 1048 1052 */ 1049 1053 extern "C" { 1054 /* Note: We cannot use a mutex here because mutexes are not async-safe, but 1055 * m2_end is called by sig_term_hdl(). Anyway, the race condition in the first 1056 * few lines of m2_end() should not matter. 1057 */ 1058 volatile BOOLEAN m2_end_called = FALSE; 1050 1059 1051 1060 void m2_end(int i) 1052 1061 { 1053 fe_reset_input_mode(); 1054 #ifdef PAGE_TEST 1055 mmEndStat(); 1056 #endif 1057 fe_reset_input_mode(); 1058 if (ssiToBeClosed_inactive) 1059 { 1060 link_list hh=ssiToBeClosed; 1061 while(hh!=NULL) 1062 { 1063 //Print("close %s\n",hh->l->name); 1064 slPrepClose(hh->l); 1065 hh=(link_list)hh->next; 1066 } 1067 ssiToBeClosed_inactive=FALSE; 1068 1069 idhdl h = currPack->idroot; 1070 while(h != NULL) 1071 { 1072 if(IDTYP(h) == LINK_CMD) 1073 { 1074 idhdl hh=h->next; 1075 //Print("kill %s\n",IDID(h)); 1076 killhdl(h, currPack); 1077 h = hh; 1062 if (!m2_end_called) 1063 { 1064 m2_end_called = TRUE; 1065 #ifdef HAVE_SIMPLEIPC 1066 for (int i = SIPC_MAX_SEMAPHORES; i >= 0; i--) 1067 { 1068 if (semaphore[i] != NULL) 1069 { 1070 while (sem_acquired[i] > 0) 1071 { 1072 sem_post(semaphore[i]); 1073 sem_acquired[i]--; 1074 } 1075 } 1076 } 1077 #endif // HAVE_SIMPLEIPC 1078 fe_reset_input_mode(); 1079 #ifdef PAGE_TEST 1080 mmEndStat(); 1081 #endif 1082 fe_reset_input_mode(); 1083 if (ssiToBeClosed_inactive) 1084 { 1085 link_list hh=ssiToBeClosed; 1086 while(hh!=NULL) 1087 { 1088 //Print("close %s\n",hh->l->name); 1089 slPrepClose(hh->l); 1090 hh=(link_list)hh->next; 1091 } 1092 ssiToBeClosed_inactive=FALSE; 1093 1094 idhdl h = currPack->idroot; 1095 while(h != NULL) 1096 { 1097 if(IDTYP(h) == LINK_CMD) 1098 { 1099 idhdl hh=h->next; 1100 //Print("kill %s\n",IDID(h)); 1101 killhdl(h, currPack); 1102 h = hh; 1103 } 1104 else 1105 { 1106 h = h->next; 1107 } 1108 } 1109 hh=ssiToBeClosed; 1110 while(hh!=NULL) 1111 { 1112 //Print("close %s\n",hh->l->name); 1113 slClose(hh->l); 1114 hh=ssiToBeClosed; 1115 } 1116 } 1117 if (!singular_in_batchmode) 1118 { 1119 if (i<=0) 1120 { 1121 if (TEST_V_QUIET) 1122 { 1123 if (i==0) 1124 printf("Auf Wiedersehen.\n"); 1125 else 1126 printf("\n$Bye.\n"); 1127 } 1128 //#ifdef sun 1129 // #ifndef __svr4__ 1130 // _cleanup(); 1131 // _exit(0); 1132 // #endif 1133 //#endif 1134 i=0; 1078 1135 } 1079 1136 else 1080 1137 { 1081 h = h->next;1082 }1083 }1084 hh=ssiToBeClosed;1085 while(hh!=NULL)1086 {1087 //Print("close %s\n",hh->l->name);1088 slClose(hh->l);1089 hh=ssiToBeClosed;1090 }1091 }1092 if (!singular_in_batchmode)1093 {1094 if (i<=0)1095 {1096 if (TEST_V_QUIET)1097 {1098 if (i==0)1099 printf("Auf Wiedersehen.\n");1100 else1101 printf("\n$Bye.\n");1102 }1103 //#ifdef sun1104 // #ifndef __svr4__1105 // _cleanup();1106 // _exit(0);1107 // #endif1108 //#endif1109 i=0;1110 }1111 else1112 {1113 1138 printf("\nhalt %d\n",i); 1114 } 1115 } 1116 exit(i); 1139 } 1140 } 1141 exit(i); 1142 } 1117 1143 } 1118 1144 }
Note: See TracChangeset
for help on using the changeset viewer.
