Related papers: Generalized Macaulay representations and the flag …
We show that if a $d$-dimensional Cohen-Macaulay complex is, in a certain sense, sufficiently "close" to being balanced, then there is a $d$-dimensional balanced Cohen-Macaulay complex having the same $f$-vector. This in turn provides some…
We introduce a construction on a flag complex that, by means of modifying the associated graph, generates a new flag complex whose $h$-factor is the face vector of the original complex. This construction yields a vertex-decomposable, hence…
The flag f-vectors of three-colored complexes are characterized. This also characterizes the flag h-vectors of balanced Cohen-Macaulay complexes of dimension two, as well as the flag h-vectors of balanced shellable complexes of dimension…
A relative simplicial complex is a collection of sets of the form $\Delta \setminus \Gamma$, where $\Gamma \subset \Delta$ are simplicial complexes. Relative complexes played key roles in recent advances in algebraic, geometric, and…
For positive integers $d<n$, let $[n]_d=\{A\in 2^{[n]}\mid |A|=d\}$ where $[n]=:\{1,2,\ldots, n\}$. For a pure $f$-simplicial complex $\Delta$ such that ${\rm dim}(\Delta)={\rm dim}(\Delta^c)$ and $\mathcal{F}(\Delta)\cap…
A vertex coloring of a simplicial complex $\Delta$ is called a linear coloring if it satisfies the property that for every pair of facets $(F_1, F_2)$ of $\Delta$, there exists no pair of vertices $(v_1, v_2)$ with the same color such that…
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$,…
Given any finite simplicial complex \Delta, we show how to construct a new simplicial complex \Delta_{\chi} that is balanced and vertex decomposable. Moreover, we show that the h-vector of the simplicial complex \Delta_{\chi} is precisely…
Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We…
We prove several relations on the $f$-vectors and Betti numbers of flag complexes. For every flag complex $\Delta$, we show that there exists a balanced complex with the same $f$-vector as $\Delta$, and whose top-dimensional Betti number is…
Most applications of the hard Lefschetz theorem related to combinatorial properties of simplicial complexes involve their $h$-vectors. In the context of positivity properties involving $h$-vectors of flag spheres, $f$-vectors with a…
One of the most common and effective methods of obtaining structural information on simplicial complexes is to use tools from algebraic geometry/commutative algebra (often motivated by properties of toric varieties). However, there is no…
A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…
In attempting to understand how combinatorial modifications alter algebraic properties of monomial ideals, several authors have investigated the process of adding "whiskers" to graphs. In this paper, we study a similar construction to build…
We show that there are $f$-vectors of balanced simplicial complexes giving a source of simplicial complexes exhibiting a Boolean decomposition similar to a geometric Lefschetz decomposition. The objects we are working with are $h$-vectors…
Starting from an unpublished conjecture of Kalai and from a conjecture of Eisenbud, Green and Harris, we study several problems relating h-vectors of Cohen-Macaulay, flag simplicial complexes and face vectors of simplicial complexes.
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
A numerical characterization is given of the so-called h-triangles of sequentially Cohen-Macaulay simplicial complexes. This result characterizes the number of faces of various dimensions and codimensions in such a complex, generalizing the…
We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…
We prove that the $f$-vector of members in a certain class of meet semi-lattices satisfies Macaulay inequalities. We construct a large family of meet semi-lattices belonging to this class, which includes all posets of multicomplexes, as…