Related papers: A note on the fast power series' exponential

We show that the generating function $\sum_{n\ge0}M_n\,z^n$ for Motzkin numbers $M_n$, when coefficients are reduced modulo a given power of $2$, can be expressed as a polynomial in the basic series $\sum _{e\ge0} ^{} {z^{4^e}}/(…

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

I present and discuss an extremely simple algorithm for expanding a formal power series as a continued fraction. This algorithm, which goes back to Euler (1746) and Viscovatov (1805), deserves to be better known. I also discuss the…

The first part of this note is a short introduction on continued fraction expansions for certain algebraic power series. In the last part, as an illustration, we present a family of algebraic continued fractions of degree 4, including a toy…

Given a formal power series f(z) we define, for any positive integer r, its rth Witt transform, W_f^{(r)}, by rW_f^{(r)}(z)=sum_{d|r}mu(d)f(z^d)^{r/d}, where mu is the Moebius function. The Witt transform generalizes the necklace…

Let $L$ be the $n$-th order linear differential operator $Ly = \phi_0y^{(n)} + \phi_1y^{(n-1)} + \cdots + \phi_ny$ with variable coefficients. A representation is given for $n$ linearly independent solutions of $Ly=\lambda r y$ as power…

Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\"o}nhage and Strassen designed an algorithm that improved the multiplication time for…

The computational complexity of the self-attention mechanism in popular transformer architectures poses significant challenges for training and inference, and becomes the bottleneck for long inputs. Is it possible to significantly reduce…

This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…

The approximate computation of all gravitational forces between $N$ interacting particles via the fast multipole method (FMM) can be made as accurate as direct summation, but requires less than $\mathcal{O}(N)$ operations. FMM groups…

Solutions of nonlinear functional equations are generally not expressed as a finite number of combinations and compositions of elementary and known special functions. One of the approaches to study them is, firstly, to find formal solutions…

The author derives new family of series representations for the values of the Riemann Zeta function $\zeta(s)$ at positive odd integers. For $n\in\mathbb{N}$, each of these series representing $\zeta(2n+1)$ converges remarkably rapidly with…

For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,\ldots,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for…

In this paper, a Fourier series in fractional dimensional space is introduced for an arbitrarily periodic function $f(t;\alpha)$. We call it fractional Fourier series of the order $\alpha$. Extending the basis functions of the linear space…

Fix m >= 1 and let E be an elliptic curve over Q with complex multiplication. We formulate conjectures on the density of primes p (congruent to one modulo m) for which the pth Fourier coefficient of E is an mth power modulo p; often these…

In this paper we derive an almost explicit analytic formula for asymptotic eigenenergy expansion of arbitrary odd degree polynomial potentials of the form $V(x)=(ix)^{2N+1}+\beta _{1}x^{2N}+\beta _{2}x^{2N-1}+\cdot \cdot \cdot \cdot \cdot…

Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…

Hittmeir recently presented a deterministic algorithm that provably computes the prime factorisation of a positive integer $N$ in $N^{2/9+o(1)}$ bit operations. Prior to this breakthrough, the best known complexity bound for this problem…

We discuss and illustrate the behaviour of the continued fraction expansion of a formal power series under specialisation of parameters or their reduction modulo $p$ and sketch some applications of the reduction theorem here proved.

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…