Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653768 | European Journal of Combinatorics | 2012 | 14 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nathan Reading,