Abstract
Successions, Eulerian and Simon Newcomb numbers, and levels are the best-known patterns associated with \([\varvec{s}]\)-specified random permutations. The distribution of the number of rises was first studied in 1755 by Euler. However, the distribution of the number of levels in an \([\varvec{s}]\)-specified random permutation remained unknown. In this study, our main goal is to identify the distribution of the number of levels, which we achieve using the finite Markov chain imbedding technique and insertion procedure. An example is given to illustrate the theoretical result.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
