Related papers: Log canonical thresholds of binomial ideals

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

We prove that one can run the log minimal model program for log canonical $3$-fold pairs in characteristic $p>5$. In particular we prove the Cone Theorem, Contraction Theorem, the existence of flips and the existence of log minimal models…

High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers but require efficient generation of non-local, many-body entanglement. We provide a linear-optical architecture with these properties,…

In this paper, we deal with the problem of bisecting binomial coefficients. We find many (previously unknown) infinite classes of integers which admit nontrivial bisections, and a class with only trivial bisections. As a byproduct of this…

There is a proposition due to Koll\'ar 1997 on computing log canonical thresholds of certain hypersurface germs using weighted blowups, which we extend to weighted blowups with non-negative weights. Using this, we show that the log…

We prove the abundance theorem for log canonical $n$-folds such that the boundary divisor is big assuming the abundance conjecture for log canonical $(n-1)$-folds. We also discuss the log minimal model program for log canonical $4$-folds.

All powers of lexsegment ideals with linear resolution (equivalently, with linear quotients) have linear quotients with respect to suitable orders of the minimal monomial generators. For a large subclass of the lexsegment ideals the…

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…

Extending the notion of indispensable binomials of a toric ideal, we define indispensable monomials of a toric ideal and establish some of their properties. They are useful for searching indispensable binomials of a toric ideal and for…

In this paper we characterize two-dimensional semi-log canonical hypersurfaces in arbitrary characteristic from the viewpoint of the initial term of the defining equation. As an application, we prove a conjecture about a uniform bound of…

In this paper, we prove a `cut-by-curves criterion' for an overconvergent isocrystal on a smooth variety over a field of characteristic $p>0$ to extend logarithmically to its smooth compactification whose complement is a strict normal…

We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…

We present a new relation between an invariant of singularities in characteristic zero (the log canonical threshold) and an invariant of singularities defined via the Frobenius morphism in positive characteristic (the F-pure threshold). We…

In this article we prove the following boundedness result: Fix a DCC set $I\subset [0, 1]$. Let $\mathfrak{D}$ be the set of all log pairs $(X, \Delta)$ satisfying the following properties: (i) $X$ is a projective surface defined over an…

We study the class of equimultiple modules. In particular, we prove several criteria for an equimultiple module to be a complete intersection and prove the openness of the equimultiple locus of an ideal module.

In this paper we prove the Zariski-Lipman conjecture for log canonical spaces.

Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…

Graph Isomorphism (GI) is a fundamental algorithmic problem. Amongst graph classes for which the computational complexity of GI has been resolved, trees are arguably the most fundamental. Tree Isomorphism is complete for deterministic…