More Statistics on Permutation Pairs

Abstract

Two inversion formulas for enumerating words in the free monoid by $\theta$-adjacencies are applied in counting pairs of permutations by various statistics. The generating functions obtained involve refinements of bibasic Bessel functions. We further extend the results to finite sequences of permutations.