Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots

DOI10.1002/net.22168zbMath1529.90037arXiv2208.14173MaRDI QIDQ6139378

Vlad-Florin Drăgoi, Leonard Dăuş, Valeriu Beiu, Marilena Jianu

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.14173

zbMATH Keywords

polynomial rootsBeraha-Kahane-Weiss theoremFibonacci polynomialsconsecutive-\(k\)-out-of-\(n\):\(F\) systemsJacobstahl polynomialstwo-terminal node reliability

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Brown-Colbourn conjecture on zeros of reliability polynomials is false
• Computing residual connectedness reliability for restricted networks
• On the roots of all-terminal reliability polynomials
• Reliability Determination of a r-Successive-out-of-n:F System
• Reliability of Consecutive-k-out-of-n:F System
• Roots of the Reliability Polynomials
• On the roots of the node reliability polynomial
• What is the probability of connecting two points?
• Reliable circuits using less reliable relays

This page was built for publication: Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots