Add to ORKGIn this thesis, we extend the reciprocity method introduced by Jones and Remmel to study the distributions of descents and levels over words which have no u-matches for words u that have at most one descent or at most one level, respectively
A word $w=w_1w_2\cdots w_n$ is alternating if either $w_1<w_2>w_3<w_4>\cdots$ (when the word is up-d...
AbstractWe present an algorithm for finding a system of recurrence relations for the number of k-ary...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
Jones and Remmel developed the Reciprocity Method to study the generating functions for the number o...
The study of permutations and permutation statistics dates back hundreds of years to the time of Eul...
International audienceCatalan words are particular growth-restricted words over the set of non-negat...
CombinatoricsRecently, Kitaev and Remmel refined the well-known permutation statistic "descent" by f...
In words, generated by independent geometrically distributed random variables, we study the l th d...
Analysis of AlgorithmsIn words, generated by independent geometrically distributed random variables,...
We start a general study of counting the number of occurrences of ordered patterns in words generate...
In this paper, we consider random words ω1ω2ω3 · · ·ωn of length n, where the letters ωi ∈ N are in...
AbstractGenerating functions which count occurrences of consecutive sequences in a permutation or a ...
8 pagesInternational audienceDescents in permutations or words are defined from the relative positio...
Abstract In this paper, we discuss the enumeration of words avoiding patterns with repeated letters....
In [BabStein] Babson and Steingrimsson introduced generalized permutation patterns that allow the re...
A word $w=w_1w_2\cdots w_n$ is alternating if either $w_1<w_2>w_3<w_4>\cdots$ (when the word is up-d...
AbstractWe present an algorithm for finding a system of recurrence relations for the number of k-ary...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
Jones and Remmel developed the Reciprocity Method to study the generating functions for the number o...
The study of permutations and permutation statistics dates back hundreds of years to the time of Eul...
International audienceCatalan words are particular growth-restricted words over the set of non-negat...
CombinatoricsRecently, Kitaev and Remmel refined the well-known permutation statistic "descent" by f...
In words, generated by independent geometrically distributed random variables, we study the l th d...
Analysis of AlgorithmsIn words, generated by independent geometrically distributed random variables,...
We start a general study of counting the number of occurrences of ordered patterns in words generate...
In this paper, we consider random words ω1ω2ω3 · · ·ωn of length n, where the letters ωi ∈ N are in...
AbstractGenerating functions which count occurrences of consecutive sequences in a permutation or a ...
8 pagesInternational audienceDescents in permutations or words are defined from the relative positio...
Abstract In this paper, we discuss the enumeration of words avoiding patterns with repeated letters....
In [BabStein] Babson and Steingrimsson introduced generalized permutation patterns that allow the re...
A word $w=w_1w_2\cdots w_n$ is alternating if either $w_1<w_2>w_3<w_4>\cdots$ (when the word is up-d...
AbstractWe present an algorithm for finding a system of recurrence relations for the number of k-ary...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...