Related papers: A simple algorithm for expanding a power series as…
The goal of this survey paper is to present, in chronological order, certain research works on continued fractions in power series fields over a finite field, all of them being derivated from some examples introduced thirty years ago by…
We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…
The focus of this paper is on formal power series analogs of the golden ratio. We are interested in both their continued fractions expansions as well as their Laurent series expansions. Our approach studies the Hankel matrices that are…
We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…
We consider a family $\{\tau_m:m\geq 2\}$ of interval maps introduced by Hei-Chi Chan [5] as generalizations of the Gauss transformation. For the continued fraction expansion arising from $\tau_m$, we solve its Gauss-Kuzmin-type problem by…
We transformed the generalized exponential power series to another functional form suitable for further analysis. By applying the Cauchy-Euler differential operator in the form of an exponential operator, the series became a sum of…
Several continued fraction expansions for $e$ have been produced by an automated conjecture generator (ACG) called \emph{The Ramanujan Machine}. Some of these were already known, some have recently been proved and some remain unproven.…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
In this short note we will use the residue theorem to establish a formula for Euler's constant. In particular, we offer a slightly generalized version of an interesting infinite series due to Flajolet, Gourdon, and Dumas.
It is shown that the exponential of a complex power series up to order n can be implemented via (23/12+o(1))M(n) binary arithmetic operations over complex field, where M(n) stands for the (smoothed) complexity of multiplication of…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…
We explain in detail how to accelerate continued fractions (for constants as well as for functions) using the method used by R.~Ap\'ery in his proof of the irrationality of $\zeta(3)$. We show in particular that this can be applied to a…
A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…
We give an algorithm to compute the series expansion for the inverse of a given function. The algorithm is extremely easy to implement and gives the first $N$ terms of the series. We show several examples of its application in calculating…
In this paper we study in detail a family of continued fraction expansions of any number in the unit closed interval $[0,1]$ whose digits are differences of consecutive non-positive integer powers of an integer $m \geq 2$. For the…
Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$…
We consider formal power series $ f(x) = a_1 x + a_2 x^2 + \cdots $ $(a_1 \neq 0)$, with coefficients in a field. We revisit the classical subject of iteration of formal power series, the n-fold composition $f^{(n)}(x)=f(f(\cdots…
This note presents an especially short and direct variant of Hermite's proof of the simple continued fraction expansion e = [2,1,2,1,1,4,1,1,6,...] and explains some of the motivation behind it.
In this paper Euler shows how, if we have recursive functions f,g,h and an infinite sequence A,B,C,... which satisfies fA=gB+hC, f'B=g'C+h'D, f''C=g''D+h''E, f'''D=g'''E+h'''F, etc., where the primes denote an index not a derivative, then…