Log canonical thresholds of binomial ideals

Simple item page
dc.creatorShibuta, Takafumi
dc.creatorTakagi, Shunsuke
dc.date2008-10-07
dc.date2009-04-09
dc.date.accessioned2026-07-07T13:01:31Z
dc.date.available2026-07-07T13:01:31Z
dc.descriptionWe 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.
dc.description16 pages, 1 figure; v2: expanded explanations, typos corrected; v3: minor changes, to appear in Manuscripta Math
dc.identifierhttps://arxiv.org/abs/0810.1278
dc.identifierhttp://arxiv.org/abs/0810.1278
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226176
dc.subjectAlgebraic Geometry
dc.subjectCommutative Algebra
dc.subjectOptimization and Control
dc.subject13A35, 14B05, 90C05
dc.titleLog canonical thresholds of binomial ideals
dc.typetext

Files

Collections

arXiv