Shellability of noncrossing partition lattices

By Christos A. Athanasiadis, Tom D. Brady, Colum Watt. 2005

59 citations recorded by the source corpus.

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 and those of exceptional type and rank at least three.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/9bf6c8ffd8bfec61e0e11fc8b25772c971206a37

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Drew Armstrong
  2. Nathan Reading
  3. Giovanni Paolini
  4. Mario Salvetti

In Discrete Mathematics and Combinatorics

  1. Drew Armstrong
  2. Giovanni Paolini
  3. Mario Salvetti
  4. Nathan Reading
  5. David E. Speyer
  6. Hugh Thomas
  7. Christian Stump
  8. Vincent Pilaud

In Geometry and Topology

  1. Drew Armstrong
  2. Giovanni Paolini
  3. Mario Salvetti
  4. Nathan Reading
  5. David E. Speyer
  6. Hugh Thomas
  7. Vincent Pilaud
  8. Christian Stump

Citations in the corpus