Descent c-Wilf Equivalence
arXiv:1510.07190 · doi:10.46298/dmtcs.1312
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 equivalent, -c-Wilf equivalent, and -c-Wilf equivalent. For example, we will show that if and are minimally overlapping permutations in which start with 1 and end with the same element and and , then and are -c-Wilf equivalent.
arXiv admin note: text overlap with arXiv:1510.04319