From the Tamari Lattice to Cambrian Lattices and Beyond

DOI10.1007/978-3-0348-0405-9_15zbMath1292.20044arXiv1109.5105OpenAlexW1733650371WikidataQ57433874 ScholiaQ57433874MaRDI QIDQ4910071

Nathan Reading

Publication date: 25 March 2013

Published in: Associahedra, Tamari Lattices and Related Structures (Search for Journal in Brave)

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

zbMATH Keywords

finite Coxeter groupsweak orderslattice congruencessortable elementsCambrian latticesTamari lattices

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Lattice ideals, congruence relations (06B10)

Related Items

The facial weak order and its lattice quotients ⋮ Celebrating Loday's associahedron ⋮ Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ NONCROSSING SETS AND A GRASSMANN ASSOCIAHEDRON ⋮ The Weak Order on Weyl Posets ⋮ Geometry of $\nu $-Tamari lattices in types $A$ and $B$ ⋮ Extending the Tamari Lattice to Some Compositions of Species ⋮ On the Categories of Modules Over the Tamari Posets ⋮ Unnamed Item ⋮ On flips in planar matchings ⋮ A simplicial complex splitting associativity ⋮ Combinatorial generation via permutation languages. II. Lattice congruences ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ Cambrian combinatorics on quiver representations (type \(\mathbb{A})\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sublattices of associahedra and permutohedra
• Generic rectangulations
• A derived equivalence between cluster equivalent algebras.
• Noncrossing partitions and the shard intersection order
• Lattice congruences, fans and Hopf algebras.
• Permutahedra and generalized associahedra.
• The Hopf algebra of diagonal rectangulations.
• Sortable elements and Cambrian lattices.
• Cambrian fans.
• Cluster algebras of finite type via Coxeter elements and principal minors.
• Fiber polytopes
• Hopf algebra of the planar binary trees
• Cluster algebras. II: Finite type classification
• \(Y\)-systems and generalized associahedra
• Equivariant fiber polytopes
• Order structure on the algebra of permutations and of planar binary trees
• Order dimension, strong Bruhat order and lattice properties for posets
• Noncommutative symmetric functions
• Lattice and order properties of the poset of regions in a hyperplane arrangement
• Cambrian lattices.
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Lattice congruences of the weak order.
• Cluster algebras I: Foundations
• Preprojective algebras and c -sortable words
• Algebraic and combinatorial structures on Baxter permutations
• Sortable elements in infinite Coxeter groups
• h-vectors of generalized associahedra and noncrossing partitions
• Cluster algebras IV: Coefficients
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Noncrossing partitions and representations of quivers
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Congruences in ordered sets
• Iterated fiber polytopes
• Shellable nonpure complexes and posets. II
• Cambrian frameworks for cluster algebras of affine type
• Polytopal Realizations of Generalized Associahedra
• Permutahedra and Associahedra
• Extending the Tamari Lattice to Some Compositions of Species
• The Tamari Lattice as it Arises in Quiver Representations
• A Survey of the Higher Stasheff-Tamari Orders
• Admissible Sequences, Preprojective Representations of Quivers, and Reduced Words in the Weyl Group of a Kac-Moody Algebra
• Non-crossing partition lattices in finite real reflection groups
• Combinatorial Frameworks for Cluster Algebras

This page was built for publication: From the Tamari Lattice to Cambrian Lattices and Beyond