Noncrossing partitions and the shard intersection order

DOI10.1007/S10801-010-0255-3MaRDI QIDQ536561zbMATH OpenWikidataFDO

Authors 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 groupnoncrossing partitionweak ordershard

Mathematics Subject Classification ID

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

Abstract: We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new construction of NC(W) yields a new proof that NC(W) is a lattice. The shard intersection order is graded and its rank generating function is the W-Eulerian polynomial. Many order-theoretic properties of the shard intersection order, like Mobius number, number of maximal chains, etc., are exactly analogous to the corresponding properties of NC(W). There is a natural dimension-preserving bijection between simplices in the order complex of the shard intersection order (i.e. chains in the shard intersection order) and simplices in a certain pulling triangulation of the W-permutohedron. Restricting the bijection to the order complex of NC(W) yields a bijection to simplices in a pulling triangulation of the W-associahedron. The shard intersection order is defined indirectly via the polyhedral geometry of the reflecting hyperplanes of W. Indeed, most of the results of the paper are proven in the more general setting of simplicial hyperplane arrangements.

Recommendations

• Noncrossing partitions and the shard intersection order
• Noncrossing partitions and Bruhat order
• Non-crossing partitions
• Noncrossing partitions
• Noncrossing Partitions in Surprising Locations
• On the structure of the lattice of noncrossing partitions
• Noncrossing partitions, Bruhat order and the cluster complex
• Noncrossing partitions, toggles, and homomesies
• Ordered trees and non-crossing partitions
• scientific article; zbMATH DE number 7203434

Cites work

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

Cited in

(40)

• Counting chains in the noncrossing partition lattice via the \(W\)-Laplacian
• Distributive lattices have the intersection property.
• From the lattice of torsion classes to the posets of wide subcategories and ICE-closed subcategories
• Shard Polytopes
• Removahedral congruences versus permutree congruences
• The core label order of a congruence-uniform lattice
• The fundamental theorem of finite semidistributive lattices
• Oriented flip graphs of polygonal subdivisions and noncrossing tree partitions
• Parallelizing pairings on Hessian elliptic curves
• Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group
• Noncrossing arc diagrams and canonical join representations
• Dual garside structures and Coxeter sortable elements
• Lattice homomorphisms between weak orders
• Noncrossing partitions, Bruhat order and the cluster complex
• Noncrossing Partitions for the GroupDn
• Cataland: why the Fuss?
• Semidistrim Lattices
• Meeting covered elements in \(\nu\)-Tamari lattices
• The canonical join complex
• On maximal dihedral reflection subgroups and generalized noncrossing partitions
• Shard polytopes
• A combinatorial approach to scattering diagrams
• Rational noncrossing Coxeter-Catalan combinatorics
• Hochschild lattices and shuffle lattices
• Shellability of noncrossing partition lattices
• Coxeter-bicatalan combinatorics
• Ballot-noncrossing partitions
• From the Tamari lattice to Cambrian lattices and beyond.
• The canonical join complex for biclosed sets
• The canonical join complex for biclosed sets
• On the shard intersection order of a Coxeter group
• Noncrossing partitions and the shard intersection order
• On the lattice property of shard orders
• Stability, shards, and preprojective algebras
• Combinatorics of \((m, n)\)-word lattices
• Generalized non-crossing partitions and buildings
• A categorification of biclosed sets of strings
• Congruence normality of simplicial hyperplane arrangements via oriented matroids
• Bubble lattices. I: Structure
• Meet-distributive lattices have the intersection property

Describes a project that uses

Uses Software

• OEIS

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

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