13 citations · 23 across the 22 of their papers we have counts for
13 papers · 1 filter
Grand Dyck paths with air pockets
Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal +1
Grand Dyck paths with air pockets (GDAP) are a generalization of Dyck paths with air pockets by allowing them to go below the -axis. We present enumerative results on GDAP (or t…
Asymptotic bit frequency in Fibonacci words
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
It is known that binary words containing no consecutive 1s are enumerated by -step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random…
Descent distribution on Catalan words avoiding a pattern of length at most three
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We…
Mahonian STAT on rearrangement class of words
Shishuo Fu, Ting Hua, Vincent Vajnovszki
In 2000, Babson and Steingrímsson generalized the notion of permutation patterns to the so-called vincular patterns, and they showed that many Mahonian statistics can be expressed…
On shortening u-cycles and u-words for permutations
Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki
This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deter…
More restricted growth functions: Gray codes and exhaustive generations
Ahmad Sabri, Vincent Vajnovszki
A Gray code for a combinatorial class is a method for listing the objects in the class so that successive objects differ in some prespecified, small way, typically expressed as a b…