Cataland: why the Fuss?

zbMATH Open1440.05034arXiv1503.00710MaRDI QIDQ5111036FDOQ5111036

Author name not available (Why is that?)

Publication date: 26 May 2020

Abstract: The three main objects in noncrossing Catalan combinatorics associated to a finite Coxeter system are noncrossing partitions, clusters, and sortable elements. The first two of these have known Fuss-Catalan generalizations. We provide new viewpoints for both and introduce the missing generalization of sortable elements by lifting the theory from the Coxeter system to the associated positive Artin monoid. We show how this new perspective ties together all three generalizations, providing a uniform framework for noncrossing Fuss-Catalan combinatorics. Having developed the combinatorial theory, we provide an interpretation of our generalizations in the language of the representation theory of hereditary Artin algebras.

Full work available at URL: https://arxiv.org/abs/1503.00710

Recommendations

• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Clusters, Coxeter-sortable elements and noncrossing partitions
• scientific article; zbMATH DE number 6909258
• Enumerative properties of grid associahedra
• The Catalan combinatorics of the hereditary Artin algebras

zbMATH Keywords

Fuss-Catalan numbersassociahedranoncrossing partitionscluster complexesCoxeter-sortable elementssubword complexesCoxeter-Catalan combinatorics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Polyhedra and polytopes; regular figures, division of spaces (51M20) Combinatorial aspects of groups and algebras (05E16)

Cites Work

• Cluster algebras. II: Finite type classification
• Rational associahedra and noncrossing partitions
• Shellable nonpure complexes and posets. II
• Cambrian lattices.
• Artin-Gruppen und Coxeter-Gruppen
• Sortable elements in infinite Coxeter groups
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Sortable elements and Cambrian lattices.
• Chain enumeration and non-crossing partitions
• Non-crossing partitions for classical reflection groups
• Brick polytopes of spherical subword complexes and generalized associahedra
• Subword complexes, cluster complexes, and generalized multi-associahedra
• The dual braid monoid
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Noncrossing partitions and representations of quivers
• From \(m\)-clusters to \(m\)-noncrossing partitions via exceptional sequences
• Title not available (Why is that?)
• Combinatorics of normal sequences of braids
• Noncrossing partitions and the shard intersection order

Cited In (10)

• The generalized cluster complex: refined enumeration of faces and related parking spaces
• Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group
• A Hopf algebra of subword complexes
• \(k\)-indivisible noncrossing partitions
• Counting chains in the noncrossing partition lattice via the \(W\)-Laplacian
• The Hurwitz action in complex reflection groups
• The \(m\)-cover posets and their applications
• Functorially finite hearts, simple-minded systems in negative cluster categories, and noncrossing partitions
• Strange expectations and the Winnie-the-Pooh problem
• The steep-bounce zeta map in parabolic Cataland

This page was built for publication: Cataland: why the Fuss?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111036)