Log canonical thresholds of binomial ideals

Takafumi Shibuta; Shunsuke Takagi

doi:10.1007/s00229-009-0270-7

Log canonical thresholds of binomial ideals

Takafumi Shibuta, Shunsuke Takagi

Research output: Contribution to journal › Article

10 Citations (Scopus)

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.

Original language	English
Pages (from-to)	45-61
Number of pages	17
Journal	Manuscripta Mathematica
Volume	130
Issue number	1
DOIs	https://doi.org/10.1007/s00229-009-0270-7
Publication status	Published - Aug 1 2009

All Science Journal Classification (ASJC) codes

Mathematics(all)

Access to Document

10.1007/s00229-009-0270-7

Fingerprint Dive into the research topics of 'Log canonical thresholds of binomial ideals'. Together they form a unique fingerprint.

Cite this

Shibuta, T., & Takagi, S. (2009). Log canonical thresholds of binomial ideals. Manuscripta Mathematica, 130(1), 45-61. https://doi.org/10.1007/s00229-009-0270-7

@article{6037dea0fcae42e0a50c29cba4d53651,

title = "Log canonical thresholds of binomial ideals",

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.",

author = "Takafumi Shibuta and Shunsuke Takagi",

year = "2009",

month = aug,

day = "1",

doi = "10.1007/s00229-009-0270-7",

language = "English",

volume = "130",

pages = "45--61",

journal = "Manuscripta Mathematica",

issn = "0025-2611",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Log canonical thresholds of binomial ideals

AU - Shibuta, Takafumi

AU - Takagi, Shunsuke

PY - 2009/8/1

Y1 - 2009/8/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=71449093210&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71449093210&partnerID=8YFLogxK

U2 - 10.1007/s00229-009-0270-7

DO - 10.1007/s00229-009-0270-7

M3 - Article

AN - SCOPUS:71449093210

VL - 130

SP - 45

EP - 61

JO - Manuscripta Mathematica

JF - Manuscripta Mathematica

SN - 0025-2611

IS - 1

ER -