Related papers: Series misdemeanors
It is described how the Hermite-Pad\'e polynomials corresponding to an algebraic approximant for a power series may be used to predict coefficients of the power series that have not been used to compute the Hermite-Pad\'e polynomials. A…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
Given a power series in finitely many variables that is algebraic over the corresponding polynomial ring over a subfield of the reals, we show that its convergence domain is semialgebraic over the real closure of the subfield. This gives in…
In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…
This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
Convergence problems occur abundantly in all branches of mathematics or in the mathematical treatment of the sciences. Sequence transformations are principal tools to overcome convergence problems of the kind. They accomplish this by…
This is an anthology of series involving rational, factorial, and power functions expressed in terms of special functions. New finite expansions involving quotient functions expressed in terms of the Hurwitz-Lerch zeta function are given.…
Periods are defined as integrals of semialgebraic functions defined over the rationals. Periods form a countable ring not much is known about. Examples are given by taking the antiderivative of a power series which is algebraic over the…
I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…
Transcendental functions, such as exponentials and logarithms, appear in a broad array of computational domains: from simulations in curvilinear coordinates, to interpolation, to machine learning. Unfortunately they are typically expensive…
A further significant extension is presented of the infinitely large class of differential algebras of generalized functions which are the basic structures in the nonlinear algebraic theory listed under 46F30 in the AMS Mathematical Subject…
We offer new Tauberian theorems for a generalized partition function as our main result. Our analysis provides insight into asymptotic behavior of power series with arithmetic functions as coefficients.
An abstract theory of Fourier series in locally convex topological vector spaces is developed. An analog of Fej\'{e}r's theorem is proved for these series. The theory is applied to distributional solutions of Cauchy-Riemann equations to…
A general integral expression to transform power series is applied to $\arcsin{x}$ and its positive integer powers. We concentrate on the first to the fourth powers and obtain infinite classes of new power series involving central binomial…
A molecule is a nonzero non-unit element of an integral domain (resp., commutative cancellative monoid) having a unique factorization into irreducibles (resp., atoms). Here we study the molecules of Puiseux monoids as well as the molecules…
Fully automatic worst-case complexity analysis has a number of applications in computer-assisted program manipulation. A classical and powerful approach to complexity analysis consists in formally deriving, from the program syntax, a set of…
We develop a toolbox for the error analysis of linear recurrences with constant or polynomial coefficients, based on generating series, Cauchy's method of majorants, and simple results from analytic combinatorics. We illustrate the power of…
Linear recurrence equations with constant coefficients define the power series coefficients of rational functions. However, one usually prefers to have an explicit formula for the sequence of coefficients, provided that such a formula is…