Next Article in Journal
Assessing the Impact of Time-Varying Optimal Vaccination and Non-Pharmaceutical Interventions on the Dynamics and Control of COVID-19: A Computational Epidemic Modeling Approach
Previous Article in Journal
On c-Compactness in Topological and Bitopological Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Roots of the Reliability Polynomials of Circular Consecutive-k-out-of-n:F Systems

1
Department of Mathematics and Computer Science, Technical University of Civil Engineering Bucharest, 020396 Bucharest, Romania
2
Department of Mathematics and Computer Science, Faculty of Exact Sciences, “Aurel Vlaicu” University of Arad, 310330 Arad, Romania
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(20), 4252; https://doi.org/10.3390/math11204252
Submission received: 4 September 2023 / Revised: 4 October 2023 / Accepted: 10 October 2023 / Published: 11 October 2023

Abstract

:
The zeros of the reliability polynomials of circular consecutive-k-out-of-n:F systems are studied. We prove that, for any fixed k 2 , the set of the roots of all the reliability polynomials (for all n k ) is unbounded in the complex plane. In the particular case k = 2 , we show that all the nonzero roots are real, distinct numbers and find the closure of the set of roots. For every n k , the expressions of the minimum root and the maximum root are given, both for circular as well as for linear systems.

1. Introduction

Consecutive-k-out-of-n:F systems were introduced by Kontoleon [1] under the name of “r-successive-out-of-n:F”, being re-branded “consecutive-k-out-of-n:F” one year later [2]. They have attracted researchers’ interest due to their robustness and ability to achieve high reliability at reasonably low costs. A consecutive-k-out-of-n:F system is formed by n components placed in a row (if the system is linear), or in a cycle (for a circular system, a concept mentioned for the first time in [3]), which fails if and only if at least k consecutive components fail. The reader can find a detailed presentation of the subject in [4,5,6] and recent contributions in the field, developments, and applications in [7,8,9,10,11,12,13,14,15,16,17,18].
A linear consecutive-k-out-of-n:F system can be represented as a graph G = ( V , E ) , with n + 2 vertices, V = { S = 0 , 1 , 2 , , n , n + 1 = T } , and having the set of edges E = { i j , 0 i < j n + 1 , j i k } (see Figure 1). The nodes 1 , 2 , , n are identical and statistically independent, failing with probability q = 1 p , while the terminals S = 0 , T = n + 1 , as well as the edges, are always operational. Note that this graph representation may be directed or undirected. The reliability of the system, denoted by R L ( k , n ; p ) , is the probability that the system is working, i.e., the probability that the subgraph induced by the operational nodes has at least one path linking the terminal nodes S and T.
A circular consecutive-k-out-of-n:F system can also be represented as a directed graph G = ( V , E ) , with n vertices, V = { 1 , 2 , , n } , and having the set of directed edges E = { i j , 0 i n , i + 1 j i + k ( mod n ) } (see Figure 2). As in the linear case, we assume that the nodes 1 , 2 , , n are identical and statistically independent, failing with probability q = 1 p , while the edges are always operational. The reliability of the circular system, R C ( k , n ; p ) , is the probability that the subgraph induced by the operational nodes is Hamiltonian (it has a cycle that visits each vertex exactly once).
In both cases, the reliability is a polynomial of degree n in p, for every n k (for n < k , it is equal to 1). Moreover, these reliability polynomials satisfy the same recurrence relation, for every n k in the linear case, and for every n 2 k in the circular case, respectively. Philippou [19] identified the relation between the reliability polynomials of linear consecutive systems and the generalized Fibonacci polynomials (introduced by Hoggatt and Bicknell in [20]), while Charalambides [21] noted the relation between the reliability polynomials of circular consecutive systems and the Lucas polynomials of order k.
The reliability polynomial of a network formed by a number of identical components is usually considered as a function of p, the probability that a single component is functional. The value of p is normally supposed to be in the interval [ 0 , 1 ] , but studying the analytic properties of these polynomials as functions of a complex variable z C can shed new light on the landscape of reliability theory. Originally [22], the roots of reliability polynomials were investigated for the possible log-concavity of the coefficients. In fact, various properties of the roots can be linked to the shape of the coefficients [23], so finding the location and magnitude of the roots is clearly worth exploring.
For instance, using the Newton’s inequalities (see [24], 7.1), it can be easily shown that for any polynomial P ( z ) = j = 0 n a j z j with positive coefficients and real roots, the sequence of coefficients is log-concave, that is,
a j 2 > a j 1 a j + 1 , j = 1 , , n 1 .
It is well-known that a log-concave sequence is unimodal. As a matter of fact, the condition above is sufficient, but it is not necessary. A more general result [25] states that if all the (complex) roots of a polynomial with positive coefficients lie in the region 2 π 3 < arg z < 4 π 3 , then the sequence of coefficients is log-concave.
Finding the set of roots of various polynomials related to different families of graphs is both a tempting and also a fruitful problem which has attracted lots of research in the past few decades (see, for instance [22,26,27,28,29,30] for reliability polynomials; [31,32,33,34,35] for chromatic polynomials; and [36,37,38,39] for independence polynomials). In many of these papers, a central role is played by a theorem on analytic functions due to Beraha, Kahane, and Weiss [40], which proves to be a highly useful instrument to study the zeros of a family of polynomials defined recursively.
Using the Beraha–Kahane–Weiss theorem, the authors have proven in a recent paper [41] that the set of the roots of the reliability polynomials of linear consecutive-k-out-of-n:F systems is unbounded, for any k 2 . In this paper, we show (in Section 2) that the result also holds for circular consecutive-k-out-of-n:F systems. In Section 3, we study the particular case when k = 2 and prove that all the nonzero roots of the reliability polynomial of the circular consecutive-2-out-of-n:F system are real, distinct numbers (for any n 2 ). Moreover, we show that any root of a circular consecutive-2-out-of-n:F system is also a root of the linear consecutive-2-out-of- ( 2 n 2 ) :F system. Finally, in Section 4 we investigate the values of the minimum and the maximum root for different values of n, and for both kinds of systems. We show that the interval between the minimum and the maximum root is growing faster (as n increases) for circular systems than for linear systems. It is also worth mentioning that, in each case, the sequence of intervals exhibits a kind of periodicity, being formed by three monotonic subsequences.

