Whiskers and sequentially Cohen-Macaulay graphs

We investigate how to modify a simple graph G combinatorially to obtain a sequentially Cohen-Macaulay graph. We focus on adding configurations of whiskers to G, where to add a whisker one adds a new vertex and an edge connecting this vertex to an existing vertex of G. We give various sufficient conditions and necessary conditions on a subset S of the vertices of G so that the graph G∪W(S), obtained from G by adding a whisker to each vertex in S, is a sequentially Cohen-Macaulay graph. For instance, we show that if S is a vertex cover of G, then G∪W(S) is a sequentially Cohen-Macaulay graph. On the other hand, we show that if G?S is not sequentially Cohen-Macaulay, then G∪W(S) is not a sequentially Cohen-Macaulay graph. Our work is inspired by and generalizes a result of Villarreal on the use of whiskers to get Cohen-Macaulay graphs.     

Shellable graphs and sequentially Cohen-Macaulay bipartite graphs

Associated to a simple undirected graph G is a simplicial complex ΔG whose faces correspond to the independent sets of G. We call a graph G shellable if ΔG is a shellable simplicial complex in the non-pure sense of Björner-Wachs. We are then interested in determining what families of graphs have the property that G is shellable. We show that all chordal graphs are shellable. Furthermore, we classify all the shellable bipartite graphs; they are precisely the sequentially Cohen-Macaulay bipartite graphs. We also give a recursive procedure to verify if a bipartite graph is shellable. Because shellable implies that the associated Stanley-Reisner ring is sequentially Cohen-Macaulay, our results complement and extend recent work on the problem of determining when the edge ideal of a graph is (sequentially) Cohen-Macaulay. We also give a new proof for a result of Faridi on the sequentially Cohen-Macaulayness of simplicial forests.     

Signable posets and partitionable simplicial complexes

The notion of apartitionable simplicial complex is extended to that of asignable partially ordered set. It is shown in a unified way that face lattices of shellable polytopal complexes, polyhedral cone fans, and oriented matroid polytopes, are all signable. Each of these classes, which are believed to be mutually incomparable, strictly contains the class of convex polytopes. A general sufficient condition, termedtotal signability, for a simplicial complex to satisfy McMullen's Upper Bound Theorem on the numbers of faces, is provided. The simplicial members of each of the three classes above are concluded to be partitionable and to satisfy the upper bound theorem. The computational complexity of face enumeration and of deciding partitionability is discussed. It is shown that under a suitable presentation, the face numbers of a signable simplicial complex can be efficiently computed. In particular, the face numbers of simplicial fans can be computed in polynomial time, extending the analogous statement for convex polytopes. The research of S. Onn was supported by the Alexander von Humboldt Stifnung, by the Fund for the Promotion of Research at the Technion, and by Technion VPR fund 192–198.     

Moment-angle complexes from simplicial posets

We extend the construction of moment-angle complexes to simplicial posets by associating a certain T ^m -space Z _S to an arbitrary simplicial poset S on m vertices. Face rings ℤ[S] of simplicial posets generalise those of simplicial complexes, and give rise to new classes of Gorenstein and Cohen-Macaulay rings. Our primary motivation is to study the face rings ℤ[S] by topological methods. The space Z _S has many important topological properties of the original moment-angle complex Z _K associated to a simplicial complex K. In particular, we prove that the integral cohomology algebra of Z _S is isomorphic to the Tor-algebra of the face ring ℤ[S]. This leads directly to a generalisation of Hochster’s theorem, expressing the algebraic Betti numbers of the ring ℤ[S] in terms of the homology of full subposets in S. Finally, we estimate the total amount of homology of Z _S from below by proving the toral rank conjecture for the moment-angle complexes Z _S .     

On posets with isomorphic interval posets

