On maximal chains in the non-crossing partition lattice
classification
🧮 math.CO
math.GR
keywords
chainslatticemaximalnon-crossingpartitionactionadjacentalgebra
read the original abstract
A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ in exactly one element.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.