Related papers: Monomial Resolutions Supported By Simplicial Trees
We study a family of monomial ideals, called block diagonal matching field ideals, which arise as monomial Gr\"obner degenerations of determinantal ideals. Our focus is on the minimal free resolutions of these ideals and all of their…
In the previous part of this diptych, we defined the notion of an admissible simplicial connection, as well as explaining how H.I. Green constructed a resolution of coherent analytic sheaves by locally free sheaves on the \v{C}ech nerve.…
We determine a term order on the monomials in the variables $\varx{i}{j}$, $1 \leq i < j \leq n$, such that corresponding initial ideal of the ideal of Pfaffians of degree $r$ of a generic $n$ by $n$ skew-symmetric matrix is the…
We determine in an explicit way the depth of the fiber cone and its relation ideal for classes of monomial ideals in two variables. These classes include concave and convex ideals as well as symmetric ideals.
In this article, we define a class of binomial ideals associated to a simplicial complex. This class of ideals appears in the presentation of fiber cones of codimension 2 lattice ideals \cite{hm}, and in the work of Barile and Morales…
Let $\Bbbk$ be a field and let $I$ be a monomial ideal in the polynomial ring $Q=\Bbbk[x_1,\ldots,x_n]$. In her thesis, Taylor introduced a complex which provides a finite free resolution for $Q/I$ as a $Q$-module. Later, Gemeda constructed…
In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…
In this short note we prove that the projective dimension of a sequentially Cohen-Macaulay square-free monomial ideal is equal to the maximal height of its minimal primes (also known as the big height), or equivalently, the maximal…
We study 2-term tilting complexes of Brauer tree algebras in terms of simplicial complexes. We show the symmetry and convexity of the simplicial complexes as lattice polytopes. Via a geometric interpretation of derived equivalences, we show…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
In this, largely expository, note, we show how the simplicial structure of the moduli spaces of stable rational curves with marked points allows to produce explicit equations for these spaces. The key argument is an elementary combinatorial…
Given multigraded free resolutions of two monomial ideals we construct a multigraded free resolution of the sum of the two ideals.
We study the tropicalization of the variety of symmetric rank two matrices. Analogously to the result of Markwig and Yu for general tropical rank two matrices, we show that it has a simplicial complex structure as the space of symmetric…
We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the…
Using discrete Morse theory, Batzies and Welker introduced Morse resolutions of monomial ideals. In this note, we present the {\it Macaulay2} package {\tt MorseResolutions} for working with two important classes of Morse resolutions:…
In this paper, we give a new and efficient algebraic criterion for the pure as well as non-pure shellability of simplicial complex $\Delta$ over [n]. We also give an algebraic characterization of a leaf in a simplicial complex (defined in…
A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…
Given a simplicial complex we associate to it a squarefree monomial ideal which we call the face ideal of the simplicial complex, and show that it has linear quotients. It turns out that its Alexander dual is a whisker complex. We apply…
We define decision trees for monotone functions on a simplicial complex. We define homology decidability of monotone functions, and show that various monotone functions related to semimatroids are homology decidable. Homology decidability…
We introduce the concept of matching powers of monomial ideals. Let $I$ be a monomial ideal of $S=K[x_1,\dots,x_n]$, with $K$ a field. The $k$th matching power of $I$ is the monomial ideal $I^{[k]}$ generated by the products $u_1\cdots u_k$…