Descent c-Wilf Equivalence
Quang T. Bach, Jeffrey B. Remmel

TL;DR
This paper explores the concept of descent c-Wilf equivalence among permutations, providing numerous examples and conditions under which permutations are equivalent based on certain statistics and avoidance of consecutive patterns.
Contribution
It introduces the notion of descent c-Wilf equivalence and characterizes when permutations are equivalent based on descent, inversion, and left-to-right minima statistics.
Findings
Identifies conditions for des, inv, and LRmin c-Wilf equivalence.
Provides examples of permutation pairs with these equivalences.
Shows that certain minimally overlapping permutations are equivalent under specific conditions.
Abstract
Let denote the symmetric group. For any , we let denote the number of descents of , denote the number of inversions of , and denote the number of left-to-right minima of . For any sequence of statistics on permutations, we say two permutations and in are -c-Wilf equivalent if the generating function of over all permutations which have no consecutive occurrences of equals the generating function of over all permutations which have no consecutive occurrences of . We give many examples of pairs of permutations and in which are -c-Wilf…
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.
