English

Rectangulotopes

Combinatorics 2025-06-30 v2 Computational Geometry Discrete Mathematics

Abstract

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of (n1)(n-1)-dimensional polytopes associated with two combinatorial families of rectangulations composed of nn rectangles. They are defined as quotientopes of natural lattice congruences on the weak Bruhat order on permutations in Sn\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.

Keywords

Cite

@article{arxiv.2404.17349,
  title  = {Rectangulotopes},
  author = {Jean Cardinal and Vincent Pilaud},
  journal= {arXiv preprint arXiv:2404.17349},
  year   = {2025}
}

Comments

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