Related papers: Cohen-Macaulay graphs and face vectors of flag com…

For every finite graph $\Gamma$, we define a simplicial complex associated to the outer automorphism group of the RAAG $A_\Gamma$. These complexes are defined as coset complexes of parabolic subgroups of $Out^0(A_\Gamma)$ and interpolate…

This note defines a complete h-vector for convex polytopes, which extends the already known toric (or mpih) h-vector and has many similar properties. Complete means that it encodes the whole of the flag vector. First we define the concept…

We compute the coherent cohomology of the structure sheaf of complex periplectic Grassmannians. In particular, we show that it can be decomposed as a tensor product of the singular cohomology ring of a Grassmannian for either the symplectic…

We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.

For a positive integer $k$ and a non-negative integer $t$ a class of simplicial complexes, to be denoted by $k$-${\rm CM}_t$, is introduced. This class generalizes two notions for simplicial complexes: being $k$-Cohen-Macaulay and…

In this article we show that a wide range of multiple structures on curves arise whenever a family of embeddings degenerates to a morphism $\varphi$ of degree $n$. One could expect to see, when an embedding degenerates to such a morphism,…

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…

We give conjectures on the possible graded Betti numbers of Cohen-Macaulay modules up to multiplication by positive rational numbers. The idea is that the Betti diagrams should be non-negative linear combinations of pure diagrams. The…

An \emph{obstacle representation} of a graph consists of a set of polygonal obstacles and a distinct point for each vertex such that two points see each other if and only if the corresponding vertices are adjacent. Obstacle representations…

We generalize the results of Kahn about a correspondence between Cohen-Macaulay modules and vector bundles to non-commutative surface singularities. As an application, we give examples of non-commutative surface singularities which are not…

In this article, we characterize all unmixed and Cohen-Macaulay parity binomial edge ideals of cactus and chordal graphs in terms of the structural properties of the graph.

Binomial edge ideals IG of a graph G were introduced by [4]. They found some classes of graphs G with the property that IG is a Cohen-Macaulay ideal. This might happen only for few classes of graphs. A certain generalization of being…

Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering,…

Let $I(G_{\mathbf{w}})$ be the edge ideal of an edge-weighted graph $(G,\mathbf{w})$. We prove that $I(G_{\mathbf{w}})$ is sequentially Cohen-Macaulay for all weight functions $w$ if and only if $G$ is a Woodroofe graph.

For a simplicial complex $\Delta$, the affect of the expansion functor on combinatorial properties of $\Delta$ and algebraic properties of its Stanley-Reisner ring has been studied in some previous papers. In this paper, we consider the…

Let $G_\omega$ be an edge-weighted graph whose underlying graph is $G$. In this paper, we enlarge the class of Cohen-Macaulay edge-weighted graphs $G_\omega$ by classifying completely them when the graph $G$ has girth $5$ or greater.

We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…

A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…

Let $D$ be a weighted oriented graph, whose underlying graph is $G$, and let $I(D)$ be its edge ideal. If $G$ has no $3$-, $5$-, or $7$-cycles, or $G$ is K\"{o}nig, we characterize when $I(D)$ is unmixed. If $G$ has no $3$- or $5$-cycles,…

A Hadamard-Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise…