Andrei Asinowski ; Michaela A. Polley - Patterns in rectangulations. Part I: $\top$-like patterns, inversion sequence classes $I(010, 101, 120, 201)$ and $I(011, 201)$, and rushed Dyck paths

dmtcs:15118 - Discrete Mathematics & Theoretical Computer Science, October 16, 2025, vol. 27:1, Permutation Patterns 2024 - https://doi.org/10.46298/dmtcs.15118
Patterns in rectangulations. Part I: $\top$-like patterns, inversion sequence classes $I(010, 101, 120, 201)$ and $I(011, 201)$, and rushed Dyck pathsArticle

Authors: Andrei Asinowski ; Michaela A. Polley

    We initiate a systematic study of pattern avoidance in rectangulations. We give a formal definition of such patterns and investigate rectangulations that avoid $\top$-like patterns - the pattern $\top$ and its rotations. For every $L \subseteq \{\top, \, \vdash, \, \bot, \, \dashv \}$ we enumerate $L$-avoiding rectangulations, both weak and strong. In particular, we show $\top$-avoiding weak rectangulations are enumerated by Catalan numbers and construct bijections to several Catalan structures. Then, we prove that $\top$-avoiding strong rectangulations are in bijection with several classes of inversion sequences, among them $I(010,101,120,201)$ and $I(011,201)$ - which leads to a solution of the conjecture that these classes are Wilf-equivalent. Finally, we show that $\{\top, \bot\}$-avoiding strong rectangulations are in bijection with recently introduced rushed Dyck paths.

    30 pages, 21 figures


    Volume: vol. 27:1, Permutation Patterns 2024
    Section: Special issues
    Published on: October 16, 2025
    Accepted on: September 4, 2025
    Submitted on: January 22, 2025
    Keywords: Combinatorics, 05A05, 05A15, 05A19, 05B45

    Consultation statistics

    This page has been seen 114 times.
    This article's PDF has been downloaded 213 times.