Generalized Noncrossing Partitions and Combinatorics of Coxeter Groups
Abstract
This memoir constitutes the author's PhD thesis at Cornell University. It serves both as an expository work and as a description of new research. At the heart of the memoir, we introduce and study a poset NC(k)(W) for each finite Coxeter group W and for each positive integer k. When k=1, our definition coincides with the generalized noncrossing partitions introduced by Brady-Watt and Bessis. When W is the symmetric group, we obtain the poset of classical k-divisible noncrossing partitions, first studied by Edelman. Along the way, we include a comprehensive introduction to related background material. Before defining our generalization NC(k)(W), we develop from scratch the theory of algebraic noncrossing partitions NC(W). This involves studying a finite Coxeter group W with respect to its generating set T of all reflections, instead of the usual Coxeter generating set S. This is the first time that this material has appeared in one place. Finally, it turns out that our poset NC(k)(W) shares many enumerative features in common with the ``generalized nonnesting partitions'' of Athanasiadis and the ``generalized cluster complexes'' of Fomin and Reading. In particular, there is a generalized ``Fuss-Catalan number'', with a nice closed formula in terms of the invariant degrees of W, that plays an important role in each case. We give a basic introduction to these topics, and we describe several conjectures relating these three families of ``Fuss-Catalan objects''.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.