binaryFormFPT computes the F-pure threshold of a homogeneous polynomial G in two variables.
i1 : R = ZZ/3[x,y]; |
i2 : G = x^5*y^2-x^3*y^4+x*y^6-y^7; |
The method used requires factoring G into linear forms in some extension of the base field. If the user knows such a factorization beforehand, the alternate call binaryFormFPT(factors,multiplicities) can be used for improved performance.
i3 : R = ZZ/5[x,y]; |
This is based on the work of Daniel Hernandez and Pedro Teixeira.