We compute nonminimal resolution F of the carpet of type (a,b) over a finite prime field, Lift this to a resolution over ZZ, introduce the fine grading, grep the various blocks of the crucial map in the a-th strand, compute their determinants and return their product.
i1 : a=4,b=4 o1 = (4, 4) o1 : Sequence |
i2 : d=carpetDet(a,b) -- 0.028298 seconds elapsed -- 0.072664 seconds elapsed -- 0.000750249 seconds elapsed -- 0.000718291 seconds elapsed -- 0.000741166 seconds elapsed -- 0.000709291 seconds elapsed -- 0.000683958 seconds elapsed -- 0.000756041 seconds elapsed -- 0.000903458 seconds elapsed -- 0.000905624 seconds elapsed -- 0.000803582 seconds elapsed -- 0.000805207 seconds elapsed -- 0.000758124 seconds elapsed -- 0.000747958 seconds elapsed -- 0.000694791 seconds elapsed -- 0.000690083 seconds elapsed -- 0.000730333 seconds elapsed -- 0.000701416 seconds elapsed -- 0.000837791 seconds elapsed -- 0.000779207 seconds elapsed -- 0.000849457 seconds elapsed -- 0.000785332 seconds elapsed -- 0.000754999 seconds elapsed -- 0.000734374 seconds elapsed -- 0.000698708 seconds elapsed -- 0.000712166 seconds elapsed -- 0.000691666 seconds elapsed -- 0.000714707 seconds elapsed (number Of blocks, 26) 1 1 1 1 2 2 2 2 2 2 2 3 2 2 3 2 2 3 2 2 2 2 2 2 2 2 2 2 2 2 3 2 2 3 2 2 3 2 2 2 2 2 1 1 1 1 o2 = 3131031158784 |
i3 : factor d
32 6
o3 = 2 3
o3 : Expression of class Product
|
The object carpetDet is a method function.