Block patterns in Stirling permutations

From MaRDI portal
Publication:2345774



Abstract: We introduce and study a new notion of patterns in Stirling and k-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns in terms of generating functions for the occurrences of patterns in permutations. This result yields a number of applications involving, among other things, Wilf equivalence of block patterns and a new interpretation of Bessel polynomials. We also show how to interpret our results for a certain class of labeled trees, which are in bijection with Stirling permutations.












This page was built for publication: Block patterns in Stirling permutations

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