
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_k1(x)(q(x)+∑_i=0^k A_i...
read it

Clique percolation method: memory efficient almost exact communities
Automatic detection of relevant groups of nodes in large realworld grap...
read it

Asymptotic bit frequency in Fibonacci words
It is known that binary words containing no k consecutive 1s are enumera...
read it

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...
read it

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 ...
read it

Gray codes for Fibonacci qdecreasing words
An nlength binary word is qdecreasing, q≥ 1, if every of its length ma...
read it

Pattern statistics in faro words and permutations
We study the distribution and the popularity of some patterns in words o...
read it

Descent distribution on Catalan words avoiding a pattern of length at most three
Catalan words are particular growthrestricted words over the set of non...
read it
Sergey Kirgizov
is this you? claim profile