Related papers: Log canonical thresholds of binomial ideals

We compute the reverse lexicographic generic initial ideals of the powers of a 2-complete intersection ideal I. In particular, we give six algorithms to compute these generic initial ideals, the choice of which depends on the power and on…

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…

In this paper, we use big Cohen-Macaulay algebras to define a characteristic free analog of the $F$-thresholds, which we call BCM-thresholds, in the case of principal ideals. We prove that, similarly to the case of the $F$-thresholds, the…

We make some observations on binomial edge ideals, with the characterization of their Koszulness as motivation. Inspired by results of Ene, Herzog and Hibi, we discuss building Koszul graphs from smaller pieces in a controlled manner. We…

In this paper we give a necessary and sufficient combinatorial condition for a monomial ideal to have a linear resolution over fields of characteristic 2. We also give a new proof of Fr\"oberg's theorem over fields of characteristic 2.

In this article, we investigate F-pure thresholds of polynomials that are homogeneous under some N-grading, and have an isolated singularity at the origin. We characterize these invariants in terms of the base p expansion of the…

We show that if $f$ is a nonzero, noninvertible function on a smooth complex variety $X$ and $J_f$ is the Jacobian ideal of $f$, then ${\rm lct}(f,J_f^2)>1$ if and only if the hypersurface defined by $f$ has rational singularities.…

In this paper we give an elementary proof of the Zariski-Lipman conjecture for log canonical spaces.

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…

It is proved that the global log canonical threshold of a Zariski general Fano complete intersection of index 1 and codimension $k$ in ${\mathbb P}^{M+k}$ is equal to one, if $M\geqslant 2k+3$ and the maximum of the degrees of defining…

In this paper, we investigate the multiplicities and the log canonical thresholds of abelian quotient complete intersection singularities in term of the special datum. Moreover we give bounds of the multiplicity of abelian quotient complete…

One of the ultimate goals of the Hassett-Keel program is the determination of the log canonical models of the moduli spaces of pointed rational curves $\overline{M}_{0,n}$. In this paper, we study log canonical models of…

Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…

Let V be an infinite-dimensional vector space over a field of characteristic not equal to 2. We classify ideals of the Lie algebra gl(V) of all linear transformations of the space V.

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

Aim of this paper is to count $0$-dimensional stable and strongly stable ideals in $2$ and $3$ variables, given their (constant) affine Hilbert polynomial. To do so, we define the Bar Code, a bidimensional structure representing any finite…

We propose an effective algorithm that decides if a prime ideal in a polynomial ring over the complex numbers can be transformed into a toric ideal by a linear automorphism of the ambient space. If this is the case, the algorithm computes…

We determine the maximal gap between the optimal values of an integer program and its linear programming relaxation, where the matrix and cost function are fixed but the right hand side is unspecified. Our formula involves irreducible…

Let K be a finite field and let X be a subset of a projective space, over the field K, which is parameterized by monomials arising from the edges of a clutter. We show some estimates for the degree-complexity, with respect to the revlex…

We show that the regularity of monomial ideals whose associated prime ideals are totally ordered by inclusion is linearly bounded.