Log canonical thresholds of binomial ideals
classification
🧮 math.AG
math.ACmath.OC
keywords
idealsbinomialcanonicalthresholdsclasscompletecomputablecurves
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.