A simple proof and a generalization of an old result of Chung and Feller

DOI10.1016/0012-365X(91)90078-GMaRDI QIDQ756239zbMATH OpenFDO

Authors Balázs Montágh

Publication date 1991

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(91)90078-G

zbMATH Keywords

coin tossingrank-order test

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Partitions of sets (05A18) Combinatorial probability (60C05) Order statistics; empirical distribution functions (62G30)

Review text

Given an arbitrary sequence of n letters A and n letters B, the probability is determined that exactly k B's precede the corresponding A with the same ordinary number. This problem was posed by Galton and first solved by \textit{K. L. Chung} and \textit{W. Feller} [Proc. Natl. Acad. Sci. USA 35, 605-608 (1949; Zbl 0037.363)].

Recommendations

• On a problem of Gy. Hajós
• Some generating function proofs of old and new results in probability
• scientific article; zbMATH DE number 7731501
• scientific article; zbMATH DE number 3919429
• scientific article; zbMATH DE number 4029573

Cites work

• Functional Composition Patterns and Power Series Reversion
• Galton's Rank-Order Test
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• On Fluctuations in Coin-Tossing

Cited in

(4)

• On a problem of Gy. Hajós
• Some generating function proofs of old and new results in probability
• scientific article; zbMATH DE number 1876816 (Why is no real title available?)
• On 1-factorizations of bipartite Kneser graphs

This page was built for publication: A simple proof and a generalization of an old result of Chung and Feller

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756239)