2011
DOI: 10.4310/mrl.2011.v18.n4.a11
|View full text |Cite
|
Sign up to set email alerts
|

Sequences of LCT-Polytopes

Abstract: To r ideals on a germ of smooth variety X one attaches a rational polytope in R r + (the LCT-polytope) that generalizes the notion of log canonical threshold in the case of one ideal. We study these polytopes, and prove a strong form of the Ascending Chain Condition in this setting: we show that if a sequence (P m ) m≥1 of LCT-polytopes in R r + converges to a compact subset Q in the Hausdorff metric, then Q = m≥m0 P m for some m 0 , and Q is an LCT-polytope.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(17 citation statements)
references
References 10 publications
0
17
0
Order By: Relevance
“…Under the above notation, we have the following important result on log canonical thresholds. Log canonical threshold can be generalized to the case of multiple divisors (called testing divisors) and we get LCT-polytopes (see [LM11]).…”
Section: Arithmetic Of Setsmentioning
confidence: 99%
“…Under the above notation, we have the following important result on log canonical thresholds. Log canonical threshold can be generalized to the case of multiple divisors (called testing divisors) and we get LCT-polytopes (see [LM11]).…”
Section: Arithmetic Of Setsmentioning
confidence: 99%
“…, 0). The above result for this case gives a mild generalization of the well-known formula for the region R a a a (λ λ λ 0 ) in the smooth case (see [14] where this region is denoted LCT-polytope). Namely, it is the rational convex polytope determined by the inequalities e 1,j z 1 + • • • + e r,j z r < k j + 1 + e λ λ λ 0 j , corresponding to either rupture or dicritical divisors E j .…”
Section: An Algorithm To Compute Jumping Numbers and Multiplier Idealsmentioning
confidence: 52%
“…Remark When X has a rational singularity at O , we may have a strict inclusion for λ0=false(0,,0false). The above result for this case gives a mild generalization of the well‐known formula for the region scriptRfrakturafalse(λ0false) in the smooth case (see where this region is denoted LCT‐polytope). Namely, it is the rational convex polytope determined by the inequalities e1,jz1++er,jzr<kj+1+ejλ0,corresponding to either rupture or dicritical divisors Ej.…”
Section: An Algorithm To Compute Jumping Numbers and Multiplier Idealsmentioning
confidence: 73%
See 1 more Smart Citation
“…In [18], it is proven that the Ascending Chain Condition holds for LCT-polytopes, that is that all increasing chain of LCT-polytopes is eventually stationary. We give an example to show that it is no more true for the polytopes of quasi-adjunction associated to a φ = 1.…”
Section: Distribution Of Constant and Polytopes Of Quasi-adjunctionmentioning
confidence: 99%