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

Statistics and Probability Letters

Volumn 42, Issue 2, 1999, Pages 115-125

  Fu, James C ^a   Lou, W Y Wendy ^b   Wang, Yueh Jir ^c  

^a UNIVERSITY OF MANITOBA   (Canada)

^b MOUNT SINAI SCHOOL OF MEDICINE   (United States)

^c NATIONAL DONG HWA UNIVERSITY   (Taiwan)

Author keywords

Finite Markov chain imbedding; Insertion procedure; Transition probability

Indexed keywords

EID: 0033115491     PISSN: 01677152     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-7152(98)00176-x     Document Type: Article

References (23)

1. Carlitz, L., 1964. Extended Bernoulli and Eulerian numbers. J. Duke Math. 31, 667-690.
2. Carlitz, L., 1972. Enumeration of sequences by rises and falls: A refinement of the Simon Newcomb problem. J. Duke Math. 39, 267-280.
3. Carlitz, L., 1974. Permutations and sequences. Adv. Math. 14, 92-120.
4. Carlitz, L., Scoville, R.A., 1974. Generalized Eulerian numbers: Combinatorial applications. Journal für die reine und angewandte Mathematik 265, 110-137.
5. David, F.N., Barton, D.E., 1962. Combinatorial Chance. Hafiner, New York.
6. Dillon, J.F., Roselle, D., 1969. Simon Newcomb's problem. SIAM J. Appl. Math. 17, 1086-1093.
7. Dwyer, P.S., 1940. The cumulative numbers and their polynomials. Ann. Math. Statist. 11, 66-71.
8. Fu, J.C., 1986. Reliability of consecutive-k-out-of-n: F systems with (k-1)-step Markov dependence. IEEE Trans. Reliab. R35, 602-606.
9. Fu, J.C., 1995. Exact and limiting distributions of the number of successions in a random permutation. Ann. Inst. Statist. Math. 47, 435-446.
10. Fu, J.C., 1996. Distribution theory of runs and patterns associated with a sequence of multi-state trials. Statistica Sinica 6, 957-974.
11. Fu, J.C., Koutras, M.V., 1994. Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89, 1050-1058.
12. Giladi, E., Keller, J.B., 1994. Eulerian number asymptotics. Proc. Roy. Soc. Lond. A 445, 291-303.
13. Harris, B., Park, C.J., 1994. A generalization of the Eulerian numbers with a probabilistic application. Statist. Probab. Lett. 20, 37-47.
14. Koutras, M.V., 1994. Eulerian numbers associated with sequences of polynomials. Fibonacci Quart. 32, 44-57.
15. Koutras, M.V., Alexandrou, V., 1995. Runs, scans and urn model distributions: a unified Markov chain approach. Ann. Inst. Statist. Math. 47, 743-766.
16. Lou, W.Y.W., 1996. On runs and longest run tests: a method of finite Markov chain imbedding. J. Amer. Statist. Assoc. 91, 1595-1601.
17. MacMahon, P.A., 1915. Combinatory Analysis. Cambridge, London.
18. Nicolas, J.L., 1992. An integral representation for Eulerian numbers. Colloq. Math. Soc. 60, 513-527.
19. Riordan, J., 1958. An Introduction to Combinatorial Analysis. Wiley, New York.
20. Roselle, D., 1969. Permutations by number rises and successions. Proc. A.M.S 19, 8-16.
21. Takacs, L., 1979. A generalization of the Eulerian numbers. Publ. Math. Debrecen 26, 173-181.
22. Tanny, S., 1973. A probabilistic interpretation of Eulerian numbers. J. Duke Math. 40, 717-722.
23. Worpitzky, J., 1883. Studien über die Bernoullischen und Eulerischen Zahlen. J. Reine Angew. Math. 94, 203-232.