DeepAI AI Chat
Log In Sign Up

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

11/12/2019
by   Jean-Luc Baril, et al.
Université de Bourgogne
0

Two same length words are d-equivalent if they have same descent set and same underlying alphabet. In particular, two same length permutations are d-equivalent if they have same descent set. The popularity of a pattern in a set of words is the overall number of copies of the pattern within the words of the set. We show the far-from-trivial fact that two patterns are d-equivalent if and only if they are equipopular over any d-equivalence class, and this equipopularity does not follow obviously from a trivial equidistribution.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/18/2018

Descent distribution on Catalan words avoiding a pattern of length at most three

Catalan words are particular growth-restricted words over the set of non...
10/13/2020

Pattern statistics in faro words and permutations

We study the distribution and the popularity of some patterns in words o...
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...
11/11/2021

Avoiding a pair of patterns in multisets and compositions

In this paper, we study the Wilf-type equivalence relations among multis...
12/07/2022

Cocke–Younger–Kasami–Schwartz–Zippel algorithm and relatives

The equivalence problem for unambiguous grammars is an important, but ve...
06/14/1999

Ocular dominance patterns in mammalian visual cortex: A wire length minimization approach

We propose a theory for ocular dominance (OD) patterns in mammalian prim...
08/26/2017

Mahonian STAT on rearrangement class of words

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