On maximal chains in the non-crossing partition lattice
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.