Related papers: A procedure for computing the log canonical thresh…
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.
In this note we calculate the multiplier ideal associated to an arbitrary monomial ideal in C^n. We discuss applications to the calculation of log canonical thresholds.
We show that if a divisor centered over a point on a smooth surface computes a minimal log discrepancy, then the divisor also computes a log canonical threshold. To prove the result, we study the asymptotic log canonical threshold of the…
We characterize the ideals $I$ of $\mathcal O_n$ of finite colength whose integral closure is equal to the integral closure of an ideal generated by pure monomials. This characterization, which is motivated by an inequality proven by…
We introduce real log canonical threshold and real jumping numbers for real algebraic functions. A real jumping number is a root of the $b$-function up to a sign if its difference with the minimal one is less than 1. The real log canonical…
We investigate the variation of log canonical thresholds in (graded) linear systems. For toric log Fano varieties, we give a sharp lower bound for log canonical thresholds of the anticanonical members in terms of the global minimal log…
Given two ideals $I$ and $J$ of the ring $\mathcal O_n$ of analytic function germs $f:(\mathbb C^n,0)\to \mathbb C$, we show a sharp lower bound for the log canonical threshold of $IJ$ in terms of the sequences of mixed {\L}ojasiewicz…
We give an explicit formula for the log-canonical threshold of a reduced germ of plane curve. The formula depends only on the first two maximal contact values of the branches and their intersection multiplicities. We also improve the two…
Recent advances have clarified theoretical learning accuracy in Bayesian inference, revealing that the asymptotic behavior of metrics such as generalization loss and free energy, assessing predictive accuracy, is dictated by a rational…
On smooth threefolds, the ACC for minimal log discrepancies is equivalent to the boundedness of the log discrepancy of some divisor which computes the minimal log discrepancy. We reduce it to the case when the boundary is the product of a…
We compute log canonical thresholds of reduced plane curves of degree $d$ at points of multiplicity $d-1$. As a consequence, we describe all possible values of log canonical threshold that are less than $2/(d-1)$ for reduced plane curves of…
In terms of log canonical threshold, we characterize plurisubharmonic functions with logarithmic asymptotical behaviour.
Let I be an arbitrary ideal in C[[x,y]]. We use the Newton algorithm to compute by induction the motivic zeta function of the ideal, yielding only few poles, associated to the faces of the successive Newton polygons. We associate a minimal…
We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…
We use intersection theory, degeneration techniques and jet schemes to study log canonical thresholds. Our first result gives a lower bound for the log canonical threshold of a pair in terms of the log canonical threshold of the image by a…
Evaluation of the marginal likelihood plays an important role in model selection problems. The widely applicable Bayesian information criterion (WBIC) and singular Bayesian information criterion (sBIC) give approximations to the log…
We compute global log canonical thresholds of some smooth Fano threefolds.
In this paper, we show that the log canonical threshold of a potentially klt triple can be computed by a quasi-monomial valuation. The notion of potential triples provides a larger and more flexible framework to work with than that of…
We generalize the formula for the log canonical threshold(LCT) of plane curves over the complex numbers to arbitrary characteristics. Our proof relies purely on valuation theory, instead of on the theory of $D$-modules.
Let $I$ be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of $I$. We provide a simple and efficient algorithm to compute the indispensable…