Log canonical thresholds of binomial ideals

Takafumi Shibuta, Shunsuke Takagi

Research output: Contribution to journalArticle

9 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 languageEnglish
Pages (from-to)45-61
Number of pages17
JournalManuscripta Mathematica
Volume130
Issue number1
DOIs
Publication statusPublished - Aug 1 2009

Fingerprint

Log Canonical Threshold
Monomial Curve
Space Curve
Complete Intersection
Linear programming

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Cite this

Log canonical thresholds of binomial ideals. / Shibuta, Takafumi; Takagi, Shunsuke.

In: Manuscripta Mathematica, Vol. 130, No. 1, 01.08.2009, p. 45-61.

Research output: Contribution to journalArticle

Shibuta, Takafumi ; Takagi, Shunsuke. / Log canonical thresholds of binomial ideals. In: Manuscripta Mathematica. 2009 ; Vol. 130, No. 1. pp. 45-61.
@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 = "8",
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 -