Noncrossing partitions, Bruhat order and the cluster complex
From MaRDI portal
Publication:2326272
DOI10.5802/aif.3294zbMath1421.05011arXiv1801.06078OpenAlexW2783986313MaRDI QIDQ2326272
Matthieu Josuat-Vergès, Philippe Biane
Publication date: 7 October 2019
Published in: Annales de l'Institut Fourier (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.06078
Exact enumeration problems, generating functions (05A15) Reflection and Coxeter groups (group-theoretic aspects) (20F55)
Related Items (5)
Counting chains in the noncrossing partition lattice via the \(W\)-Laplacian ⋮ The generalized cluster complex: refined enumeration of faces and related parking spaces ⋮ Multiplicative and semi-multiplicative functions on non-crossing partitions, and relations to cumulants ⋮ On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions ⋮ A construction which relates $c$-freeness to infinitesimal freeness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit formulae for Kerov polynomials
- The local \(h\)-vector of the cluster subdivision of a simplex
- On some enumerative aspects of generalized associahedra
- Refined enumeration of noncrossing chains and hook formulas
- Some properties of crossings and partitions
- Cluster algebras. II: Finite type classification
- Coxeter-bicatalan combinatorics
- Enumerative properties of generalized associahedra
- \(K(\pi,1)\)'s for Artin groups of finite type.
- ad-nilpotent ideals of a Borel subalgebra: generators and duality
- On the number of full reflections in finite Coxeter groups.
- Subword complexes, cluster complexes, and generalized multi-associahedra
- On the \(H\)-triangle of generalised nonnesting partitions
- \(\eta\)-series and a Boolean Bercovici--Pata bijection for bounded \(k\)-tuples
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Combinatorics of Coxeter Groups
- Sortable elements in infinite Coxeter groups
- The dual braid monoid
- h-vectors of generalized associahedra and noncrossing partitions
- Non-crossing linked partitions, the partial order ≪ on 𝑁𝐶(𝑛), and the 𝑆-transform
- Clusters, Coxeter-sortable elements and noncrossing partitions
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- Generalized associahedra via quiver representations
- Minimal factorizations of a cycle: a multivariate generating function
- Noncrossing Arc Diagrams and Canonical Join Representations
- Non-crossing partition lattices in finite real reflection groups
- On root posets for noncrystallographic root systems
This page was built for publication: Noncrossing partitions, Bruhat order and the cluster complex