2. The Circular Consecutive- k -out-of- n :F Systems Have Unbounded Roots

For any fixed k 2 , the reliability polynomials R C ( k , n ; p ) of circular consecutive-k-out-of-n:F systems satisfy the following recurrence relation for any n 2 k (see [42]):
R C ( k , n ; p ) = p R C ( k , n 1 ; p ) + p q R C ( k , n 2 ; p ) + + p q k 1 R C ( k , n k ; p ) .
Since the system fails if and only if at least k consecutive components fail, the first k polynomials are equal to 1:
R C ( k , n ; p ) = 1 , n = 0 , 1 , , k 1 ,
and when n = k :
R C ( k , k ; p ) = 1 q k .
For n = k + 1 , , 2 k , the reliability polynomials have the expression [42]:
R C ( k , n ; p ) = 1 q n n p q k .
Since k 2 is fixed, for any n 0 , the polynomial R C ( k , n ; p ) can be written as follows:
R C ( k , n ; p ) = p n C n ( z ) ,
where
z = q p = 1 p 1 ,
and C n ( z ) is a polynomial of degree n in z. From (1), we find that the polynomials C n ( z ) satisfy the following recurrence relation, for any n 2 k :
C n ( z ) = C n 1 ( z ) + z C n 2 ( z ) + + z k 1 C n k ( z ) .
Using Equations (2)–(6), we obtain:
C n ( z ) = ( 1 + z ) n , for n = 0 , 1 , , k 1 C k ( z ) = ( 1 + z ) k z k C n ( z ) = ( 1 + z ) n z n n z k ( 1 + z ) n k 1 , for n = k + 1 , , 2 k .
In the following, we recall some basic results on recursively defined polynomials. Consider an arbitrary sequence of polynomials { P n } , n = 0 , 1 , , defined by a linear recurrence relation of order k:
P n ( z ) = j = 1 k f j ( z ) P n j ( z ) , n k ,
where f j ( z ) and P j 1 ( z ) , j = 1 , 2 , , k are given polynomials.
We say that x C is a limit of zeros of { P n } if there exists a sequence of complex numbers { z n } such that P n ( z n ) = 0 and lim n z n = x .
Let λ j ( z ) , j = 1 , 2 , , k be the roots of the characteristic equation
λ k j = 1 k f j ( z ) λ k j = 0 .
Then, for any z C such that λ i ( z ) λ j ( z ) for i j , one can write:
P n ( z ) = j = 1 k α j ( z ) λ j ( z ) n ,
where α j ( z ) , j = 1 , , k are found from the linear system of equations obtained by writing (11) for n = 0 , , k 1 .
Theorem 1
(Beraha–Kahane–Weiss theorem [40]). Suppose that { P n } is a sequence of polynomials defined by a relation of the form (9) such that { P n } satisfies no recursion of order less than k, and there is no constant ω, with | ω | = 1 , such that λ i ( z ) = ω λ j ( z ) for some i j .
Then, x is a limit of zeros of { P n } if and only if the roots of the characteristic Equation (10) can be ordered such that one of the following holds:
(i) λ 1 ( x ) > λ j ( x ) for every j = 2 , , k , and α 1 ( x ) = 0 ,
(ii) λ 1 ( x ) = λ 2 ( x ) = = λ l ( x ) > λ j ( x ) , j = l + 1 , , k , for some l 2 .
Using this theorem, we can prove the following result.
Theorem 2.
For any fixed k 2 , the set of complex roots of all the polynomials R C ( k , n ; p ) , n k , is unbounded.
Proof. 
First, we prove that the sequence of polynomials C n ( z ) defined by the recurrence (7) of order k, with the initial conditions (8), satisfies the conditions from Theorem 1. In our case, the characteristic Equation (10) is written
λ k j = 1 k z j 1 λ k j = 0 .
Suppose that there exists a constant ω with | ω | = 1 with the property that for any z C , there exists λ ( z ) a root of (12) such that ω λ ( z ) is also a root of (12).
We can bring Equation (12) to a simpler form if we multiply it by ( λ z ) . Thus, we can see that any root of (12) also satisfies the equation
λ k + 1 ( 1 + z ) λ k + z k = 0 ,
while (13) has a root (namely, λ = z ) which is not a root of (12).
For z = 1 , the characteristic Equation (12) becomes
λ k λ k 1 + + ( 1 ) k 1 λ + ( 1 ) k = 0
and its roots are the roots 1 of the Equation (13), which is written:
λ k + 1 = ( 1 ) k + 1 .
If k is odd, the complex roots of this equation are
λ r = exp 2 r π k + 1 i , r { 0 , 1 , , k } { k + 1 2 } ,
while for k even, the roots are of the form:
λ r = exp ( 2 r + 1 ) π k + 1 i , r { 0 , 1 , , k } { k 2 } .
In any case, the roots of the characteristic Equation (14) are all distinct complex numbers of modulus 1:
λ 1 ( 1 ) = = λ k ( 1 ) = 1 ,
and we can see that the ratio between any two different roots is of the form
ω = exp 2 m π k + 1 i , m { 1 , 2 , , k } .
Thus, if there were a constant ω such that, for any z, there exist two roots λ and ω λ of (12), then ω should be of the form (16), and hence it should satisfy ω k + 1 = 1 .
Consider z 0 , 1 . Then, the roots of (13) are different from 0. If we suppose that both λ and ω λ satisfy Equation (13), then we obtain that ω k = 1 , a contradiction, which implies that there is no such constant ω . So we find (using (15)) that the hypotheses of Theorem 1 case (ii) are fulfilled, and hence there exists a sequence of complex numbers { z n } such that C n ( z n ) = 0 and lim n z n = 1 .
Recall that z was introduced by the change in variable (6). Therefore, we need to prove that z n 1 . From the recurrence of order k (7), one can easily deduce the following recurrence of order k + 1 :
C n ( z ) = ( 1 + z ) C n 1 ( z ) z k C n k 1 ( z ) , for all n 2 k + 1 .
Hence,
C n ( 1 ) = ( 1 ) k + 1 C n k 1 ( 1 ) ,
for every n 2 k + 1 . Using (8), we deduce that C n ( 1 ) = ( 1 ) n 1 0 , for every n = k , k + 1 , , 2 k , so it follows that C n ( 1 ) 0 , for any n. Thus, we find that 1 is not a root of the polynomials C n , so z n 1 , for any n k . Using (6), we have z n = 1 p n p n , and it follows that
p n = 1 z n + 1 , n = k , k + 1 ,
is a sequence of roots of the reliability polynomial R C ( k , n ; p ) , with lim n p n = , and the theorem is proved. □

