Abstract

Let asc and desc denote respectively the statistics recording the number of ascents or descents in a sequence having non-negative integer entries. In a recent paper by Andrews and Chern, it was shown that the distribution of asc on the inversion sequence avoidance class $I_n(\geq,\neq,>)$ is the same as that of $n-1-\text{asc}$ on the class $I_n(>,\neq,\geq)$, which confirmed an earlier conjecture of Lin. In this paper, we consider some further enumerative aspects related to this equivalence and, as a consequence, provide an alternative proof of the conjecture. In particular, we find recurrence relations for the joint distribution on $I_n(\geq,\neq,>)$ of asc and desc along with two other parameters, and do the same for $n-1-\text{asc}$ and desc on $I_n(>,\neq,\geq)$. By employing a functional equation approach together with the kernel method, we are able to compute explicitly the generating function for both of the aforementioned joint distributions, which extends (and provides a new proof of) the recent result $|I_n(\geq,\neq,>)|=|I_n(>,\neq,\geq)|$. In both cases, an algorithm is formulated for computing the generating function of the asc distribution on members of each respective class having a fixed number of descents.

Highlights

  • IntroductionIf |α| > 1, the weight of all possible such π is given by q j−1 l=i+1 bn−1(i, l), upon deleting j and considering the penultimate letter which belongs to [i + 1, j − 1] in this case

  • Let Sn denote the set of permutations of [n] = {1, . . . , n}, written in one-line notation

  • We have discussed various computational aspects related to the joint distribution of desc and asc on In(≥, =, >) as well as of desc and n − 1 − asc on In(>, =, ≥)

Read more

Summary

Introduction

If |α| > 1, the weight of all possible such π is given by q j−1 l=i+1 bn−1(i, l), upon deleting j and considering the penultimate letter which belongs to [i + 1, j − 1] in this case. Note that in (iii), deletion of the final j results in an arbitrary member of Bn−1(i, l) ∪ Cn−1(i, l) for some l ∈ [i − 1], upon considering whether r = 1 or r > 1 in the decomposition of π above, where the factor of q accounts for the ascent arising due to j. Deleting β from π (keeping the terminal j) yields a member of Cn−s−1(k, j), as the resulting sequence would end in a redundant (descent) bottom in this case.

Coefficient of pm
General Case
Concluding remarks
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call