3 citations · 4 across the 25 of their papers we have counts for
8 papers · 1 filter
Fibonacci and Catalan Numbers Meet in Staircase Polyominoes
Jean-Luc Baril, José Luis Ramírez, Samuel Ramírez +1
We study Fibonacci (staircase) polyominoes, a class of column-convex polyominoes whose lower boundary is a staircase with unit vertical steps. We derive multivariate generating fun…
Enumeration of Dyck paths with air pockets
Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal +1
We introduce and study the new combinatorial class of Dyck paths with air pockets. We exhibit a bijection with the peakless Motzkin paths which transports several pattern statistic…
Gray codes for Fibonacci q-decreasing words
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
An -length binary word is -decreasing, , if every of its length maximal factor of the form satisfies or .We show constructively that the…
Catalan and Schröder permutations sortable by two restricted stacks
J. -L. Baril, G. Cerbai, C. Khalil +1
Pattern avoiding machines were introduced recently by Claesson, Cerbai and Ferrari as a particular case of the two-stacks in series sorting device. They consist of two restricted s…
Catalan words avoiding pairs of length three patterns
Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki
Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, p…
Popularity of patterns over -equivalence classes of words and permutations
Jean-Luc Baril, Vincent Vajnovszki
Two same length words are -equivalent if they have same descent set and same underlying alphabet. In particular, two same length permutations are -equivalent if they have sam…