Generic rectangulations
From MaRDI portal
Publication:412255
DOI10.1016/J.EJC.2011.11.004zbMATH Open1237.05040arXiv1105.3093OpenAlexW2912423795WikidataQ57431934 ScholiaQ57431934MaRDI QIDQ412255FDOQ412255
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to combinatorial equivalence by establishing an explicit bijection between generic rectangulations and a set of permutations defined by a pattern-avoidance condition analogous to the definition of the twisted Baxter permutations.
Full work available at URL: https://arxiv.org/abs/1105.3093
Recommendations
Permutations, words, matrices (05A05) Combinatorial aspects of tessellation and tiling problems (05B45)
Cites Work
- Generalized permutation patterns and a classification of the Mahonian statistics
- Bijections for Baxter families and related objects
- On the number of rectangulations of a planar point set
- The number of Baxter permutations
- Stack words, standard tableaux and Baxter permutations
- Lattice congruences, fans and Hopf algebras.
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
- A bijection between permutations and floorplans, and its applications
- Baxter permutations rise again
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Algebraic and combinatorial structures on Baxter permutations
- On the number of tilings of a square by rectangles
- The Hopf algebra of diagonal rectangulations.
Cited In (18)
- Title not available (Why is that?)
- Combinatorial generation via permutation languages. I. Fundamentals
- On the number of tilings of a square by rectangles
- On the enumeration of plane bipolar posets and transversal structures
- On the number of rectangulations of a planar point set
- The Hopf algebra of diagonal rectangulations.
- Baxter posets
- A transformation algorithm to construct a rectangular floorplan
- Area-universal rectangular layouts
- Aspect ratio universal rectangular layouts
- Aspect ratio universal rectangular layouts
- Transformations among rectangular partitions
- Rectangulotopes
- Combinatorial generation via permutation languages. III: Rectangulations
- Noncrossing Arc Diagrams and Canonical Join Representations
- From the Tamari Lattice to Cambrian Lattices and Beyond
- Enumeration and Asymptotic Formulas for Rectangular Partitions of the Hypercube
- Title not available (Why is that?)
This page was built for publication: Generic rectangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412255)