3. The Roots of Consecutive-2-out-of- n :F Systems

In this section, we study the particular case of circular consecutive-2-out-of-n systems and find the explicit formula for the reliability polynomials and their roots (proved to be all real numbers). We also aim to compare the circular and the linear consecutive-2-out-of-n systems, underlying the similarities and differences, as well as the relationships between the two families of polynomials. Therefore, we begin with a short review of the reliability polynomials of linear consecutive systems (studied in [41]).
The reliability polynomials R L ( k , n ; p ) of linear consecutive-k-out-of n:F systems satisfy the same recurrence relation as R C ( k , n ; p ) [4], but starting from n = k (while the polynomials of circular systems satisfy the recurrence relation (1) starting from n = 2 k ):
R L ( k , n ; p ) = p R L ( k , n 1 ; p ) + p q R L ( k , n 2 ; p ) ( p ) + + p q k 1 R L ( k , n k ; p ) ,
for every n k . The initial polynomials are
R L ( k , n ; p ) = 1 , n = 0 , 1 , , k 1 .
Using the same transformation, z = q p , and R L ( k , n ; p ) = p n L n ( z ) , we obtain the sequence of polynomials { L n } satisfying the same recurrence as { C n }
L n ( z ) = L n 1 ( z ) + z L n 2 ( z ) + + z k 1 L n k ( z ) ,
for every n k and the initial conditions
L n ( z ) = ( 1 + z ) n , for n = 0 , 1 , , k 1 .
When k = 2 , Equations (20) and (21) become
L n ( z ) = L n 1 ( z ) + z L n 2 ( z ) , n = 2 , 3 ,
L 0 ( z ) = 1 , L 1 ( z ) = 1 + z .
Thus, as noted in [41], the sequence { L n } is the sequence of Jacobsthal polynomials { J n } , with L n ( z ) = J n + 2 ( z ) . Introduced in [43], the Jacobsthal polynomials have the same coefficients as the more famous Fibonacci polynomials, being related by the formula F n ( z ) = z n 1 J n 1 z 2 (see ([44], Chp. 44) for a detailed presentation). Table 1 shows the Fibonacci polynomials F n and Jacobsthal polynomials J n for n = 0 , , 8 .
The characteristic equation corresponding to the recurrence relation (22) is
λ 2 λ z = 0
having the roots
λ 1 , 2 ( z ) = 1 ± 1 + 4 z 2 .
The Jacobsthal polynomials can be expressed by the following Binet-type formula [44]:
J n ( z ) = λ 1 ( z ) n λ 2 ( z ) n λ 1 ( z ) λ 2 ( z ) ,
hence,
L n ( z ) = λ 1 ( z ) n + 2 λ 2 ( z ) n + 2 λ 1 ( z ) λ 2 ( z ) ,
for every n 0 .
The Jacobsthal polynomials J n ( z ) are closely related to the Jacobsthal–Lucas polynomials j n ( z ) defined by the same recurrence relation,
j n ( z ) = j n 1 ( z ) + z j n 2 ( z ) , n = 2 , 3 , ,
but with the initial terms j 0 ( z ) = 2 , j 0 ( z ) = 1 [44,45]. These polynomials have the same coefficients as the well-known Lucas polynomials (defined by the same recurrence relation as the Fibonacci polynomials, but with different initial terms), being related by the formula L n ( z ) = z n j n 1 z 2 (see Table 2).
Now, if we consider the polynomials { C n ( z ) } corresponding to the circular consecutive-2-out-of-n:F systems, R C ( 2 , n ; p ) = p n C n ( z ) , we can see that for k = 2 , the relations (7) and (8) become:
C n ( z ) = C n 1 ( z ) + z C n 2 ( z ) , n = 4 , 5 ,
C 0 ( z ) = 1 , C 1 ( z ) = 1 + z , C 2 ( z ) = 1 + 2 z , C 3 ( z ) = 1 + 3 z ,
and we notice that C n ( z ) = j n ( z ) , for every n 2 .
Obviously, the characteristic equation corresponding to the recurrence relation (28) is again (24), having the roots λ 1 and λ 2 expressed by (25), so the polynomial C n ( z ) can be written:
C n ( z ) = α 1 λ 1 ( z ) n + α 2 λ 2 ( z ) n , n = 2 , 3 , .
Using the initial conditions (29), it can be easily shown α 1 = α 2 = 1 , so we obtain the following Binet-type formula (the same as the expression of Jacobsthal–Lucas polynomials j n ( z ) [44]):
C n ( z ) = λ 1 ( z ) n + λ 2 ( z ) n ,
for every n 2 .
Remark 1.
From Equations (27) and (30), it follows that
L 2 n 2 ( z ) = L n 2 ( z ) · C n ( z ) ,
and multiplying by p 2 n 2 , we obtain the following formula:
R L ( 2 , 2 n 2 ; p ) = R L ( 2 , n 2 ; p ) · R C ( 2 , n ; p ) .
Moreover, the following identity can be proved using (32) and mathematical induction on r = 1 , 2 , :
R L ( 2 , 2 r n 2 ; p ) = R L ( 2 , n 2 ; p ) i = 0 r 1 R C ( 2 , 2 i n ; p ) .
The roots of the of linear consecutive-2-out-of-n:F systems were studied in [41], and it has been proved that for any n 2 , the nonzero roots of the reliability polynomial R L ( 2 , n ; p ) are real, distinct numbers. The Formula (32) allows us to state the same for circular consecutive-2-out-of-n:F systems. In particular, the next theorem establishes a stronger statement, namely that the closure of the set of roots of the reliability polynomials of circular consecutive-2-out-of-n:F systems is the same as for the linear consecutive case.
Theorem 3.
For any n 2 , the nonzero roots of the reliability polynomial R C ( 2 , n ; p ) of the circular consecutive-2-out-of-n:F system are real, distinct numbers.
Let R L and R C denote the set of roots (for all n 2 ) of the polynomials R L ( 2 , n ; p ) and R C ( 2 , n ; p ) , respectively. Then,
R C R L
and
R C ¯ = R L ¯ = ( , 0 ] 4 3 , .
Proof. 
According to (32), it follows that all the roots of the polynomial R C ( 2 , n ; p ) are also roots of the polynomial R L ( 2 , 2 n 2 ; p ) . Hence, R C R L , and from ([41], Theorem 3), it readily follows that the nonzero roots of R C ( 2 , n ; p ) are distinct, real numbers.
In order to prove (35), we need the explicit expression of these roots. From (5), we have that every nonzero root of R C ( 2 , n ; p ) corresponds to a root z 1 of the polynomial C n ( z ) . Using (30), we have:
C n ( z ) = 0 λ 1 ( z ) λ 2 ( z ) n = 1 1 + 1 + 4 z 1 1 + 4 z = exp i ( 2 r + 1 ) π n , r = 0 , 1 , , n 1 .
It follows that
z n , r = 1 4 cos 2 ( 2 r + 1 ) π 2 n , r = 0 , 1 , , n 2 1
are the n 2 distinct roots of the polynomial C n ( z ) . It can be easily seen that z n , r 1 for any r; hence,
p n , r C = 1 1 + z n , r = 1 + 1 2 cos ( 2 r + 1 ) π n + 1 , r = 0 , 1 , , n 2 1
are the distinct nonzero roots of the reliability polynomial R C ( 2 , n ; p ) . Using (37), it can be seen that p n , r C ( , 0 ) 4 3 , for every n 2 and r = 0 , 1 , , n 2 1 , and the roots are dense in ( , 0 ] 4 3 , . □

