Log canonical thresholds of binomial ideals

DOI10.1007/s00229-009-0270-7zbMath1183.13007arXiv0810.1278OpenAlexW2159499259MaRDI QIDQ836903

Shunsuke Takagi, Takafumi Shibuta

Publication date: 9 September 2009

Published in: Manuscripta Mathematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.1278

zbMATH Keywords

linear programmingmultiplier idealsmonomial idealslog canonical thresholdsbinomial idealsF-pure thresholds

Mathematics Subject Classification ID

Linear programming (90C05) Singularities in algebraic geometry (14B05) Characteristic (p) methods (Frobenius endomorphism) and reduction to characteristic (p); tight closure (13A35)

Related Items (8)

A procedure for computing the log canonical threshold of a binomial ideal ⋮ A short note on the multiplier ideals of monomial space curves ⋮ -PURITY VERSUS LOG CANONICITY FOR POLYNOMIALS ⋮ F-Thresholds versusa-Invariants for Standard Graded Toric Rings ⋮ $F$-pure thresholds of binomial hypersurfaces ⋮ Multiplier ideals of monomial space curves ⋮ Log canonical thresholds of generic links of generic determinantal varieties ⋮ Diagonal F-thresholds and F-pure Thresholds of Hibi Rings

Cites Work

• Unnamed Item
• Algorithms for computing multiplier ideals
• Discreteness and rationality of \(F\)-thresholds
• On F-pure thresholds
• Binomial ideals
• Resolution of singularities of an algebraic variety over a field of characteristic zero. I
• Multiplier ideals of monomial ideals
• Formulas for multiplier ideals on singular varieties
• Limits of log canonical thresholds
• A generalization of tight closure and multiplier ideals

This page was built for publication: Log canonical thresholds of binomial ideals