Pattern-avoiding polytopes and Cambrian lattices
From MaRDI portal
Cites work
- Acyclic sets of linear orders via the Bruhat orders
- Cambrian acyclic domains: counting \(c\)-singletons
- Cambrian lattices.
- Clusters, Coxeter-sortable elements and noncrossing partitions
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- On commutation classes of reduced words in Weyl groups
- On the fully commutative elements of Coxeter groups
- Pattern-avoiding polytopes
- Permutahedra and generalized associahedra.
- Sortable elements and Cambrian lattices.
- Two poset polytopes
This page was built for publication: Pattern-avoiding polytopes and Cambrian lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7357062)