Related papers: A procedure for computing the log canonical thresh…
We study log canonical thresholds on quartic threefolds, quintic fourfolds, and double spaces. As an application, we show that they have a Kaehler-Einstein metric if they are general.
The log canonical thresholds of irreducible quasi-ordinary hypersurface singularities are computed, using an explicit list of pole candidates for the motivic zeta function found by the last two authors.
We show that log canonical thresholds satisfy the ACC
In this paper, we show the log canonical threshold values of the surfaces which has du Val type singularities.These surfaces can be interpreted as statistical or machine learning models. The results of $A_n, D_n, E_6, E_7$ and $E_8$ are…
We study log canonical thresholds (also called global log canonical threshold or $\alpha$-invariant) of $\mathbb{R}$-linear systems. We prove existence of positive lower bounds in different settings, in particular, proving a conjecture of…
Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…
We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…
Let X be a smooth variety and Y a closed subscheme of X. By comparing motivic integrals on X and on a log resolution of (X,Y), we prove the following formula for the log canonical threshold of (X,Y): c(X,Y)=dim X-sup_m{(dim Y_m}/(m+1)},…
To any lattice $L \subset \mathbb{Z}^{m}$ one can associate the lattice ideal $I_{L} \subset K[x_{1},...,x_{m}]$. This paper concerns the study of the relation between the binomial arithmetical rank and the minimal number of generators of…
We compare the minimal model of a log canonical pair with the minimal model of its reduced boundary. These results are then used to study the existence of the minimal model of a semi-log-canonical pair using its normalization.
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
We generalize the work of Jian Song to compute the alpha invariant of any (nef and big) toric line bundle in terms of the associated polytope. We use the analytic version of the computation of the log canonical threshold of monomial ideals…
In this note, we prove a sharp lower bound for the log canonical threshold of a plurisubharmonic function $\varphi$ with an isolated singularity at $0$ in an open subset of ${\mathbb C}^n$. This threshold is defined as the supremum of…
Let $A=\{{\bf a}_1,...,{\bf a}_m\} \subset \mathbb{Z}^n$ be a vector configuration and $I_A \subset K[x_1,...,x_m]$ its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of…
In this work we describe a minimal log-resolution of an ideal in a smooth complex surface from the minimal log-resolution of its generators.
It is known that for a monomial ideal $I$, the number of minimal generators, $\mu(I^n)$, eventually follows a polynomial pattern for increasing $n$. In general, little is known about the power at which this pattern emerges. Even less is…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…
For a fixed pair and fixed exponents, we prove the discreteness of log discrepancies over all log canonical triples formed by attaching a product of ideals with given exponents.
We study the concept of canonical characteristic set of a characterizable differential ideal. We propose an efficient algorithm that transforms any characteristic set into the canonical one. We prove the basic properties of canonical…