Noncrossing partitions and the shard intersection order

DOI10.1007/S10801-010-0255-3zbMath1290.05163arXiv0909.3288WikidataQ57435935 ScholiaQ57435935MaRDI QIDQ536561

Nathan Reading

Publication date: 19 May 2011

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Coxeter groupweak ordernoncrossing partitionshard

Mathematics Subject Classification ID

Partitions of sets (05A18) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Combinatorial aspects of simplicial complexes (05E45)

Related Items (31)

Counting chains in the noncrossing partition lattice via the \(W\)-Laplacian ⋮ Hochschild lattices and shuffle lattices ⋮ On the lattice property of shard orders ⋮ Lattice homomorphisms between weak orders ⋮ A combinatorial approach to scattering diagrams ⋮ Bubble lattices. I: Structure ⋮ Dual garside structures and Coxeter sortable elements ⋮ From the lattice of torsion classes to the posets of wide subcategories and ICE-closed subcategories ⋮ Semidistrim Lattices ⋮ The core label order of a congruence-uniform lattice ⋮ The canonical join complex ⋮ Removahedral congruences versus permutree congruences ⋮ On maximal dihedral reflection subgroups and generalized noncrossing partitions ⋮ Coxeter-bicatalan combinatorics ⋮ From the Tamari Lattice to Cambrian Lattices and Beyond ⋮ Cataland: Why the Fuss? ⋮ The canonical join complex for biclosed sets ⋮ Oriented flip graphs of polygonal subdivisions and noncrossing tree partitions ⋮ Stability, shards, and preprojective algebras ⋮ Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group ⋮ The canonical join complex for biclosed sets ⋮ A categorification of biclosed sets of strings ⋮ Combinatorics of \((m, n)\)-word lattices ⋮ Rational noncrossing Coxeter-Catalan combinatorics ⋮ The fundamental theorem of finite semidistributive lattices ⋮ Semistable subcategories for tiling algebras ⋮ Ballot-noncrossing partitions ⋮ Meeting covered elements in \(\nu\)-Tamari lattices ⋮ Noncrossing Arc Diagrams and Canonical Join Representations ⋮ Distributive lattices have the intersection property ⋮ Meet-distributive lattices have the intersection property

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice congruences, fans and Hopf algebras.
• Structure of the Malvenuto-Reutenauer Hopf algebra of permutations
• Hyperplane arrangements with a lattice of regions
• Sortable elements and Cambrian lattices.
• Cambrian fans.
• Some properties of crossings and partitions
• Non-crossing partitions for classical reflection groups
• The order dimension of the poset of regions in a hyperplane arrangement.
• \(Y\)-systems and generalized associahedra
• The cd-index of Bruhat intervals.
• Enumerative properties of generalized associahedra
• \(K(\pi,1)\)'s for Artin groups of finite type.
• The distribution of descents and length in a Coxeter group
• Lattice and order properties of the poset of regions in a hyperplane arrangement
• Cambrian lattices.
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Lattice congruences of the weak order.
• Cluster fans, stability conditions, and domains of semi-invariants
• Sortable elements in infinite Coxeter groups
• The dual braid monoid
• Chains in the Noncrossing Partition Lattice
• Cluster complexes via semi-invariants
• h-vectors of generalized associahedra and noncrossing partitions
• Shellability of noncrossing partition lattices
• From permutahedron to associahedron
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Permutohedra, Associahedra, and Beyond
• Noncrossing partitions and representations of quivers
• Congruences in ordered sets
• Lectures on Polytopes
• Noncrossing Partitions for the GroupDn
• A PARTIAL ORDER ON THE ORTHOGONAL GROUP
• Non-crossing partition lattices in finite real reflection groups
• A Combinatorial Construction of the Weak Order of a Coxeter Group

This page was built for publication: Noncrossing partitions and the shard intersection order