相关论文: Simplicial Trees are Sequentially Cohen-Macaulay

We establish a combinatorial counterpart of the Cohen-Macaulay duality on a class of curve singularities which includes algebroid curves. For such singularities the value semigroup and the value semigroup ideals of all fractional ideals…

Let $\D$ be a $(d-1)$-dimensional pure $f$-simplicial complex over vertex set $[n]$. In this paper, it is proved that $n=2d$ holds true if $\D$ is minimal Cohen-Macaulay. It is also indicated that the recent work of \cite{Dao2020} implies…

In this paper, we introduce the concept of $k$-clean monomial ideals as an extension of clean monomial ideals and present some homological and combinatorial properties of them. Using the hierarchal structure of $k$-clean ideals, we show…

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

We investigate monomial labellings on cell complexes, giving a minimal cellular resolution of the ideal generated by these monomials, and such that the associated quotient ring is Cohen-Macaulay. We introduce a notion of such a labelling…

We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…

A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a…

Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…

In $2011$, Herzog, Hibi, and Ohsugi conjectured that if $J$ is the cover ideal of a chordal graph, then $J^s$ is componentwise linear for all $s \ge 1.$ In 2022, H\`a and Tuyl considered objects more general than chordal graphs and posed…

This paper proves that two differently defined rooted binary trees are isomorphic. The first tree is one associated to a version of Farey sequences where the vertices correspond to the open intervals formed by two successive terms in the…

In the present paper, we aim to classify monomial ideals whose all matching powers are Cohen-Macaulay. We especially focus our attention on edge ideals. The Cohen-Macaulayness of the last matching power of an edge ideal is characterized,…

To every tree we associate a filtered cochain complex. Its cohomology and the corresponding spectral sequence have clear combinatorial description. If a tree is the Dynkin diagram of a simple plane curve singularity, the graded Euler…

A square-free monomial ideal $I$ of $k[x_1,\ldots,x_n]$ is said to be an $f$-ideal if the facet complex and non-face complex associated with $I$ have the same $f$-vector. We show that $I$ is an $f$-ideal if and only if its Newton…

We consider the relationship between the Stanley-Reisner ring (a.k.a. face ring) of a simplicial or boolean complex $\Delta$ and that of its barycentric subdivision. These rings share a distinguished parameter subring. S. Murai asked if…

In this paper, we prove that the open neighborhood ideal of a TD-unmixed tree is geometrically vertex decomposable. This result implies that the associated Stanley-Reisner complex is vertex decomposable. We further demonstrate that…

The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of…

Herzog, Hibi, and Zheng classified the Cohen-Macaulay edge ideals of chordal graphs. In this paper, we classify Cohen-Macaulay edge ideals of (vertex) weighted oriented chordal and simplicial graphs, a more general class of monomial ideals.…

In this paper, we characterize the set of spanning trees of $\mathcal{G}_{n,r}^1$ (a simple connected graph consisting of $n$ edges, containing exactly one $1$-edge-connected chain of $r$ cycles $\mathbb{C}_r^1$ and…

We prove a theorem unifying three results from combinatorial homological and commutative algebra, characterizing the Koszul property for incidence algebras of posets and affine semigroup rings, and characterizing linear resolutions of…

We introduce and investigate the open neighborhood ideal $\mathcal{N}(G)$ of a finite simple graph $G$. We describe the minimal primary decomposition of $\mathcal{N}(G)$ in terms of the minimal total dominating sets (TDSs) of $G$. Then we…