A procedure for computing the log canonical threshold of a binomial ideal
From MaRDI portal
Abstract: We present a procedure for computing the log-canonical threshold of an arbitrary ideal generated by binomials and monomials. The computation of the log canonical threshold is reduced to the problem of computing the minimum of a function, which is defined in terms of the generators of the ideal. The minimum of this function is attained at some ray of a fan which only depends on the exponents of the monomials appearing in the generators of the ideal.
Recommendations
Cites work
- scientific article; zbMATH DE number 192947 (Why is no real title available?)
- scientific article; zbMATH DE number 2134815 (Why is no real title available?)
- scientific article; zbMATH DE number 1420930 (Why is no real title available?)
- scientific article; zbMATH DE number 2196314 (Why is no real title available?)
- scientific article; zbMATH DE number 2196318 (Why is no real title available?)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A short course on multiplier ideals
- A short solution to Hironaka's polyhedra game
- A simple algorithm for principalization of monomial ideals
- A simplified proof of desingularization and applications
- Binomial ideals
- Embedded resolutions of non necessarily normal affine toric varieties
- Introduction to Toric Varieties. (AM-131)
- Jumping coefficients of multiplier ideals
- Log canonical thresholds of binomial ideals
- Multiplier ideals and modules on toric varieties
- Multiplier ideals of monomial ideals
- Multiplier ideals of monomial space curves
- The Hironaka theorem on resolution of singularities (Or: A proof we always wanted to understand)
- Toric geometry and the Semple-Nash modification
- Toric varieties
Cited in
(3)
This page was built for publication: A procedure for computing the log canonical threshold of a binomial ideal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1692190)