Statistics of partial permutations via Catalan matrices

Abstract

A generalized Catalan matrix (an,k)n,k≥0 is generated by two seed sequences s=(s0,s1,…) and t=(t1,t2,…) together with a recurrence relation. By taking sℓ=2ℓ+1 and tℓ=ℓ2 we can interpret an,k as the number of partial permutations, which are n×n0,1-matrices of k zero rows with at most one 1 in each row or column. In this paper we prove that most of fundamental statistics and some set-valued statistics on permutations can also be defined on partial permutations and be encoded in the seed sequences. Results on two interesting permutation families, namely the connected permutations and cycle-up-down permutations, are also given.