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.00951864 seconds elapsed -- 0.0171215 seconds elapsed -- 0.000220733 seconds elapsed -- 0.00016556 seconds elapsed -- 0.000158898 seconds elapsed -- 0.000166401 seconds elapsed -- 0.000161712 seconds elapsed -- 0.000166001 seconds elapsed -- 0.000290833 seconds elapsed -- 0.000278711 seconds elapsed -- 0.00024617 seconds elapsed -- 0.000240129 seconds elapsed -- 0.000155781 seconds elapsed -- 0.000173213 seconds elapsed -- 0.00015486 seconds elapsed -- 0.000184846 seconds elapsed -- 0.000164798 seconds elapsed -- 0.000153918 seconds elapsed -- 0.000184604 seconds elapsed -- 0.00020885 seconds elapsed -- 0.000196719 seconds elapsed -- 0.000200515 seconds elapsed -- 0.000161973 seconds elapsed -- 0.000153036 seconds elapsed -- 0.000151393 seconds elapsed -- 0.000167644 seconds elapsed -- 0.000157345 seconds elapsed -- 0.000161722 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.