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

dmtcs:1312 - Discrete Mathematics & Theoretical Computer Science, March 2, 2017, Vol. 18 no. 2, Permutation Patterns 2015 - https://doi.org/10.46298/dmtcs.1312
Descent c-Wilf EquivalenceArticle

Authors: Quang T. Bach ; Jeffrey B. Remmel

    Let Sn denote the symmetric group. For any σSn, we let des(σ) denote the number of descents of σ, inv(σ) denote the number of inversions of σ, and LRmin(σ) denote the number of left-to-right minima of σ. For any sequence of statistics stat1,statk on permutations, we say two permutations α and β in Sj are (stat1,statk)-c-Wilf equivalent if the generating function of ki=1xstatii over all permutations which have no consecutive occurrences of α equals the generating function of ki=1xstatii over all permutations which have no consecutive occurrences of β. We give many examples of pairs of permutations α and β in Sj which are des-c-Wilf equivalent, (des,inv)-c-Wilf equivalent, and (des,inv,LRmin)-c-Wilf equivalent. For example, we will show that if α and β are minimally overlapping permutations in Sj which start with 1 and end with the same element and des(α)=des(β) and inv(α)=inv(β), then α and β are (des,inv)-c-Wilf equivalent.


    Volume: Vol. 18 no. 2, Permutation Patterns 2015
    Section: Permutation Patterns
    Published on: March 2, 2017
    Accepted on: March 2, 2017
    Submitted on: March 1, 2017
    Keywords: Mathematics - Combinatorics,05A15, 05E05

    Consultation statistics

    This page has been seen 690 times.
    This article's PDF has been downloaded 378 times.