4. Discussion

Finally, we compare the roots of circular consecutive-2-out-of-n:F systems (37) against the ones of linear consecutive-2-out-of-n:F systems (obtained in [41]):
p n , r L = 1 + 1 4 cos 2 r π n + 2 1 = 1 + 1 2 cos 2 r π n + 2 + 1 , r = 1 , 2 , , n + 1 2 , r n + 2 3 .
We present in Figure 3 the roots of the reliability polynomials of consecutive-2-out-of-n systems, when n = 2 , 3 , , 40 for both cases: linear systems (a) and circular systems (b).
It can be noticed that, as n increases, the interval between the minimum and the maximum root is growing faster for circular systems than for linear systems. Another remark is that the sequence of intervals can be split into three monotone subsequences: for n = 3 t , n = 3 t + 1 , and n = 3 t + 2 (see Figure 4).
Let us calculate the maximum and the minimum value of p n , k L and p n , k C , for every n 2 . The extreme values in (38) are attained when the denominator of the fraction is as close at possible (but not equal) to 0. Hence, for every n 5 , the maximum value is obtained for r = n + 1 3 , while the minimum value occurs for r = n + 5 3 :
1 + 1 2 cos 2 n + 5 3 π n + 2 + 1 p n , r L 1 + 1 2 cos 2 n + 1 3 π n + 2 + 1 .
Using the same reasoning for circular consecutive-2-out-of-n:F systems (with the remark that in (37) the denominator never vanishes), we find that the maximum root is obtained for r = 2 n 3 6 , while the minimum one occurs for r = 2 n + 3 6 , for any n 6 :
1 + 1 2 cos 2 2 n + 3 6 + 1 π n + 1 p n , r C 1 + 1 2 cos 2 2 n 3 6 + 1 π n + 1 .

