Related papers: Pruned cellular free resolutions of monomial ideal…
The Taylor resolution is almost never minimal for powers of monomial ideals, even in the square-free case. In this paper we introduce a smaller resolution for each power of any square-free monomial ideal, which depends only on the number of…
For any toric ideal $I$ in a polynomial ring $S$, we provide a combinatorial description of a free resolution of the integral closure of the $S$-module $S/I$. These new complexes arise from an extension of Bayer--Sturmfels' theory of…
It is known that the chain complex of a simplex on $q$ vertices can be used to construct a free resolution of any ideal generated by $q$ monomials, and as a direct result, the Betti numbers always have binomial upper bounds, given by the…
Inspired by the works of Forman on discrete Morse theory, which is a combinatorial adaptation to cell complexes of classical Morse theory on manifolds, we introduce a discrete analogue of the stratified Morse theory of Goresky and…
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…
One can iteratively obtain a free resolution of any monomial ideal $I$ by considering the mapping cone of the map of complexes associated to adding one generator at a time. Herzog and Takayama have shown that this procedure yields a minimal…
Cellular resolutions are a technique for constructing resolutions of monomial ideals by giving a cell complex labeled by monomials, or more generally, by monomial modules. This \verb|Macaulay2| package allows us to work with cellular…
We construct a (shellable) polyhedral cell complex that supports a minimal free resolution of a Borel fixed ideal, which is minimally generated (in the Borel sense) by just one monomial in S=k[x_1,x_2,...,x_n]; this includes the case of…
Forman's Discrete Morse theory is studied from an algebraic viewpoint. Analogous to independent work of Emil Skoeldberg we show that this theory can be extended to chain complexes of free modules over a ring. We provide three applications…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
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…
Given multigraded free resolutions of two monomial ideals we construct a multigraded free resolution of the sum of the two ideals.
Structured pruning is an effective approach for compressing large pre-trained neural networks without significantly affecting their performance. However, most current structured pruning methods do not provide any performance guarantees, and…
1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…
Without any restrictions on the base field, we compute the hull and prove a conjecture of Eisenbud and Sturmfels giving an unmixed decomposition of a cellular binomial ideal. Over an algebraically closed field, we further obtain an explicit…
We define the Buchberger resolution, which is a graded free resolution of a monomial ideal in a polynomial ring. Its construction uses a generalization of the Buchberger graph and encodes much of the combinatorics of the Buchberger…
Given a squarefree monomial ideal $I$ of a polynomial ring $Q$, we show that if the minimal free resolution $\mathbb{F}$ of $Q/I$ admits the structure of a differential graded (dg) algebra, then so does any ``pruning" of $\mathbb{F}$. In…
We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bases or the interpolation method proposed in the first…
Let $Q=k[x_1,..., x_n]$ be a polynomial ring over a field $k$ with the standard $N^n$-grading. Let $\phi$ be a morphism of finite free $N^n$-graded $Q$-modules. We translate to this setting several notions and constructions that appear…
Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on…