Pattern statistics in faro words and permutations

10/13/2020
by   Jean-Luc Baril, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2019

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...
research
08/26/2017

Mahonian STAT on rearrangement class of words

In 2000, Babson and Steingrímsson generalized the notion of permutation ...
research
03/21/2020

Hidden Words Statistics for Large Patterns

We study here the so called subsequence pattern matching also known as h...
research
01/27/2016

Co-Occurrence Patterns in the Voynich Manuscript

The Voynich Manuscript is a medieval book written in an unknown script. ...
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
07/23/2018

Enumerative Results on the Schröder Pattern Poset

The set of Schröder words (Schröder language) is endowed with a natural ...
research
04/09/2023

Combinatorial Statistics on Pattern-avoiding Permutations

The study of Mahonian statistics dated back to 1915 when MacMahon showed...

Please sign up or login with your details

Forgot password? Click here to reset