5. Conclusions

This paper has investigated the roots of the reliability polynomials of circular consecutive-k-out-of-n:F systems, showing the similarities and the differences between circular and linear consecutive systems (studied in [41]). Using the Beraha–Kahane–Weiss theorem, we have proved that the roots of circular consecutive-k-out-of-n:F systems are unbounded, for any k 2 .
In the particular case when k = 2 , the reliability polynomials of linear and of circular consecutive-2-out-of-n:F systems are shown to be related to the Jacobsthal and Jacobsthal–Lucas polynomials, respectively. Thus, the relation between the two families of polynomials is revealed to be the same as the relation between Fibonacci and Lucas polynomials: both sequences of polynomials have the same recurrence relation, but different initial values.
Using the explicit expression deduced from the recurrence formula, we have shown that the roots of of circular consecutive-2-out-of-n:F systems share the same properties as the roots of linear consecutive-2-out-of-n:F systems, namely, that for every n 2 , all the nonzero roots are distinct, real numbers contained into the union of intervals ( , 0 ] 4 3 , .
Moreover, the set of all the roots of circular consecutive-2-out-of-n:F systems is a subset of the set of roots of the linear consecutive systems, and both sets are dense in the union of intervals above. However, the roots of circular systems exhibit a faster spreading along the real axis than the roots of linear consecutive-2-out-of-n:F systems.

Author Contributions

