Related papers: Sequentially $S_r$ simplicial complexes and sequen…

We prove that wheels and block graphs have sequentially Cohen-Macaulay binomial edge ideals. Moreover, we provide a construction of new families of sequentially Cohen-Macaulay graphs by cones.

The purpose of this note is to show that a finitely generated graded module $M$ over $S=k[x_1,\ldots,x_n]$, $k$ a field, is sequentially Cohen-Macaulay if and only if its arithmetic degree ${\rm adeg}(M)$ agrees with ${\rm adeg}(F/{\rm…

Let $H$ be a simple undirected graph. The family of all matchings of $H$ forms a simplicial complex called the matching complex of $H$. Here , we give a classification of all graphs with a Gorenstein matching complex. Also we study when the…

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…

We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and…

Ehrenborg, Govindaiah, Park, and Readdy recently introduced the van der Waerden complex, a pure simplicial complex whose facets correspond to arithmetic progressions. Using techniques from combinatorial commutative algebra, we classify when…

A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. While every non-complete graph has at least two moplexes, little is known about structural properties of graphs…

In this note, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if $G$ is an $r$-partite Cohen-Macaulay graph which is covered by some disjoint cliques of…

Recently, G. Floystad studied "higher Cohen-Macaulay property" of certain finite regular cell complexes. In this paper, we partially extend his results to squarefree modules, toric face rings, and simplicial posets. For example, we show…

Let $R$ be a standard graded algebra over a field. We investigate how the singularities of $R$ affect its $h$-vector, which is the coefficients of the numerator of its Hilbert series. The most concrete consequences of our work asserts that…

For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the…

We study monomial ideals using the operation polarization to first turn them into square-free monomial ideals. We focus on monomial ideals whose polarization produce simplicial trees, and show that many of the properties of simplicial trees…

We compute the minimal primary decomposition for completely squarefree lexsegment ideals. We show that critical squarefree monomial ideals are sequentially Cohen-Macaulay. As an application, we give a complete characterization of the…

If a pure simplicial complex is partitionable, then its $h$-vector has a combinatorial interpretation in terms of any partitioning of the complex. Given a non-partitionable complex $\Delta$, we construct a complex $\Gamma \supseteq \Delta$…

Let $R$ be a commutative Noetherian ring. The notion of regular sequences with respect to a Serre class of $R$-modules is introduced and some of their essential properties are given. Then in the local case, we explore a theory of…

Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $J$ be a matroidal ideal of degree $d$ in $R$. In this paper, we study the class of sequentially Cohen-Macaulay matroidal ideals. In particular, all…

In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…

In this article, we characterize Cohen-Macaulay permutation graphs. In particular, we show that a permutation graph is Cohen-Macaulay if and only if it is well-covered and there exists a unique way of partitioning its vertex set into $r$…

A graph $G$ is said to be chordal if it has no induced cycles of length four or more. In a recent preprint Culbertson, Guralnik, and Stiller give a new characterization of chordal graphs in terms of sequences of what they call…

In this paper, we give a new algebraic criterion for the {\em shellability} of (non-pure) simplicial complex $\Delta$ over $[n]$, shellable in the sense of Bj\"orner and Wachs \cite{BW}. We show that the spanning simplicial complex of…