English

Consecutive k-out-of-n:F Systems Have Unbounded Roots

Discrete Mathematics 2022-08-31 v1 Complex Variables

Abstract

This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed k2k\ge2. In the particular case k=2k=2, we show that the reliability polynomials have only real roots and highlight the closure of these roots by establishing their explicit formulas. We also point out that in this case, for any fixed \textit{n} the nonzero roots of the reliability polynomial are distinct numbers.

Keywords

Cite

@article{arxiv.2208.14173,
  title  = {Consecutive k-out-of-n:F Systems Have Unbounded Roots},
  author = {Marilena Jianu and Leonard Daus and Vlad-Florin Dragoi and Valeriu Beiu},
  journal= {arXiv preprint arXiv:2208.14173},
  year   = {2022}
}