Related papers: A simple algorithm for expanding a power series as…
We show that two notions of continued fraction normality, one where overlapping occurrences of finite patterns are counted as distinct occurrences, and another where only disjoint occurrences are counted as distinct, are identical. This…
In this paper we present a family of continued fraction expansions for $e^n$, with $n\ge 1$, with a simple expression having partial denominators given by arithmetic progressions. We give an estimate for the convergence speed showing that…
We prove a continued fraction expansion for the reciprocal of a certain $q$-series. All the specialists in the world are asked whether it is new or not.
An Engel series is a sum of reciprocals $\sum_{j\geq 1} 1/x_j$ of a non-decreasing sequence of positive integers $x_n$ with the property that $x_n$ divides $x_{n+1}$ for all $n\geq 1$. In previous work, we have shown that for any Engel…
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…
We introduce a new, large class of continued fraction algorithms producing what are called contracted Farey expansions. These algorithms are defined by coupling two acceleration techniques -- induced transformations and contraction -- in…
We give a proof of Fourier extension conjecture on the paraboloid in all dimensions bigger than 2 that begins with a decomposition suggested in Sawyer [Saw8] of writing a smooth Alpert projection as a sum of pieces whose Fourier extensions…
Our aim is to find a complex continued fraction algorithm finding all the best Diophantine approximations to a complex number. Using the sequence of minimal vectors in a two dimensional lattice over Gaussian integers, we obtain an algorithm…
Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…
The Ramanujan Machine project predicts new continued fraction representations of numbers expressed by important mathematical constants. Generally, the value of a continued fraction is found by reducing it to a second order linear difference…
This paper was motivated by a conjecture of Br\"{a}nd\'{e}n (European J. Combin. \textbf{29} (2008), no.~2, 514--531) about the divisibility of the coefficients in an expansion of generalized Eulerian polynomials, which implies the…
We study a continued fraction due to Ramanujan, that he recorded as Entry 12 in Chapter 16 of his second notebook. It is presented in Part III of Berndt's volumes on Ramanujan's notebooks. We give two alternate approaches to proving…
Repeatedly folding a strip of paper in half and unfolding it in straight angles produces a fractal: the dragon curve. Shallit, van der Poorten and others showed that the sequence of right and left turns relates to a continued fraction that…
This article studies the rearrangement problem for Fourier series introduced by P.L. Ulyanov, who conjectured that every continuous function on the torus admits a rearrangement of its Fourier coefficients such that the rearranged partial…
D. Hensley showed in 1994 that the number of steps taken by the Euclidean algorithm to find the greatest common divisor of two natural numbers less than or equal to n follows a normal distribution in the limit as n tends to infinity. V.…
We discuss continued fractions on real quadratic number fields of class number 1. If the field has the property of being 2-stage euclidean, a generalization of the euclidean algorithm can be used to compute these continued fractions.…
In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. We extend its application to the case of formal power series over a field of arbitrary characteristic and illustrate the proposed approach…
Using the theorem of residues Chiarella and Reichel derived a series that can be represented in terms of the complex error function (CEF). Here we show a simple derivation of this CEF series by Fourier expansion of the exponential function…
In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a…
Motivated by the recent work of Park on the analogue of the Ramanujan's function $k(\tau)=r(\tau)r^2(2\tau)$ for the Ramanujan's cubic continued fraction, where $r(\tau)$ is the Rogers-Ramanujan continued fraction, we use the methods of Lee…