Noncrossing partitions and the shard intersection order

DOI10.1007/S10801-010-0255-3zbMATH Open1290.05163arXiv0909.3288WikidataQ57435935 ScholiaQ57435935MaRDI QIDQ536561FDOQ536561

Authors: Nathan Reading 

Publication date: 19 May 2011

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

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.

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

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

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)

Cites Work

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

Cited In (41)

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

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)