New Wilf-equivalence results for dashed patterns

Abstract

We give a sufficient condition for the two dashed patterns τ(1)-τ(2)-·s-τ() and τ()-τ(-1)-·s-τ(1) 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 (X,≤).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…