DeepAI AI Chat
Log In Sign Up

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

by   Jean-Luc Baril, et al.
Université de Bourgogne

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.


page 1

page 2

page 3

page 4


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

Pattern statistics in faro words and permutations

We study the distribution and the popularity of some patterns in words o...

Dyck paths with catastrophes modulo the positions of a given pattern

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

Avoiding a pair of patterns in multisets and compositions

In this paper, we study the Wilf-type equivalence relations among multis...

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

The equivalence problem for unambiguous grammars is an important, but ve...

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

We propose a theory for ocular dominance (OD) patterns in mammalian prim...

Mahonian STAT on rearrangement class of words

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