Log canonical thresholds of binomial ideals
Preprint
Abstract
We prove that the log canonical thresholds of a large class of binomial ideals, such as complete intersection binomial ideals and the defining ideals of space monomial curves, are computable by linear programming.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Algorithms for computing multiplier idealsJournal of Pure and Applied Algebra, 2011
- Discreteness and rationality of F-thresholdsThe Michigan Mathematical Journal, 2008
- Formulas for multiplier ideals on singular varietiesAmerican Journal of Mathematics, 2006
- On F-pure thresholdsJournal of Algebra, 2004
- A generalization of tight closure and multiplier idealsTransactions of the American Mathematical Society, 2003
- Multiplier ideals of monomial idealsTransactions of the American Mathematical Society, 2001