A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization

DOI10.1016/0167-6377(91)90065-WzbMath0737.90028OpenAlexW2082840375MaRDI QIDQ1178735

Yi-Ching Yao, Frank K. Hwang

Publication date: 26 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90065-w

zbMATH Keywords

consecutive-\(k\) systemsproblème des ménages

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial probability (60C05)

Related Items (3)

Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones ⋮ The Increasing Failure Rate Property of Consecutive-k:-out-of-n Systems ⋮ The IFR property for consecutive-\(k\)-out-of-\(n\):F systems.

Cites Work

• On the Failure Rates of Consecutive−k−out−of−n Systems
• Exact Reliability Formulas for Linear & Circular Consecutive-k-out-of-n:F Systems
• Simplified Reliabilities for Consecutive-k-out-of-nSystems
• On the Consecutive-k-of-n:F System
• Solution of the “Problème des ménages”

This page was built for publication: A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization