Wilf equivalence relations for consecutive patterns
Tim Dwyer, Sergi Elizalde

TL;DR
This paper explores various equivalence relations among permutations based on their avoidance and occurrence patterns as consecutive patterns, introducing a new, more restrictive relation and analyzing its properties and implications.
Contribution
It introduces super-strongly c-Wilf equivalence, shows its relation to existing equivalences, and provides necessary conditions and strengthened results for strong c-Wilf equivalence.
Findings
When restricted to non-overlapping permutations, the three equivalence relations coincide.
A necessary condition for strong c-Wilf equivalence involves the first and last elements of permutations.
The paper strengthens existing sufficient conditions for strong c-Wilf equivalence.
Abstract
Two permutations and are c-Wilf equivalent if, for each , the number of permutations in avoiding as a consecutive pattern (i.e., in adjacent positions) is the same as the number of those avoiding . In addition, and are strongly c-Wilf equivalent if, for each and , the number of permutations in containing occurrences of as a consecutive pattern is the same as for . In this paper we introduce a third, more restrictive equivalence relation, defining and to be super-strongly c-Wilf equivalent if the above condition holds for any set of prescribed positions for the occurrences. We show that, when restricted to non-overlapping permutations, these three equivalence relations coincide. We also give a necessary condition for two permutations to be strongly c-Wilf equivalent. Specifically, we show that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
