On Path diagrams and Stirling permutations

arXiv0906.1672MaRDI QIDQ6214279

Markus Kuba, Anna Varvak

Publication date: 9 June 2009

Abstract: A permutation can be locally classified according to the four local types: peaks, valleys, double rises and double falls. The corresponding classification of binary increasing trees uses four different types of nodes. Flajolet demonstrated the continued fraction representation of the generating function of local types, using a classical bijection between permutations, binary increasing trees, and suitably defined path diagrams induced by Motzkin paths. The aim of this article is to extend the notion of local types from permutations to $k$-Stirling permutations (also known as $k$-multipermutations). We establish a bijection of these local types to node types of $(k+1)$-ary increasing trees. We present a branched continued fraction representation of the generating function of these local types through a bijection with path diagrams induced by L ukasiewicz paths, generalizing the results from permutations to arbitrary $k$-Stirling permutations. We further show that the generating function of ordinary Stirling permutation has at least three branched continued fraction representations, using correspondences between non-standard increasing trees, $k$-Stirling permutations and path diagrams.

Mathematics Subject Classification ID

Trees (05C05)

This page was built for publication: On Path diagrams and Stirling permutations

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