\(q\)-counting descent pairs with prescribed tops and bottoms (Q2380270)

Summary: Given sets \(X\) and \(Y\) of positive integers and a permutation \(\sigma= \sigma_1\sigma_2\cdots \sigma_n\in S_n\), an \((X,Y)\)-descent of \(\sigma\) is a descent pair \(\sigma_i> \sigma_{i+1}\) whose ``top'' \(\sigma_i\) is in \(X\) and whose ``bottom'' \(\sigma_{i+1}\) is in \(Y\). Recently \textit{J. Hall} and \textit{J. Remmel} [Counting descents with prescribed tops and bottoms, math.CO/0610608] proved two formulas for the number \(P_{n,s}^{X,Y}\) of \(\sigma\in S_n\) with \(s\) \((X,Y)\)-descents, which generalized \textit{J. Liese}'s results in [Ann. Comb. 11, No.~3--4, 481--506 (2007; Zbl 1141.05006)]. We define a new statistic \(\text{stat}_{X,Y}(\sigma)\)A on permutations \(\sigma\) and define \(P_{n,s}^{X,Y}(q)\) to be the sum of \(q^{\text{stat}_{X,Y}(\sigma)}\) over all \(\sigma\in S_n\) with \(s\) \((X,Y)\)-descents. We then show that there are natural \(q\)-analogues of the Hall-Remmel formulas for \(P_{n,s}^{X,Y}(q)\).