Generic rectangulations
Provides a combinatorial characterization for enumerating generic rectangulations, a problem in discrete geometry and combinatorics.
The paper establishes an explicit bijection between generic rectangulations and a set of pattern-avoiding permutations, enabling enumeration of generic rectangulations up to combinatorial equivalence.
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.