On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations
From MaRDI portal
Publication:1284056
DOI10.1016/S0167-7152(98)00176-XzbMATH Open1057.62503OpenAlexW2023086569MaRDI QIDQ1284056FDOQ1284056
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
Recommendations
Cites Work
- Runs, scans and urn model distributions: A unified Markov chain approach
- Distribution Theory of Runs: A Markov Chain Approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact and limiting distributions of the number of successions in a random permutation
- On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding
- Reliability of Consecutive-k-out-of-n:F Systems with (k-1)-step Markov Dependence
- Title not available (Why is that?)
- A probabilistic interpretation of Eulerian numbers
- Permutations by Number of Rises and Successions
- Permutations and sequences
- Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
- The Cumulative Numbers and Their Polynomials
- Title not available (Why is that?)
- Extended Bernoulli and Eulerian numbers
- Title not available (Why is that?)
- A generalization of the Eulerian numbers with a probabilistic application
- Eulerian number asymptotics
- Title not available (Why is that?)
- Simon Newcomb’s Problem
Cited In (12)
- On finite Markov chain imbedding and its applications
- The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.
- Reliabilities for (n, f, k (i, j)) and ⟨n, f, k (i, j)⟩ Systems
- Вычисление распределения одной комбинаторной статистики, заданной на последовательностях с фиксированным составом знаков
- The Smith College Diploma Problem
- On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation
- Recursive equations in finite Markov chain imbedding
- Title not available (Why is that?)
- 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
- The distribution of increasing \(l\)-sequences in random permutations: A Markov chain approach
- Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets
This page was built for publication: On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284056)