Statistics of partial permutations via Catalan matrices

From MaRDI portal
Publication:2104910

DOI10.1016/J.AAM.2022.102451zbMATH Open1504.05006arXiv2207.10252OpenAlexW4307648738MaRDI QIDQ2104910FDOQ2104910


Authors: Yen-Jen Cheng, Sen-Peng Eu, Hsiang-Chun Hsu Edit this on Wikidata


Publication date: 8 December 2022

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: A generalized Catalan matrix (an,k)n,kge0 is generated by two seed sequences mathbfs=(s0,s1,ldots) and mathbft=(t1,t2,ldots) together with a recurrence relation. By taking sell=2ell+1 and tell=ell2 we can interpret an,k as the number of partial permutations, which are nimesn 0,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.


Full work available at URL: https://arxiv.org/abs/2207.10252




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Statistics of partial permutations via Catalan matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104910)