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

Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I$ be monomial ideal of $R$. In this paper, we show that if $I$ is a generic monomial ideal, then $R/I$ is pretty clean if and only if $R/I$ is…

Suppose $\Delta$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n-d-1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of facets of $\Delta$ is at least $\binom{n}{c}-2c+1$,…

In this paper, we study simplicial complexes whose Stanley-Reisner rings are almost Gorenstein and have $a$-invariant zero. We call such a simplicial complex an almost Gorenstein* simplicial complex. To study the almost Gorenstein*…

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

We characterize sandwiched singularities in terms of their link in two different settings. We first prove that such singularities are precisely the normal surface singularities having self-similar non-archimedean links. We describe this…

Cohen-Macaulayness of bipartite graphs is investigated by several mathematicians and has been characterized combinatorially. In this note, we give some different combinatorial conditions for a bipartite graph which are equal to…

A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the…

We show that for a vertex decomposable simplicial complex $\Delta$, the Rees algebra of $I_{\Delta^{\vee}}$ is a normal Cohen-Macaulay domain. As consequences, we show that any squarefree weakly polymatroidal ideal is normal and we obtain…

We study the independence complexes of families of well-covered circulant graphs discovered by Boros-Gurvich-Milani\v{c}, Brown-Hoshino, and Moussi. Because these graphs are well-covered, their independence complexes are pure simplicial…

In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item…

We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially Cohen-Macaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes.

A classical result of Cioab\u{a} states that if $G$ is a connected graph with the unit Perron vector $\mathbf{x}$, then any independent set $S$ of $G$ satisfies $\sum_{v\in S} x_v^2 \le \frac{1}{2}$, with equality if and only if $G$ is a…

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 the paper we treat Gale diagrams in a combinatorial way. The interpretation allows to describe simplicial complexes which are Alexander dual to boundaries of simplicial polytopes and, more generally, to nerve-complexes of general…

A certain squarefree monomial ideal $H_P$ arising from a finite partially ordered set $P$ will be studied from viewpoints of both commutative algebra and combinatorics. First, it is proved that the defining ideal of the Rees algebra of…

It is known that non-isomorphic strongly regular graphs with the same parameters must be cospectral (have the same eigenvalues). In this paper, we investigate whether the spectra of higher order Laplacians associated with these graphs can…

The classes of sequentially Cohen-Macaulay and sequentially homotopy Cohen-Macaulay complexes and posets are studied. First, some different versions of the definitions are discussed and the homotopy type is determined. Second, it is shown…

We prove that for each integer $r\geq 2$, there exists a constant $C_r>0$ with the following property: for any $0<\varepsilon \leq 1/2$ and any graph $G$ with clique number at most $r,$ there is a partition of $V(G)$ into at most…

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…

We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is…