research
∙
09/01/2023
A lattice on Dyck paths close to the Tamari lattice
We introduce a new poset structure on Dyck paths where the covering rela...
share
research
∙
11/10/2022
Polyominoes and graphs built from Fibonacci words
We introduce the k-bonacci polyominoes, a new family of polyominoes asso...
research
∙
11/09/2022
Grand Dyck paths with air pockets
Grand Dyck paths with air pockets (GDAP) are a generalization of Dyck pa...
research
∙
02/23/2022
Dyck paths with catastrophes modulo the positions of a given pattern
For any pattern p of length at most two, we provide generating functions...
research
∙
02/14/2022
Enumeration of Dyck paths with air pockets
We introduce and study the new combinatorial class of Dyck paths with ai...
research
∙
01/03/2022
â„š-bonacci words and numbers
We present a quite curious generalization of multi-step Fibonacci number...
research
∙
10/06/2021
Lattice paths with a first return decomposition constrained by the maximal height of a pattern
We consider the system of equations A_k(x)=p(x)A_k-1(x)(q(x)+∑_i=0^k A_i...
research
∙
10/04/2021
Clique percolation method: memory efficient almost exact communities
Automatic detection of relevant groups of nodes in large real-world grap...
research
∙
06/25/2021
Asymptotic bit frequency in Fibonacci words
It is known that binary words containing no k consecutive 1s are enumera...
research
∙
04/02/2021
Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths
In this note, we present constructive bijections from Dyck and Motzkin m...
research
∙
01/06/2021
Transformation à la Foata for special kinds of descents and excedances
A pure excedance in a permutation π=π_1π_2…π_n is a position i<π_i such ...
research
∙
10/19/2020
Gray codes for Fibonacci q-decreasing words
An n-length binary word is q-decreasing, q≥ 1, if every of its length ma...
research
∙
10/13/2020
Pattern statistics in faro words and permutations
We study the distribution and the popularity of some patterns in words o...
research
∙
03/18/2018
