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

08/09/2022
by   Marilena Jianu, et al.
0

This article is studying the roots of the reliability polynomials of linear consecutive-k-out-of-n:F systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed k≥2. In the particular case k=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 n the nonzero roots of the reliability polynomial are distinct numbers.

READ FULL TEXT
research
03/27/2020

Tight Bounds on the Coeffcients of Consecutive k-out-of-n:F Systems

In this paper we compute the coefficients of the reliability polynomial ...
research
04/24/2023

On polynomials associated to Voronoi diagrams of point sets and crossing numbers

Three polynomials are defined for given sets S of n points in general po...
research
01/14/2022

Explicit formulas for concatenations of arithmetic progressions

The sequence (Sm(n))_n⩾ 0: 1, 12, 123, … formed by concatenating the fir...
research
12/06/2019

Cubic spline approximation of the reliability polynomials of two dual hammock networks

The property of preserving the convexity and concavity of the Bernstein ...
research
12/28/2019

Optimal Polynomial Prediction Measures and Extremal Polynomial Growth

We show that the problem of finding the measure supported on a compact s...
research
09/22/2022

Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries

We study the uniform query reliability problem, which asks, for a fixed ...
research
03/31/2020

VC density of set systems defnable in tree-like graphs

We study set systems definable in graphs using variants of logic with di...

Please sign up or login with your details

Forgot password? Click here to reset