Non-crossing partition lattices in finite real reflection groups
By Tom D. Brady, Colum Watt. 2007
105 citations recorded by the source corpus.
Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/93d3e1e62569ded6950711d4cdd8b26d7ac110ca
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
- David E. Speyer
- Nathan Reading
- Ralf Schiffler
- Kiyoshi Igusa
- David Bessis
- Drew Armstrong
- Hugh Thomas
- B. Keller
In Geometry and Topology
- David E. Speyer
- Nathan Reading
- Ralf Schiffler
- Kiyoshi Igusa
- David Bessis
- Hugh Thomas
- Drew Armstrong
- B. Keller
Citations in the corpus
- Finite complex reection arrangements are K(; 1) (2015, methodology): “The real case is done in [3]; a recent beautiful case-free argument has been found by Brady-Watt [15].”
- Noncrossing partitions and the shard intersection order (2009, unknown): “There is a complete fan AX ( γ ) (see [10, Theorem 8.3]) related to X ( γ ) as the Cambrian fan F c is related to the collection of shards unremoved by Θ c .”
- Finite complex reflection arrangements are $K(\pi,1)$ (2006, unknown): “The real case is done in [3]; a recent beautiful case-free argument has been found by Brady-Watt [15].”
- Exceptional sequences and clusters (2009, background): “We note that these results are known in the finite case [2], [4] and have been extended to the affine case by Ingalls and Thomas [13].”
- Cambrian fans (2006, background): “Athanasiadis, Brady, McCammond and Watt [1] use the construction of [9] to give a bijection between clusters and noncrossing partitions.”