Conceptualization, M.J. and L.D.; methodology, L.D. and V.B.; software, V.-F.D. and V.B.; validation, V.-F.D. and V.B.; writing—original draft preparation, M.J.; writing—review and editing, M.J., L.D., V.-F.D. and V.B.; project administration, V.B.; funding acquisition, V.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partly funded by a grant of the Romanian Ministry of Education and Research, CNCS-UEFISCDI, project no. PN-III-P4-ID-PCE-2020-2495, within PNCDI III (ThUNDER2 = Techniques for Unconventional Nano-Designing in the Energy-Reliability Realm).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kontoleon, J.M. Reliability determination of a r-succesive-out-of-n:F system. IEEE Trans. Reliab. 1980, R-29, 437. [Google Scholar] [CrossRef]
  2. Chiang, D.T.; Niu, S. Reliability of consecutive-k-out-of-n:F system. IEEE Trans. Reliab. 1981, R-30, 87–89. [Google Scholar] [CrossRef]
  3. Derman, C.; Lieberman, G.J.; Ross, S.M. On the consecutive-k-out-of-n:F system. IEEE Trans. Reliab. 1982, R-31, 57–63. [Google Scholar] [CrossRef]
  4. Chang, G.J.; Cui, L.; Hwang, F.K. Reliabilities of Consecutive-k Systems; Springer: New York, NY, USA, 2000. [Google Scholar]
  5. Kuo, W.; Zuo, M.J. Optimal Reliability Modeling: Principles and Applications; John Wiley & Sons: Hoboken, NJ, USA, 2003. [Google Scholar]
  6. Chao, M.T.; Fu, J.C.; Koutras, M.V. Survey of reliability studies of consecutive-k-out-of-n:F & related systems. IEEE Trans. Reliab. 1995, 44, 120–127. [Google Scholar]
  7. Triantafyllou, I.S.; Koutras, M.K. Reliability properties of (n,f,k) systems. IEEE Trans. Reliab. 2014, 63, 357–366. [Google Scholar] [CrossRef]
  8. Beiu, V.; Dăuş, L. Reliability bounds for two dimensional consecutive systems. Nano Comm. Netw. 2015, 6, 145–152. [Google Scholar] [CrossRef]
  9. Dăuş, L.; Beiu, V. Lower and upper reliability bounds for consecutive-k-out-of-n:F systems. IEEE Trans. Reliab. 2015, 64, 1128–1135. [Google Scholar] [CrossRef]
  10. Mohammadi, F.; Sáenz-de-Cabezón, E.; Wynn, H.P. Efficient multicut enumeration of k-out-of-n:F and consecutive k-out-of-n:F systems. Pattern Recog. Lett. 2018, 102, 82–88. [Google Scholar] [CrossRef]
  11. Dafnis, S.D.; Makri, F.S.; Philippou, A.N. The reliability of a generalized consecutive system. Appl. Math. Comput. 2019, 359, 186–193. [Google Scholar] [CrossRef]
  12. Radwan, T. New bounds for all types of multi-state consecutive k-out-of-r-from-n: F system reliability. IEEE Access 2019, 7, 172562–172570. [Google Scholar] [CrossRef]
  13. Drăgoi, V.F.; Cowel, S.R.; Beiu, V. Tight Bounds on the coefficients of consecutive k-out-of-n:F systems. In Intelligent Methods in Computing, Communications and Control, Proceedings of the International Conference Computers Communications and Control (ICCCC 2020), Oradea, Romania, 11–15 May 2020; Springer: Cham, Switzerland, 2021; pp. 35–44. [Google Scholar]
  14. Triantafyllou, I.S. On the consecutive k1 and k2-out-of-n reliability systems. Mathematics 2020, 8, 630. [Google Scholar] [CrossRef]
  15. Xiao, H.; Zhang, Y.; Xiang, Y.; Peng, R. Optimal design of a linear sliding window system with consideration of performance sharing. Reliab. Eng. Sys. Saf. 2020, 198, 106900. [Google Scholar] [CrossRef]
  16. Eryilmaz, S. Age-based preventive maintenance for coherent systems with applications to consecutive-k-out-of-n and related systems. Reliab. Eng. Sys. Saf. 2020, 204, 107143. [Google Scholar] [CrossRef]
  17. Zhao, F.; Peng, R.; Zhang, N. Inspection policy optimization for a k-out-of-n/Cl(k′,n′;F) system considering failure dependence: A case study. Reliab. Eng. Sys. Saf. 2023, 237, 109331. [Google Scholar] [CrossRef]
  18. Beiu, A.C.; Beiu, R.M.; Beiu, V. Optimal design of linear consecutive systems. In Proceedings of the ACM International Conference Nanoscale Computing and Communication NANOCOM 2022, Barcelona, Spain, 5–7 October 2022; p. 24. [Google Scholar]
  19. Philippou, A.N. Distributions and Fibonacci polynomials of order k, longest runs and reliability of consecutive-k-out-of-n:F systems. In Fibonacci Numbers and Their Applications; Philippou, A.N., Bergum, G.E., Horadam, A.F., Eds.; Reidel: Dordrecht, The Netherlands, 1986; pp. 203–227. [Google Scholar]
  20. Hoggatt, V.E.; Bicknell, M. Generalized Fibonacci polynomials. Fibonacci Q. 1973, 11, 457–465. [Google Scholar]
  21. Charalambides, C.A. Lucas numbers and polynomials of order k and the length of the longest circular success run. Fibonacci Q. 1991, 29, 290–297. [Google Scholar]
  22. Brown, J.I.; Colbourn, C.J. Roots of the reliability polynomial. SIAM J. Discr. Math. 1992, 5, 571–585. [Google Scholar] [CrossRef]
  23. Brown, J.I.; Colbourn, C.J.; Cox, D.; Graves, C.; Mol, L. Network reliability: Heading out on the highway. Networks 2021, 77, 146–160. [Google Scholar] [CrossRef]
  24. Comtet, L. Advanced Combinatorics; Reidel: Dordrecht, The Netherlands; Boston, MA, USA, 1974. [Google Scholar]
  25. Brenti, F.; Royle, G.F.; Wagner, D.G. Location of zeros of chromatic and related polynomials of graphs. Canad. J. Math. 1994, 46, 55–80. [Google Scholar] [CrossRef]
  26. Brown, J.I.; Mol, L. On the roots of all-terminal reliability polynomials. Discr. Math. 2017, 340, 1287–1299. [Google Scholar] [CrossRef]
  27. DeGagné, C.D.C. Network Reliability, Simplicial Complexes, and Polynomial Roots. Ph.D. Thesis, Dalhousie University, Halifax, NS, Canada, 2020. [Google Scholar]
  28. Brown, J.I.; DeGagné, C.D.C. Roots of two-terminal reliability polynomials. Networks 2021, 78, 153–163. [Google Scholar] [CrossRef]
  29. Dăuş, L.; Drăgoi, V.F.; Jianu, M.; Bucerzan, D.; Beiu, V. On the roots of certain reliability polynomials. In Intelligent Methods in Computing, Communications and Control, Proceedings of the International Conference Computers Communications and Control (ICCCC 2022), Oradea, Romania, 16–20 May 2022; Springer: Cham, Switzerland, 2023; pp. 401–414. [Google Scholar]
  30. Jianu, M. On the roots of a family of polynomials. Fractal Fract. 2023, 7, 339. [Google Scholar] [CrossRef]
  31. Jackson, B. A zero-free interval for chromatic polynomials of graphs. Comb. Probab. Comput. 1993, 2, 325–336. [Google Scholar] [CrossRef]
  32. Thomassen, C. The zero-free intervals for chromatic polynomials of graphs. Comb. Probab. Comput. 1997, 6, 497–506. [Google Scholar] [CrossRef]
  33. Cameron, P.J.; Morgan, K. Algebraic properties of chromatic roots. Electron. J. Comb. 2017, 24, 1–21. [Google Scholar] [CrossRef]
  34. Sokal, A.D. Chromatic roots are dense in the whole complex plane. Comb. Probab. Comput. 2004, 13, 221–261. [Google Scholar] [CrossRef]
  35. Brown, J.I.; Wagner, D.G. On the imaginary parts of chromatic roots. J. Graph. Theor. 2020, 93, 299–311. [Google Scholar] [CrossRef]
  36. Gutman, I.; Harary, F. Generalizations of the matching polynomial. Util. Math. 1983, 24, 97–106. [Google Scholar]
  37. Brown, J.I.; Hickman, C.A.; Nowakowski, R.J. On the location of roots of independence polynomials. J. Algebr. Comb. 2004, 19, 273–282. [Google Scholar] [CrossRef]
  38. Brown, J.I.; Cameron, B. A note on purely imaginary independence roots. Discr. Math. 2020, 343, 112113. [Google Scholar] [CrossRef]
  39. Brown, J.I.; Cameron, B. Maximum modulus of independence roots of graphs and trees. Graph. Combinator. 2020, 36, 877–894. [Google Scholar] [CrossRef]
  40. Beraha, S.; Kahane, J.; Weiss, N.J. Limits of zeroes of recursively defined families of polynomials. In Studies in Foundations and Combinatorics; Rota, G.C., Ed.; Academic Press: New York, NY, USA, 1978; pp. 213–232. [Google Scholar]
  41. Jianu, M.; Dăuş, L.; Drăgoi, V.F.; Beiu, V. Reliability polynomials of consecutive-k-out-of-n:F systems have unbounded roots. Networks 2023, 82, 222–228. [Google Scholar] [CrossRef]
  42. Du, D.Z.; Hwang, F.K. A direct algorithm for computing reliability of a consecutive-k cycle. IEEE Trans. Reliab. 1988, R-37, 70–72. [Google Scholar] [CrossRef]
  43. Hoggatt, V.E.; Bicknell-Johnson, M. Convolution arrays for Jacobsthal and Fibonacci polynomials. Fibonacci Q. 1978, 16, 385–402. [Google Scholar]
  44. Koshy, T. Fibonacci and Lucas Numbers with Applications; John Wiley & Sons: Hoboken, NJ, USA, 2019. [Google Scholar]
  45. Tereszkiewicz, A.; Wawreniuk, I. Generalized Jacobsthal polynomials and special points for them. Appl. Math. Comput. 2015, 268, 806–814. [Google Scholar] [CrossRef]
