Finite Coxeter groups and the weak order

DOI10.1007/978-3-319-44236-5_10MaRDI QIDQ2974308zbMATH OpenOpenAlexFDO

Authors

Publication date 7 April 2017

Published in Lattice Theory: Special Topics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44236-5_10

Mathematics Subject Classification ID

Total orders (06A05) Ordered groups (06F15) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Recommendations

• The facial weak order in finite Coxeter groups
• Lattice congruences of the weak order.
• Lattices and bases of Coxeter groups
• scientific article; zbMATH DE number 626018
• On the weak order of Coxeter groups

Cited in

(31)

• The order of a finite Coxeter group
• A finite Coxeter group the weak Bruhat order of which is not symmetric chain
• Lattices and bases of Coxeter groups
• On quotients of Coxeter groups under the weak order
• Upper bounds in affine Weyl groups under the weak order
• Cambrian triangulations and their tropical realizations
• Stability of stretched root systems, root posets and shards
• Combinatorial generation via permutation languages. II. Lattice congruences
• The continuous weak order
• Removahedral congruences versus permutree congruences
• Bruhat intervals as rooks on skew Ferrers boards
• Shard polytopes
• Small roots, low elements, and the weak order in Coxeter groups
• The Weak Order on Weyl Posets
• Weak Cayley Table Groups II: Alternating Groups and Finite Coxeter Groups
• Quotients of Coxeter complexes and 𝑃-partitions
• Strong accessibility of Coxeter groups over minimal splittings.
• Lattice structure of Weyl groups via representation theory of preprojective algebras
• Quotientopes
• Pop-stack-sorting for Coxeter groups
• Stack-sorting for Coxeter groups
• A Combinatorial Construction of the Weak Order of a Coxeter Group
• Combinatorial generation via permutation languages. I: Fundamentals
• Lattice theory of torsion classes: Beyond 𝜏-tilting theory
• Celebrating Loday's associahedron
• Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
• \(q\)-Stirling numbers in type \(B\)
• Rectangulotopes
• Coxeter groups
• Skipping ropes: an efficient gray code algorithm for generating wiggly permutations
• Shards for the affine symmetric group

This page was built for publication: Finite Coxeter groups and the weak order

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