Learn More
In this paper we present a bijection between composition matrices and (2 + 2)-free posets. This bijection maps partition matrices to factorial posets, and induces a bijection from upper triangular matrices with non-negative entries having no rows or columns of zeros to unlabeled (2 + 2)-free posets. Chains in a (2 + 2)-free poset are shown to correspond to(More)
We show that an 'almost strong Lefschetz' property holds for the barycentric subdivision of a shellable complex. From this we conclude that for the barycentric subdivision of a Cohen-Macaulay complex, the h-vector is unimodal, peaks in its middle degree (one of them if the dimension of the complex is even), and that its g-vector is an M-sequence. In(More)
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 of the properties, which are known to be true for coloring complexes of graphs, break down in this more general setting,(More)
This paper introduces two matrix analogues for set partitions; partition and composition matrices. These two analogues are the natural result of lifting the mapping between ascent sequences and integer matrices given in Dukes & Parviainen (2010). We prove that partition matrices are in one-to-one correspondence with inversion tables. Non-decreasing(More)
In this paper we study topological properties of the poset of injective words and the lattice of classical non-crossing partitions. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these posets are doubly Cohen-Macaulay. This extends the well-known result that those posets are shellable. Both results rely on a(More)
  • 1