On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations

Abstract

Eulerian and Simon Newcomb numbers are two of the most celebrated numbers associated with random permutations. Their distributions have been successfully used in various areas of statistics and applied probability. Conventionally, these distributions have been studied via combinatorial analysis. In this article, we provide a new, simple and unified probabilistic method based on the finite Markov chain imbedding technique to study the exact distributions of Eulerian and Simon Newcomb numbers. A new recursive equation which characterizes the Simon Newcomb numbers is obtained. We also show that many classical identities and recursive equations associated with Eulerian numbers are immediate consequences of our main result.