Although the hammock networks were introduced more than sixty years ago, there is no general formula of the associated reliability polynomial. Using the full Hermite interpolation polynomial, we propose an approximation for the reliability polynomial of a hammock network of arbitrary size. In the second part of the paper, we provide combinatorial formulas for the first two non-zero coefficients of the reliability polynomial.

We study infinitely differentiable functions which are representable into a Newton interpolating series at a suitable interpolation sequence with terms in [0, 1]. Applications of this series to approximate the solution of boundary value problems for linear systems of differential equations are presented.

A rectifying curve is a twisted curve with the property that all of its rectifying planes pass through a fixed point. If this point is the origin of the Cartesian coordinate system, then the position vector of the rectifying curve always lies in the rectifying plane. A remarkable property of these curves is that the ratio between torsion and curvature is a nonconstant linear function of the arc-length parameter. In this paper, we give a new characterization of rectifying curves, namely, we prove that a curve is a rectifying curve if and only if it has a spherical involute. Consequently, rectifying curves can be constructed as evolutes of spherical twisted curves; we present an illustrative example of a rectifying curve obtained as the evolute of a spherical helix. We also express the curvature and the torsion of a rectifying spherical curve and give necessary and sufficient conditions for a curve and its involute to be both rectifying curves.

Fractional Taylor series are studied. Then solutions of fractional linear ordinary differential equations (FODE), with respect to Caputo derivative, are approximated by fractional Taylor series. The Cauchy-Kowalevski theorem is proved to show the existence and uniqueness of local solutions for FODE with Cauchy initial data. Sufficient conditions for the global existence of the solution and the estimate of error are given for the method using fractional Taylor series. Two illustrative numerical examples are given to demonstrate the validity and applicability of this method.

In this paper, we develop a new method for evaluating the reliability polynomial of a hammock network. The method is based on a homogeneous absorbing Markov chain and provides the exact reliability for networks of width less than 5 and arbitrary length. Moreover, it produces a lower bound for the reliability polynomial for networks of width greater than or equal to 5. To investigate how sharp this lower bound is, we compare our method with other approximation methods and it proves to be the most accurate in terms of absolute as well as relative error. Using the fundamental matrix, we also calculate the average time to absorption, which provides the mean length of a network that is expected to work.