New Wilf-equivalence results for vincular patterns

DOI10.1016/J.EJC.2012.07.006zbMATH Open1254.05010arXiv1201.4317OpenAlexW2035964580MaRDI QIDQ691587FDOQ691587

Authors: Anisse Kasraoui 

Publication date: 3 December 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We give a sufficient condition for the two dashed patterns $a{u}^{(1)}-a{u}^{(2)}-cdots-a{u}^{(ell)}$ and $a{u}^{(ell)}-a{u}^{(ell-1)}-cdots-a{u}^{(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,leq)$.

Full work available at URL: https://arxiv.org/abs/1201.4317

Recommendations

• Some Wilf-equivalences for vincular patterns
• Shape-Wilf-equivalences for vincular patterns
• Wilf equivalences between vincular patterns in inversion sequences
• A refinement of Wilf-equivalence for patterns of length 4
• Wilf equivalence relations for consecutive patterns
• New equivalences for pattern avoiding involutions
• A new class of Wilf-equivalent permutations
• The solution of a conjecture of Stanley and Wilf for all layered patterns
• A new class of multiset Wilf equivalent pairs
• Enumeration schemes for vincular patterns

zbMATH Keywords

descent setrise set

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07)

Cited In (10)

• Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
• Shape-Wilf-equivalences for vincular patterns
• Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
• Some Wilf-equivalences for vincular patterns
• On Wilf equivalence for alternating permutations
• Inversion sequences avoiding consecutive patterns
• On super-strong Wilf equivalence classes of permutations
• Some results on the avoidance of vincular patterns by multisets
• Wilf equivalences between vincular patterns in inversion sequences
• Refined Wilf-equivalences by Comtet statistics

This page was built for publication: New Wilf-equivalence results for vincular patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691587)