Log canonical thresholds of binomial ideals
Takafumi Shibuta, Shunsuke Takagi
TL;DR
This paper demonstrates that the log canonical thresholds for a broad class of binomial ideals, including complete intersections and space monomial curves, can be effectively computed using linear programming techniques.
Contribution
It introduces a method to compute log canonical thresholds of binomial ideals via linear programming, expanding computational tools in algebraic geometry.
Findings
Log canonical thresholds of certain binomial ideals are computable by linear programming.
Applicable to complete intersection binomial ideals and space monomial curves.
Provides a new computational approach in algebraic geometry.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Algebraic Geometry and Number Theory · Polynomial and algebraic computation