DeepAI AI Chat
Log In Sign Up

Pattern statistics in faro words and permutations

by   Jean-Luc Baril, et al.

We study the distribution and the popularity of some patterns in words obtained by interlacing the letters of the two nondecreasing k-ary words of lengths differing by at most one. We present a bijection between these words and dispersed Dyck paths with a given number of peaks. We show how the bijection maps statistics of consecutive patterns into linear combinations of other pattern statistics on paths. We deduce enumerative results by providing multivariate generating functions for the distribution and the popularity of patterns of length at most three. Finally, we consider some interesting subclasses of faro words that are permutations, involutions, derangements, or subexcedent words.


page 1

page 2

page 3

page 4


Popularity of patterns over d-equivalence classes of words and permutations

Two same length words are d-equivalent if they have same descent set and...

Mahonian STAT on rearrangement class of words

In 2000, Babson and Steingrímsson generalized the notion of permutation ...

Hidden Words Statistics for Large Patterns

We study here the so called subsequence pattern matching also known as h...

Co-Occurrence Patterns in the Voynich Manuscript

The Voynich Manuscript is a medieval book written in an unknown script. ...

Dyck paths with catastrophes modulo the positions of a given pattern

For any pattern p of length at most two, we provide generating functions...

Enumeration of Dyck paths with air pockets

We introduce and study the new combinatorial class of Dyck paths with ai...

Enumerative Results on the Schröder Pattern Poset

The set of Schröder words (Schröder language) is endowed with a natural ...