The distribution of increasing l -sequences in random permutations: A Markov chain approach

Statistics and Probability Letters

Volumn 49, Issue 4, 2000, Pages 337-344

  Johnson, Brad C ^a   Fu, James C ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Finite Markov chain embedding; Permutations; Sequences; Transition probability

Indexed keywords

EID: 0009943215     PISSN: 01677152     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-7152(00)00066-3     Document Type: Article

References (25)

1. Abramson M., Moser W.O.J. Combinations, successions and the. n -kings problem Math. Mag. 39:1966;269-273.
2. Abramson M., Moser W.O.J. Permutations without rising or falling. w -sequences. Ann. Math. Statist. 38:1967;1245-1254.
3. Dwass M. The number of increases in a random permutation. J. Combin. Theory Ser. A. 15:1973;192-199.
4. Dymacek W.M., Roselle D.P. Circular permutations by number of rises and successions. J. Combin. Theory Ser. A. 25:1978;196-201.
5. Fu J.C. Exact and limiting distributions of the number of successions in a random permutation. Ann. Inst. Statist. Math. 47(3):1995;435-446.
6. Fu J.C. Distribution theory of runs and patterns associated with a sequence of multi-state trials. Statist. Sinica. 6(4):1996;957-974.
7. Fu J.C., Koutras M.V. Distribution theory of runs: a Markov chain approach. J. Amer. Stat. Assoc. 89:1994;1050-1058.
8. Fu, J.C., Lou, W.Y.W., 1996. On the exact distribution of SECON and its application. Preprint.
9. Fu J.C., Lou W.Y.W., Wang Y.J. On the exact distributions of eulerian and simon newcomb numbers associated with random permutations. Statist. Probab. Lett. 42:1999;115-125.
10. Jackson D.M., Aleliunas R. Decomposition based generating functions for sequences. Canad. J. Math. 29(5):1977;971-1009.
11. Jackson D.M., Reilly J.W. Permutations with a prescribed number of. p -runs Ars. Combin. 1:1976;297-305.
12. Johnson, B.C., 1999. Distribution of increasing l -sequences in a random permutation, submitted for publication.
13. Kaplansky I. Symbolic solutions of certain problems in permutations. Bull. Amer. Math. Soc. 50:1944;906-914.
14. Kaplansky I. The asymptotic distribution of runs of consecutive elements. Ann. Math. Statist. 16:1945;200-203.
15. Koutras M.V., Alexandrou V. Runs, scans and urn model distributions: a unified Markov chain approach. Ann. Inst. Statist. Math. 47(4):1995;743-766.
16. Lou W.Y.W. On runs and longest runs tests; a method of finite Markov chain imbedding. J. Amer. Statist. Assoc. 91:1996;1595-1601.
17. Reilly J.W., Tanny S.M. Counting successions in permutations. Stud. Appl. Math. 61:1979;73-81.
18. Riordan J. Permutations without 3-sequences. Bull. Amer. Math. Soc. 51:1945;745-748.
19. Riordan J. A recurrence for permutations without rising or falling successions. Ann. Math. Statist. 36:1965;708-710.
20. Roselle D.P. Permutations by number of rises and successions. Proc. Amer. Math. Soc. 19:1968;8-16.
21. Roselle D.P. Graphs, quasisymmetry and permutations with restricted positions. Duke Math. J. 41:1974;41-50.
22. Tanny S.M. Permutations and successions. J. Combin. Theory Ser. A. 21:1976;196-202.
23. Whitworth, W.A., 1901. Choice and Chance, 5th Edition (Reprint). Stechert & Co., New York, 1934.
24. Wolfowitz J. Additive partition functions and a class of statistical hypothesis. Ann. Math. Statist. 13:1942;247-279.
25. Wolfowitz J. Note on the runs of consecutive elements. Ann. Math. Statist. 15:1944;97-98.