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.
Recommendations
Cites work
- A bijection between permutations and floorplans, and its applications
- Algebraic and combinatorial structures on Baxter permutations
- Baxter permutations rise again
- Bijections for Baxter families and related objects
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generalized permutation patterns and a classification of the Mahonian statistics
- Lattice congruences, fans and Hopf algebras.
- On the number of rectangulations of a planar point set
- On the number of tilings of a square by rectangles
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
- Stack words, standard tableaux and Baxter permutations
- The Hopf algebra of diagonal rectangulations.
- The number of Baxter permutations
Cited in
(19)- Area-universal rectangular layouts
- A note on flips in diagonal rectangulations
- The Hopf algebra of diagonal rectangulations.
- Transformations among rectangular partitions
- Noncrossing arc diagrams and canonical join representations
- Aspect ratio universal rectangular layouts
- On the number of tilings of a square by rectangles
- A transformation algorithm to construct a rectangular floorplan
- Enumeration and asymptotic formulas for rectangular partitions of the hypercube
- On the enumeration of plane bipolar posets and transversal structures
- Baxter posets
- Aspect ratio universal rectangular layouts
- scientific article; zbMATH DE number 7641239 (Why is no real title available?)
- On the number of rectangulations of a planar point set
- Uniqueness of rectangularly dualizable graphs
- From the Tamari lattice to Cambrian lattices and beyond.
- Combinatorial generation via permutation languages. III: Rectangulations
- Combinatorial generation via permutation languages. I: Fundamentals
- Rectangulotopes
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)
