activity
20072022
most citedA Gray Code for cross-bifix-free sets

13 citations · 23 across the 22 of their papers we have counts for

collaborators
Showing cs.DMShow all

11 papers · 1 filter

cs.DM2022★ 1 cited

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…

cs.DM2021

The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three

Phan Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki

We prove the equidistribution of several multistatistics over some classes of permutations avoiding a -length pattern. We deduce the equidistribution, on the one hand of inv and…

cs.DM2020

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…

cs.DM2020

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…

cs.DM2019

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…

cs.DM2019

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…