Cataland: why the Fuß? (Q7036573)

This monograph develops a uniform combinatorial framework that connects three key families in Coxeter-Catalan theory: non-crossing partitions, cluster complexes and sortable elements. These families have classical analogues counted by Catalan numbers and Coxeter-theoretic generalizations counted by the so-called Fuß-Catalan numbers. While the first two had known \(m\)-eralizations, a systematic generalization of Coxeter-sortable elements was missing. The authors fill this gap by lifting the theory from finite Coxeter groups to the associated positive Artin monoids.\N\NThe exposition begins with a careful treatment of weak orders and subword complexes and then introduces \(m\)-eralized versions of non-crossing partitions and cluster complexes for arbitrary Coxeter elements, using a new notion of \(c\)-compatibility. A central result is the construction of explicit bijections between the three families in the Fuß-Catalan setting, with proofs relying on a generalization of Cambrian rotation called Cambrian recurrence.\N\NThe authors also define \(m\)-Cambrian lattices for the three families and prove that these are isomorphic as posets, thus extending previous work by \textit{N. Reading} (see, e.g. [Adv. Math. 205, No. 2, 313--353 (2006; Zbl 1106.20033); J. Algebr. Comb. 33, No. 4, 483--530 (2011; Zbl 1290.05163)]) for the case \(m = 1\). These lattices are natural generalizations of Cambrian lattices, organizing \(m\)-eralized sortable elements as subposets of the weak order and encoding refined rotation and compatibility rules. The final chapter discusses applications to the representation theory of hereditary Artin algebras and shows that many of the bijections coincide with known representation-theoretic correspondences in crystallographic types.\N\NThe book consists of nine chapters, whose contents are listed below:\N\NChapter (1) Introduction (brief historical overview, summary of results); \N\NChapter (2) Background on Coxeter and Artin groups (Coxeter and Artin systems, weak order, descents, parabolic subgroups, Garside factorizations, Coxeter elements and sorting words); \N\NChapter (3) Subword complexes (simplicial complexes, root configurations, flips, Coxeter-initial subword complexes);\N\NChapter (4) Non-crossing partitions (classical and \(m\)-eralized versions, Cambrian recurrence, Cambrian posets, enumerations);\N\NChapter (5) Cluster complexes (classical and \(m\)-eralized compatibility, Cambrian recurrence, topology, \(m\)-Tamari lattices); \N\NChapter (6) Sortable elements (classical and \(m\)-eralized sortable elements, Cambrian lattices, shard intersection order);\N \NChapter (7) Positive \(m\)-eralized structures (embeddings, enumeration, symmetries);\N\NChapter (8) Conjectures on rational structures (rational Catalan numbers, \(\infty\)-eralized structures);\N\NChapter (9) \(m\)-eralized structures in representation theory (hereditary Artin algebras, Coxeter-sortable elements and derived categories). \N\NThe style is informal at times but precise and the treatment is largely self-contained. The layout is enhanced by playful marginal sketches and meta-comments that accompany the text throughout, offering humorous asides or visual mnemonics without ever detracting from the mathematical substance.