Let be a partially ordered set, Int the system of all (nonempty) intervals of partially ordered by the set-theoretical inclusion . We are interested in partially ordered sets with Int isomorphic to Int . We are going to show that they correspond to couples of binary relations on A satisfying some conditions. If is a directed partially ordered set, the only with Int isomorphic to Int are corresponding to direct decompositions of ( denotes the dual of . The present results include those presented in the paper [11] by V. Slavík. Systems of intervals, particularly of lattices, have been investigated by many authors, cf. [1]–[11].     

Shellable nonpure complexes and posets. II

This is a direct continuation of Shellable Nonpure Complexes and Posets. I, which appeared in Transactions of the American Mathematical Society 348 (1996), 1299-1327.

     

Face numbers of generalized balanced Cohen-Macaulay complexes

A common generalization of two theorems on the face numbers of Cohen-Macaulay (CM, for short) simplicial complexes is established: the first is the theorem of Stanley (necessity) and Bj?rner-Frankl-Stanley (sufficiency) that characterizes all possible face numbers of a-balanced CM complexes, while the second is the theorem of Novik (necessity) and Browder (sufficiency) that characterizes the face numbers of CM subcomplexes of the join of the boundaries of simplices.     

On multipartite posets

A poset P=(X,) is m-partite if X has a partition X=X₁X_m such that (1) each X_i forms an antichain in P, and (2) xy implies xX_i and yX_j where i<j. In this article we derive a tight asymptotic upper bound on the order dimension of m-partite posets in terms of m and their bipartite sub-posets in a constructive and elementary way.     

On n-normal posets

A poset Q is called n-normal, if its every prime ideal contains at most n minimal prime ideals. In this paper, using the prime ideal theorem for finite ideal distributive posets, some properties and characterizations of n-normal posets are obtained.     

Homomorphism complexes and maximal chains in graded posets

We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special emphasis on finite products of chains. For the special case of a Boolean algebra, we observe that the corresponding homomorphism complex is isomorphic to the subcomplex of cubical cells in a permutahedron. Thus, this work can be interpreted as a generalization of the study of these complexes. We provide a detailed investigation when our poset is a product of chains, in which case we find an optimal discrete Morse matching and prove that the corresponding complex is torsion-free.     

Socles of Buchsbaum modules, complexes and posets

The socle of a graded Buchsbaum module is studied and is related to its local cohomology modules. This algebraic result is then applied to face enumeration of Buchsbaum simplicial complexes and posets. In particular, new necessary conditions on face numbers and Betti numbers of such complexes and posets are established. These conditions are used to settle in the affirmative Kühnel's conjecture for the maximum value of the Euler characteristic of a 2k-dimensional simplicial manifold on n vertices as well as Kalai's conjecture providing a lower bound on the number of edges of a simplicial manifold in terms of its dimension, number of vertices, and the first Betti number.     

Shellability and higher Cohen-Macaulay connectivity of generalized cluster complexes

Let Φ be a finite root system of rank n and let m be a nonnegative integer. The generalized cluster complex Δ^m(Φ) was introduced by S. Fomin and N. Reading. It was conjectured by these authors that Δ^m(Φ) is shellable and by V. Reiner that it is (m + 1)-Cohen-Macaulay, in the sense of Baclawski. These statements are proved in this paper. Analogous statements are shown to hold for the positive part Δ₊^m(Φ) of Δ^m(Φ). An explicit homotopy equivalence is given between Δ₊^m(Φ) and the poset of generalized noncrossing partitions, associated to the pair (Φ, m) by D. Armstrong.     

On posets and independence spaces

By constructing a correspondence relationship between independence spaces and posets, under isomorphism, this paper characterizes loopless independence spaces and applies this characterization to reformulate certain results on independence spaces in poset frameworks. These state that the idea provided in this paper is a new approach for the study of independence spaces. We outline our future work finally.     

On monomial curves and Cohen-Macaulay type

In this paper we characterize the monomial arithmetically Cohen-Macaulay curves in P^d and compute the type of their coordinate ring     

Nested set complexes for posets and the Bier construction

We generalize the concept of combinatorial nested set complexes to posets and exhibit the topological relationship between the arising nested set complexes and the order complex of the underlying poset. In particular, a sufficient condition is given so that this relationship is actually a subdivision.

We use the results to generalize the proof method of Čukić and Delucchi, so far restricted to semilattices, for a result of Björner, Paffenholz, Sjöstrand and Ziegler on the Bier construction on posets.

     

On the complexity of posets

The purpose of this paper is to discuss several invariants each of which provides a measure of the intuitive notion of complexity for a finite partially ordered set. For a poset X the invariants discussed include cardinality, width, length, breadth, dimension, weak dimension, interval dimension and semiorder dimension denoted respectively X, W(X), L(X), B(X), dim(X). Wdim(X), Idim(X) and Sdim(X). Among these invariants the following inequalities hold. $\text{B(}\text{X}\text{)?Idim(}\text{X}\text{)?Sdim(}\text{X}\text{)?Wdim(}\text{X}\text{)?dim(}\text{X}\text{)?W(}\text{X}\text{)}$. We prove that every poset X with three of more points contains a partly with $\text{Idim}\text{(}\text{X}\text{)}\text{Idim}\text{(}\text{X}\text{) {x,v})}$. If M denotes the set of maximal elements and A an arbitrary anticham of X we show that $\text{Idim}\text{(}\text{X}\text{)?W(}\text{X-M}\text{)}$ and $\text{Idim}\text{(}\text{X}\text{)?2W(}\text{X-A}\text{)}$. We also show that there exist functions f(n,t) and (gt) such that $\text{I(}\text{X}\text{)?n}$ and $\text{Idim}\text{(}\text{X}\text{)?t}$simply $\text{dim}\text{(}\text{X}\text{)?f(n,t and Sdim(}\text{X}\text{)?t}$ implies $\text{dim}\text{(}\text{X}\text{)?g(t)}$.