Related papers: Desingularization of binomial varieties in arbitra…

In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using…

In this paper we characterize, in algebraic and geometric terms, when a graded vanishing ideal is generated by binomials over any field K.

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…

We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

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.

This paper formulates an elementary algorithm for resolution of singularities in a neighborhood of a singular point over a field of characteristic zero. The algorithm is composed of finite sequences of Newton polyhedra and monomial…

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…

We present a classification algorithm for isolated hypersurface singularities of corank 2 and modality 1 over the real numbers. For a singularity given by a polynomial over the rationals, the algorithm determines its right equivalence class…

The article is about a "desingularization principle" common to various canonical desingularization algorithms in characteristic zero, and the roles played by the exceptional divisors in the underlying local construction. We compare…

We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular…

This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…

Relying on the combinatorial classification of toric ideals using their bouquet structure, we focus on toric ideals of hypergraphs and study how they relate to general toric ideals. We show that hypergraphs exhibit a surprisingly general…

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

In characteristic zero, we construct relative principalization of ideals for logarithmically regular morphisms of logarithmic schemes, and use it to construct logarithmically regular desingularization of morphisms. These constructions are…

A theory of simultaneous resolution of singularities for families of embedded varieties (over a field of characteristic zero) parametrized by the spectrum of a suitable artinian ring, and compatible with a given algorithm of resolution, is…

An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…

We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…