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

DOI10.1016/S0167-7152(98)00176-XzbMath1057.62503OpenAlexW2023086569MaRDI QIDQ1284056

W. Y. Wendy Lou, James C. Fu, Yueh-Jir Wang

Publication date: 1999

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-7152(98)00176-x

zbMATH Keywords

Transition probabilityFinite Markov chain imbeddingInsertion procedure

Mathematics Subject Classification ID

Exact distribution theory in statistics (62E15) Bernoulli and Euler numbers and polynomials (11B68)

Related Items (10)

Recursive equations in finite Markov chain imbedding ⋮ On finite Markov chain imbedding and its applications ⋮ On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation ⋮ On distribution of the number of peaks and the Euler numbers of permutations ⋮ Random permutations and unique fully supported ergodicity for the Euler adic transformation ⋮ Вычисление распределения одной комбинаторной статистики, заданной на последовательностях с фиксированным составом знаков ⋮ Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets ⋮ Reliabilities for (n, f, k (i, j)) and ⟨n, f, k (i, j)⟩ Systems ⋮ The distribution of increasing \(l\)-sequences in random permutations: A Markov chain approach ⋮ The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of the Eulerian numbers with a probabilistic application
• A probabilistic interpretation of Eulerian numbers
• Permutations and sequences
• Exact and limiting distributions of the number of successions in a random permutation
• Runs, scans and urn model distributions: A unified Markov chain approach
• Extended Bernoulli and Eulerian numbers
• Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
• Reliability of Consecutive-k-out-of-n:F Systems with (k-1)-step Markov Dependence
• Eulerian number asymptotics
• Distribution Theory of Runs: A Markov Chain Approach
• On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding
• Permutations by Number of Rises and Successions
• Simon Newcomb’s Problem
• The Cumulative Numbers and Their Polynomials

This page was built for publication: On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations