SB-lattices, distributivity, and Bruhat order on sortable elements.

zbMath1323.06004arXiv1407.7507MaRDI QIDQ491532

Henri Mühle

Publication date: 26 August 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Coxeter groupsMöbius functionsdistributive latticesBruhat orderantimatroidscrosscut complexesjoin-distributive latticesSB-labelingssortable elements

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Other generalizations of distributive lattices (06D75)

Related Items

The rank enumeration of certain parabolic non-crossing partitions ⋮ \(SB\)-labelings and posets with each interval homotopy equivalent to a sphere or a ball ⋮ On the homeomorphism and homotopy type of complexes of multichains ⋮ Tamari lattices for parabolic quotients of the symmetric group

Cites Work

• Unnamed Item
• On the topology of the Cambrian semilattices.
• The enumeration of Coxeter elements
• An analogue of distributivity for ungraded lattices
• Sortable elements and Cambrian lattices.
• The sorting order on a Coxeter group.
• Meet-distributive lattices and the anti-exchange closure
• Crosscut-simplicial lattices
• \(SB\)-labelings and posets with each interval homotopy equivalent to a sphere or a ball
• More bijective Catalan combinatorics on permutations and on signed permutations
• Cambrian lattices.
• Lattices of lattice paths
• Combinatorics of Coxeter Groups
• Sortable elements in infinite Coxeter groups
• The dual braid monoid
• Chains in the Noncrossing Partition Lattice
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• The Complete Enumeration of Finite Groups of the Form Ri2=(RiRj)kij=1
• Foulkes characters for complex reflection groups
• An area-to-inv bijection between Dyck paths and 312-avoiding permutations