Figure 1. Linear consecutive-2-out-of-8:F system: (a) the nodes are operational with probability p; (b) two non-consecutive nodes (3 and 5) have failed, the system works; (c) two consecutive nodes (3 and 4) have failed, the system fails.
Figure 1. Linear consecutive-2-out-of-8:F system: (a) the nodes are operational with probability p; (b) two non-consecutive nodes (3 and 5) have failed, the system works; (c) two consecutive nodes (3 and 4) have failed, the system fails.
Mathematics 11 04252 g001
Figure 2. Circular consecutive-2-out-of-8:F system: (a) the nodes are operational with probability p; (b) two non-consecutive nodes (3 and 5) have failed, the system works; (c) two consecutive nodes (3 and 4) have failed, the system fails.
Figure 2. Circular consecutive-2-out-of-8:F system: (a) the nodes are operational with probability p; (b) two non-consecutive nodes (3 and 5) have failed, the system works; (c) two consecutive nodes (3 and 4) have failed, the system fails.
Mathematics 11 04252 g002
Figure 3. (a) The roots of the linear consecutive 2-out-of-n systems; (b) the roots of the circular consecutive 2-out-of-n systems; n = 2 , 3 , , 40 .
Figure 3. (a) The roots of the linear consecutive 2-out-of-n systems; (b) the roots of the circular consecutive 2-out-of-n systems; n = 2 , 3 , , 40 .
Mathematics 11 04252 g003
Figure 4. The roots for n in the range 3 , , 40 as blue circles (maxima as red squares, and minima as cyan squares) for linear consecutive-2-out-of-n:F systems: (a) n = 3 t , (b) n = 3 t + 1 , (c) n = 3 t + 2 ; for circular consecutive-2-out-of-n:F systems: (d) n = 3 t , (e) n = 3 t + 1 ; (f) n = 3 t + 2 .
Figure 4. The roots for n in the range 3 , , 40 as blue circles (maxima as red squares, and minima as cyan squares) for linear consecutive-2-out-of-n:F systems: (a) n = 3 t , (b) n = 3 t + 1 , (c) n = 3 t + 2 ; for circular consecutive-2-out-of-n:F systems: (d) n = 3 t , (e) n = 3 t + 1 ; (f) n = 3 t + 2 .
Mathematics 11 04252 g004
Table 1. Fibonacci and Jacobsthal polynomials.
Table 1. Fibonacci and Jacobsthal polynomials.
Fibonacci PolynomialsJacobsthal Polynomials
F n + 2 ( z ) = z F n + 1 ( z ) + F n ( z ) J n + 2 ( z ) = J n + 1 ( z ) + z J n ( z )
n = 0 F 0 ( z ) = 0 J 0 ( z ) = 0
n = 1 F 1 ( z ) = 1 J 1 ( z ) = 1
n = 2 F 2 ( z ) = z J 2 ( z ) = 1 = L 0 ( z )
n = 3 F 3 ( z ) = z 2 + 1 J 3 ( z ) = 1 + z = L 1 ( z )
n = 4 F 4 ( z ) = z 3 + 2 z J 4 ( z ) = 1 + 2 z = L 2 ( z )
n = 5 F 5 ( z ) = z 4 + 3 z 2 + 1 J 5 ( z ) = 1 + 3 z + z 2 = L 3 ( z )
n = 6 F 6 ( z ) = z 5 + 4 z 3 + 3 z J 6 ( z ) = 1 + 4 z + 3 z 2 = L 4 ( z )
n = 7 F 7 ( z ) = z 6 + 5 z 4 + 6 z 2 + 1 J 7 ( z ) = 1 + 5 z + 6 z 2 + z 3 = L 5 ( z )
n = 8 F 8 ( z ) = z 7 + 6 z 5 + 10 z 3 + 4 z J 8 ( z ) = 1 + 6 z + 10 z 2 + 4 z 3 = L 6 ( z )
Table 2. Lucas and Jacobsthal–Lucas polynomials.
Table 2. Lucas and Jacobsthal–Lucas polynomials.
Lucas PolynomialsJacobsthal–Lucas Polynomials
L n + 2 ( z ) = z L n + 1 ( z ) + L n ( z ) j n + 2 ( z ) = j n + 1 ( z ) + z j n ( z )
n = 0 L 0 ( z ) = 2 j 0 ( z ) = 2
n = 1 L 1 ( z ) = z j 1 ( z ) = 1
n = 2 L 2 ( z ) = z 2 + 2 j 2 ( z ) = 1 + 2 z = C 2 ( z )
n = 3 L 3 ( z ) = z 3 + 3 z j 3 ( z ) = 1 + 3 z = C 3 ( z )
n = 4 L 4 ( z ) = z 4 + 4 z 2 + 2 j 4 ( z ) = 1 + 4 z + 2 z 2 = C 4 ( z )
n = 5 L 5 ( z ) = z 5 + 5 z 3 + 5 z j 5 ( z ) = 1 + 5 z + 5 z 2 = C 5 ( z )
n = 6 L 6 ( z ) = z 6 + 6 z 4 + 9 z 2 + 2 j 6 ( z ) = 1 + 6 z + 9 z 2 + 2 z 3 = C 6 ( z )
n = 7 L 7 ( z ) = z 7 + 7 z 5 + 14 z 3 + 7 z j 7 ( z ) = 1 + 7 z + 14 z 2 + 7 z 3 = C 7 ( z )
n = 8 L 8 ( z ) = z 8 + 8 z 6 + 20 z 4 + 16 z 2 + 2 j 8 ( z ) = 1 + 8 z + 20 z 2 + 16 z 3 + 2 z 4 = C 8 ( z )
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Jianu, M.; Dăuş, L.; Drăgoi, V.-F.; Beiu, V. The Roots of the Reliability Polynomials of Circular Consecutive-k-out-of-n:F Systems. Mathematics 2023, 11, 4252. https://doi.org/10.3390/math11204252

AMA Style

Jianu M, Dăuş L, Drăgoi V-F, Beiu V. The Roots of the Reliability Polynomials of Circular Consecutive-k-out-of-n:F Systems. Mathematics. 2023; 11(20):4252. https://doi.org/10.3390/math11204252

Chicago/Turabian Style

Jianu, Marilena, Leonard Dăuş, Vlad-Florin Drăgoi, and Valeriu Beiu. 2023. "The Roots of the Reliability Polynomials of Circular Consecutive-k-out-of-n:F Systems" Mathematics 11, no. 20: 4252. https://doi.org/10.3390/math11204252

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop