Related papers: Log canonical thresholds of binomial ideals
We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…
The log-determinant of a kernel matrix appears in a variety of machine learning problems, ranging from determinantal point processes and generalized Markov random fields, through to the training of Gaussian processes. Exact calculation of…
We show various properties of numerical data of an embedded resolution of singularities for plane curves, which are inspired by a conjecture of Igusa on exponential sums.
We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…
We study the axiomatisability of the iteration-free fragment of Propositional Dynamic Logic with Intersection and Tests. The combination of program composition, intersection and tests makes its proof-theory rather difficult. We develop a…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
We prove a formula of log canonical models for moduli space $\bar{M}_{g,n}$ of pointed stable curves which describes all Hassett's moduli spaces of weighted pointed stable curves in a single equation. This is a generalization of the…
We develop a framework for approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any…
In the nonlinear field of multilinear operators and homogeneous polynomials between Banach spaces, we develop a technique, based on the transformation of vector-valued sequences, to create new examples of hyper-ideals of multilinear…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
We compute the $F$-pure threshold of some non-principal ideals which satisfy a geometric generic condition about their Newton polyhedron. We also contribute some evidence in favor of the conjectured equality between the $F$-pure threshold…
We show that all integrally closed ideals on log terminal surfaces are multiplier ideals by extending an existing proof for smooth surfaces.
This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…
We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.
In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…
We describe the ideals, especially the prime ideals, of semirings of polynomials over layered domains, and in particular over supertropical domains. Since there are so many of them, special attention is paid to the ideals arising from…
Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…
We show that the global log canonical threshold of generic Fano complete intersections of index 1 and codimension $k$ in ${\mathbb P}^{M+k}$ is equal to 1 if $M\geqslant 3k+4$ and the highest degree of defining equations is at least 8. This…