Separating trees and simple congruences of the weak order

Abstract

A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a combinatorial description of the vertices of the corresponding quotientopes in terms of separating trees. This also yields a combinatorial description of all faces of the corresponding quotientopes. We finally explore algebraic aspects of separating trees, in particular their connections with quiver representation theory.

24 pages, 12 figures; Version 2: minor corrections, published version

References in corpus (16)

• Cluster algebras II: Finite type classification
• Cambrian Lattices
• Cambrian fans
• Lattice congruences, fans and Hopf algebras
• The brick polytope of a sorting network
• Algebraic and combinatorial structures on pairs of twin binary trees
• Brick polytopes of spherical subword complexes and generalized associahedra
• The Hopf algebra of diagonal rectangulations
• Cambrian Hopf Algebras
• Lattice theory of torsion classes: Beyond $\tau$-tilting theory
• Generic rectangulations
• Quotientopes
• Celebrating Loday's Associahedron
• Removahedral congruences versus permutree congruences
• Shard polytopes
• Rectangulotopes