dc.contributor.author
Cardinal, J.
dc.contributor.author
Pilaud, P.
dc.date.accessioned
2025-01-23T14:07:41Z
dc.date.available
2025-01-23T14:07:41Z
dc.date.issued
2025-03-01
dc.identifier.uri
http://hdl.handle.net/2072/480077
dc.description.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 fin, 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. (c) 2024 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
ca
dc.description.sponsorship
VP was partially supported by the Spanish grant PID2022-137283NB-C21 of MCIN/AEI/10.13039/501100011033/FEDER, UE, by the Severo Ochoa and Maria de Maeztu Program for Centers and Units of Excellence in R&D (CEX2020-001084-M) , by Departament de Recerca i Universitats de la Generalitat de Catalunya (2021 SGR 00697) , by the French grant CHARMS (ANR-19-CE40-0017) , and by the French-Austrian project PAGCAP (ANR-21-CE48-0020 & FWF I 5788) .
ca
dc.format.extent
24 p.
ca
dc.relation.ispartof
European Journal of Combinatorics
ca
dc.rights
Attribution-NonCommercial-NoDerivatives 4.0 International
*
dc.rights.uri
http://creativecommons.org/licenses/by-nc-nd/4.0/
*
dc.subject.other
Combinatronics
ca
dc.title
Rectangulotopes
ca
dc.type
info:eu-repo/semantics/article
ca
dc.description.version
info:eu-repo/semantics/acceptedVersion
ca
dc.identifier.doi
10.1016/j.ejc.2024.104090
ca
dc.rights.accessLevel
info:eu-repo/semantics/openAccess
