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 Sn, 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…