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.
Original language | English |
---|---|
Pages (from-to) | 45-61 |
Number of pages | 17 |
Journal | Manuscripta Mathematica |
Volume | 130 |
Issue number | 1 |
DOIs | |
Publication status | Published - Aug 2009 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Mathematics(all)