We derive a simple error estimate for equally spaced, polynomial interpolation of power series that does not require the uniform bounds on derivatives of the Cauchy remainder. The key steps are expressing Newton coefficients in terms of Stirling numbers S(i, j) of the second kind and applying the concavity of lnS(i, j).

Let K be an effective field of characteristic zero. An effective tribe is a subset of K[[z1, z2, ...]] =K ∪K[[z1]] ∪K[[z1, z2]] ∪ ··· which is effectively stable under the Kalgebra operations, restricted division, composition, the implicit function theorem, as well as restricted monomial transformations with arbitrary rational exponents. Given an effective tribe with an effective zero test, we ...

A new class of distributions motivated by systems having both series and parallel structures is introduced. Some mathematical properties the (including moment generating function, moments order statistics) are derived. Estimation addressed maximum likelihood method performance estimators assessed a simulation study. An illustration using three failure data sets shows usefulness class.

The division algorithm for ideals of algebraic power series satisfying Hironaka’s box condition is shown to be finite when expressed suitably in terms of the defining polynomial codes of the series.

Data streams are an ideal vehicle for handling power series. Stream implementations can be read off directly from simple recursive equations that define operations such as multiplication, substitution, exponentiation, and reversion of series. The bookkeeping that bedevils these algorithms when they are expressed in traditional languages is completely hidden when they are expressed in stream ter...

The division algorithm for ideals of algebraic power series satisfying Hironaka’s box condition is shown to be finite when expressed suitably in terms of the defining polynomial codes of the series. In particular, the codes of the reduced standard basis of the ideal can be constructed effectively.

We study D0L power series. We show how elementary morphisms introduced by Ehrenfeucht and Rozenberg can be used in connection with power series, characterize the sequences of rational numbers and integers which can be appear as coe cients in D0L power series and establish various decidability results. TUCS Research Group Mathematical Structures of Computer Science

Iteration semirings are Conway semirings satisfying Conway’s group identities. We show that the semirings Nrat〈〈Σ∗〉〉 of rational power series with coefficients in the semiring N of natural numbers are the free partial iteration semirings. Moreover, we characterize the semirings Nrat ∞ 〈〈Σ∗〉〉 as the free semirings in the variety of iteration semirings defined by three additional simple identitie...

The set S[[x]] of formal power series in x over a set S is the set of functions from the nonnegative integers to S. However, the way that we represent elements of S[[x]] will be as an infinite series, and operations in S[[x]] will be closely linked to the addition and multiplication of finite-degree polynomials. This paper will introduce a bit of the structure of sets of formal power series and...