Rectangulotopes

Abstract

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles. They are defined as quotientopes of natural lattice congruences on the weak Bruhat order on permutations in ${\mathfrak{S}}_n$, and their skeleta are flip graphs on rectangulations. We give simple vertex and facet descriptions of these polytopes, in particular elementary formulas for computing the coordinates of the vertex corresponding to each rectangulation, in the spirit of J.-L. Loday's realization of the associahedron.

24 pages, 14 figures. Version 2: revisions according to referee's suggestions

References in corpus (16)

• The diameter of associahedra
• Lattice congruences, fans and Hopf algebras
• Bijections for Baxter Families and Related Objects
• Algebraic and combinatorial structures on pairs of twin binary trees
• The brick polytope of a sorting network
• Brick polytopes of spherical subword complexes and generalized associahedra
• The Hopf algebra of diagonal rectangulations
• Many non-equivalent realizations of the associahedron
• Generic rectangulations
• Quotientopes
• Celebrating Loday's Associahedron
• Removahedral congruences versus permutree congruences
• Shard polytopes
• A Note on Flips in Diagonal Rectangulations
• Combinatorics of rectangulations: Old and new bijections
• From geometry to generating functions: rectangulations and permutations

Cited by in corpus (2)

• Geometric realizations of the $s$-weak order and its lattice quotients
• Separating trees and simple congruences of the weak order