The sorting order on a Coxeter group.

DOI10.1016/j.jcta.2009.03.009zbMath1211.20033arXiv0712.1047OpenAlexW2059323226MaRDI QIDQ1040844

Drew Armstrong

Publication date: 26 November 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Coxeter groupsBruhat orderCatalan numberspartial ordersweak ordersorting algorithmssupersolvable latticesantimatroidsjoin-distributive lattices

Mathematics Subject Classification ID

Related Items (19)

Quasiplanar diagrams and slim semimodular lattices ⋮ Depth in classical Coxeter groups ⋮ Optimum basis of finite convex geometry ⋮ On scattered convex geometries ⋮ Convexity in ordered matroids and the generalized external order ⋮ Homomesies on permutations: An analysis of maps and statistics in the FindStat database ⋮ Mask formulas for cograssmannian Kazhdan-Lusztig polynomials. ⋮ Note on the description of join-distributive lattices by permutations ⋮ Interval parking functions ⋮ SB-lattices, distributivity, and Bruhat order on sortable elements. ⋮ Coordinatization of finite join-distributive lattices. ⋮ How many ways can two composition series intersect? ⋮ Sorting orders, subword complexes, Bruhat order and total positivity ⋮ Finite convex geometries of circles ⋮ Descent polynomials for \(k\) bubble-sortable permutations of type B ⋮ Diameter of graphs of reduced words and galleries ⋮ An explicit derivation of the Möbius function for Bruhat order ⋮ Quotient closed subcategories of quiver representations ⋮ Meet-distributive lattices have the intersection property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lattice of closure relations on a poset
• Greedoids
• Sortable elements and Cambrian lattices.
• The theory of convex geometries
• Meet-distributive lattices and the anti-exchange closure
• Axioms and hulls
• Join-semidistributive lattices and convex geometries.
• EL-labelings, supersolvability and 0-Hecke algebra actions on posets
• Supersolvable lattices
• Combinatorics of Coxeter Groups
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Powers of Coxeter elements in infinite groups are reduced
• Generalized noncrossing partitions and combinatorics of Coxeter groups

This page was built for publication: The sorting order on a Coxeter group.