Cataland: why the Fuss?

MaRDI QIDQ5111036zbMATH OpenFDO

Authors

Publication date 26 May 2020

Full work available at URL https://arxiv.org/abs/1503.00710, https://dmtcs.episciences.org/6351

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)

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.

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

Cites work

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

Cited in

(15)

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

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)