14 citations · 43 across the 14 of their papers we have counts for
16 papers
Patterns in rectangulations. Part I: -like patterns, inversion sequence classes and , and rushed Dyck paths
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 -like patterns…
Combinatorics of rectangulations: Old and new bijections
Andrei Asinowski, Jean Cardinal, Stefan Felsner +1
A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a ric…
From geometry to generating functions: rectangulations and permutations
Andrei Asinowski, Cyril Banderier
We enumerate several classes of pattern-avoiding rectangulations. We establish new bijective links with pattern-avoiding permutations, prove that their generating functions are alg…
Down-step statistics in generalized Dyck paths
Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk
The number of down-steps between pairs of up-steps in -Dyck paths, a generalization of Dyck paths consisting of steps such that the path stays (weakly) a…
Flip-sort and combinatorial aspects of pop-stack sorting
Andrei Asinowski, Cyril Banderier, Benjamin Hackl
Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and lea…
Counting triangulations of some classes of subdivided convex polygons
Andrei Asinowski, Christian Krattenthaler, Toufik Mansour
We compute the number of triangulations of a convex -gon each of whose sides is subdivided by points. We find explicit formulas and generating functions, and we determine…