Answers are grounded in this paper and cite their sources.
Let X l , · ··, Χ n be independent binary variables with parameters θ l , · ··, θ n respectively, and let R denote the length of the longest run of 1's. This note concerns a new expression for and a rearrangement inequality. The inequality is applied to solve an optimal permutation problem for consecutive- k -out-of- n : F networks, and its implications on a recent conjecture of Derman et al. (1982) are discussed.
No takes yet. Share an insight, caveat, or question.
Y. L. Tong (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: