Related papers: Structural decomposition of monomial resolutions

We study algebraic and homological properties of facet ideals of order complexes of posets which we call ideals of maximal flags of posets or simply flag ideals. We characterize the unmixed and Cohen-Macaulay flag ideals of graded posets.…

An explicit construction is given of a minimal free resolution of the ideal generated by all squarefree monomials of a given degree. The construction relies upon and exhibits the natural action of the symmetric group on the syzygy modules.…

We give conjectures on the possible graded Betti numbers of Cohen-Macaulay modules up to multiplication by positive rational numbers. The idea is that the Betti diagrams should be non-negative linear combinations of pure diagrams. The…

Motivated by using combinatorics to study jets of monomial ideals, we extend a definition of jets from graphs to clutters. We offer some structural results on their vertex covers, and show an interesting connection between the cover ideal…

We propose a notion of minimal free resolutions for differential modules, and we prove existence and uniqueness results for such resolutions. We also take the first steps toward studying the structure of minimal free resolutions of…

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a…

Sharply o-minimal structures (denoted \so-minimal) are a strict subclass of the o-minimal structures, aimed at capturing some finer features of structures arising from algebraic geometry and Hodge theory. Sharp o-minimality associates to…

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

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…

In this paper, we use Betti splittings of binomial edge ideals to establish improved upper and lower bounds for their regularity in the case of trees. As a consequence, we determine the exact regularity for certain classes of trees.

We prove an index theorem for the quotient module of a monomial ideal. We obtain this result by resolving the monomial ideal by a sequence of Bergman space like essentially normal Hilbert modules.

In analogy to the skeletons of a simplicial complex and their Stanley--Reisner ideals we introduce the skeletons of an arbitrary monomial ideal $I\subset S=K[x_1,...,x_n]$. This allows us to compute the depth of $S/I$ in terms of its…

The aim of this article is to give a method to construct bimodule resolutions of associative algebras, generalizing Bardzell's well-known resolution of monomial algebras. We stress that this method leads to concrete computations, providing…

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

Let Z be a finite set of double points in P^1 x P^1 and suppose further that X, the support of Z, is arithmetically Cohen-Macaulay (ACM). We present an algorithm, which depends only upon a combinatorial description of X, for the bigraded…

After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…

B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

We develop some basic facts on deformations of exterior differential ideals on a smooth complex algebraic variety. With these tools we study deformations of several types of differential ideals, leading to several irreducible components of…

We generalize the classical de Rham decomposition theorem for Riemannian manifolds to the setting of geodesic metric spaces of finite dimension.