Edgewise Cohen-Macaulay connectivity of partially ordered sets

@article{Athanasiadis2015EdgewiseCC,
  title={Edgewise Cohen-Macaulay connectivity of partially ordered sets},
  author={Christos A. Athanasiadis and Myrto Kallipoliti},
  journal={arXiv: Combinatorics},
  year={2015}
}
The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of the same rank. A corresponding notion of edgewise Cohen--Macaulay connectivity for partially ordered sets is investigated. Examples and open questions are discussed. 

Figures from this paper

References

SHOWING 1-10 OF 30 REFERENCES
A Poset Fiber Theorem for Doubly Cohen-Macaulay Posets and Its Applications
This paper studies topological properties of the lattices of non-crossing partitions of types A and B and of the poset of injective words. Specifically, it is shown that after the removal of the
On geometric semilattices
We define geometric semilattices, a generalization of geometric lattices. The poset of independent sets of a matroid is another example. We prove several axiomatic and constructive characterizations,
On the Cohen-Macaulay connectivity of supersolvable lattices and the homotopy type of posets
  • V. Welker
  • Computer Science, Mathematics
    Eur. J. Comb.
  • 1995
TLDR
It is proved that if L is a supersolvable lattice such that all intervals have non-vanishing Mobius number, then for an arbitrary element x ϵ L the poset L − {x} is also Cohen-Macaulay, and some remarkable results about the homotopy type of posets are derived.
Shellable and Cohen-Macaulay partially ordered sets
In this paper we study shellable posets (partially ordered sets), that is, finite posets such that the simplicial complex of chains is shellable. It is shown that all admissible lattices (including
Let \Delta be a Cohen-Macaulay complex
The concept of Cohen-Macaulay complexes emerged in the mid-1970s and swiftly became the focal point of an attractive and richly connected new area of mathematics, at the crossroads of combinatoics,
g-Elements, finite buildings and higher Cohen-Macaulay connectivity
  • Ed Swartz
  • Computer Science, Mathematics
    J. Comb. Theory, Ser. A
  • 2006
TLDR
It is proved that if Δ is a (d - 1)-dimensional simplicial complex with a convex ear decomposition, then h0 ≤ ... ≤ h⌊d/2⌋, and this leads to connections between higher Cohen-Macaulay connectivity and conditions which insure that h0 < ... < hi for a predetermined i.p.s.
Shellability of noncrossing partition lattices
We give a case-free proof that the lattice of noncrossing partitions associated to any finite real reflection group is EL-shellable. Shellability of these lattices was open for the groups of type D n
Filtered geometric lattices and Lefschetz Section Theorems over the tropical semiring
The purpose of this paper is to establish analogues of the classical Lefschetz Section Theorem for smooth tropical varieties. More precisely, we prove tropical analogues of the section theorems of
A lexicographic shellability characterization of geometric lattices
Geometric lattices are characterized in this paper as those finite, atomic lattices such that every atom ordering induces a lexicographic shelling given by an edge labeling known as a minimal
Cohen-Macaulay quotients of polynomial rings
Let S,, be the polynomial ring k[X, ,..., S,,] over the field k, and let I C S,, be a proper ideal generated by square-free monomials. We characterize the ideals, I, for which &‘,,/I is CohenMacaulay
...
1
2
3
...