Related papers: When are Morse resolutions polyhedral?
We study monomial ideals, always locally given by a monomial, like a reasonable first step to estimate in general the number of monoidal transformations of Villamayor's algorithm of resolution of singularities. The resolution of a monomial…
Given an ascending chain $(I_n)_{n\in\mathbb{N}}$ of $\Sym$-invariant squarefree monomial ideals, we study the corresponding chain of Alexander duals $(I_n^\vee)_{n\in\mathbb{N}}$. Using a novel combinatorial tool, which we call…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in sparse linear systems, database management, computer vision,…
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…
In this paper, we develop the notion of a Morse sequence, which provides an alternative approach to discrete Morse theory, and which is both simple and effective. A Morse sequence on a finite simplicial complex is a sequence composed solely…
We prove a duality theorem for simplicial complexes arising from a combinatorial construction we define, which applies to the squarefree monomial complexes for Veronese ideals of projective spaces and weighted projective spaces. Our theorem…
The Discrete Morse Theory of Forman appeared to be useful for providing filtration-preserving reductions of complexes in the study of persistent homology. So far, the algorithms computing discrete Morse matchings have only been used for…
We study the minimal free resolution of the Veronese modules of the polynomial ring in n variables, by giving a formula for the Betti numbers in terms of the reduced homology of some skeleton of a simplicial complex. We characterize when…
Scattered over the past few years have been several occurrences of simplicial complexes whose topological behavior characterize the Cohen-Macaulay property for quotients of polynomial rings by arbitrary (not necessarily squarefree) monomial…
We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…
In this paper we consider graded ideals in a polynomial ring over a field and ask when such an ideal has the property that all of its powers have a linear resolution. In particular it is shown that all powers of a monomial ideal with…
We investigate resolutions of letterplace ideals of posets. We develop topological results to compute their multigraded Betti numbers, and to give structural results on these Betti numbers. If the poset is a union of no more than $c$…
Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex…
This paper is concerned with the relationship between the discrete and the continuous decreasing minimization problem on base-polyhedra. The continuous version (under the name of lexicographically optimal base of a polymatroid) was solved…
In the context of discrete Morse theory, we introduce Morse frames, which are maps that associate a set of critical simplexes to all simplexes. The main example of Morse frames are the Morse references. In particular, these Morse references…
This paper shows how to construct a discrete Morse function with a relatively small number of critical cells for the order complex of any finite poset with $\hat{0} $ and $\hat{1}$ from any lexicographic order on its maximal chains.…
We express the multigraded Betti numbers of an arbitrary monomial ideal in terms of the multigraded Betti numbers of two basic classes of ideals. This decompo- sition has multiple applications. In some concrete cases, we use it to construct…
This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…
In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…