New Wilf-equivalence results for dashed patterns
Combinatorics
2012-01-23 v1
Abstract
We give a sufficient condition for the two dashed patterns and to be (strongly) Wilf-equivalent. This permits to solve in a unified way several problems of Heubach and Mansour on Wilf-equivalences on words and compositions, as well as a conjecture of Baxter and Pudwell on Wilf-equivalences on permutations. We also give a better explanation of the equidistribution of the parameters and on ordered set partitions. These results can be viewed as consequences of a simple proposition which states that the set valued statistics "descent set'' and "rise set'' are equidistributed over each equivalence class of the partially commutative monoid generated by a poset .
Cite
@article{arxiv.1201.4317,
title = {New Wilf-equivalence results for dashed patterns},
author = {Anisse Kasraoui},
journal= {arXiv preprint arXiv:1201.4317},
year = {2012}
}