Related papers: A procedure for computing the log canonical thresh…

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

For a monomial ideal $I$, let $G(I)$ be its minimal set of monomial generators. If there is a total order on $G(I)$ such that the corresponding Lyubeznik resolution of $I$ is a minimal free resolution of $I$, then $I$ is called a Lyubeznik…

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…

In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…

Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coefficients. In previous papers we parameterized the prime ideals of $K$ in terms of certain invariants attached to Newton polygons of higher…

Let $X$ be a smooth hypersurface of degree $n\geq 3$ in $\mathbb{P}^n$. We prove that the log canonical threshold of $H\in|-K_X|$ is at least $\frac{n-1}{n}$. Under the assumption of the Log minimal model program, we also prove that a…

A canonical minimal free resolution of an arbitrary co-artinian lattice ideal over the polynomial ring is constructed over any field whose characteristic is 0 or any but finitely many positive primes. The differential has a closed-form…

This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…

We present a new algorithm for computing the real radical of an ideal and, more generally, the-radical of, which is based on convex moment optimization. A truncated positive generic linear functional vanishing on the generators of is…

Given a number $q$, we construct a monomial ideal $I$ with the property that the function which describes the number of generators of $I^k$ has at least $q$ local maxima.

This article aims to explore the bridge between the algebraic structure of a linear code and the complete decoding process. To this end, we associate a specific binomial ideal $I_+(\mathcal C)$ to an arbitrary linear code. The binomials…

We update Sunley's explicit estimate for the ideal-counting function, which is the number of integral ideals of bounded norm in a number field.

We show that the number of elements generating a squarefree monomial ideal up to radical can always be bounded above in terms of the number of its minimal monomial generators and the maximal height of its minimal primes.

This paper is devoted to give all the technical constructions and definitions that will lead to the construction of an algorithm of resolution of singularities for binomial ideals. We construct a resolution function that will provide a…

The core of an ideal is defined as the intersection of all of its reductions. In this paper we provide an explicit description for the core of a monomial ideal $I$ satisfying certain residual conditions, showing that ${\rm core}(I)$…

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.

We detail an algorithm that -- for all but a $\frac{1}{\Omega(\log(dH))}$ fraction of $f\in\mathbb{Z}[x]$ with exactly $3$ monomial terms, degree $d$, and all coefficients in $\{-H,\ldots, H\}$ -- produces an approximate root (in the sense…

In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…

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…

Let $I$ be a monomial ideal in a polynomial ring $A=K[x_1,...,x_n]$. We call a monomial ideal $J$ to be a minimal monomial reduction ideal of $I$ if there exists no proper monomial ideal $L \subset J$ such that $L$ is a reduction ideal of…