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

Starting from the representation of a function $f(x,y)$ as a formal power series with Taylor coefficients $f_{m,n}$, we establish a formal series for the implicit function $y=y(x)$ such that $f(x,y)=0$ and the coefficients of the series for…

Factorial series played a major role in Stirling's classic book "Methodus Differentialis" (1730), but now only a few specialists still use them. This article wants to show that this neglect is unjustified, and that factorial series are…

Motivated by UV realisations of Starobinsky-like inflation models, we study generic exponential plateau-like potentials to understand whether an exact $f(R)$-formulation may still be obtained when the asymptotic shift-symmetry of the…

Two distinct systems of commutative complex numbers in n dimensions are described, of polar and planar types. Exponential forms of n-complex numbers are given in each case, which depend on geometric variables. Azimuthal angles, which are…

Permutations can be represented as linear combinations of natural numbers with different powers. In this paper, its coefficient matrix and inverse matrix is derived, and the results show the coefficient matrix is a lower triangular matrix…

We show that assuming the availability of the processor with variable precision arithmetic, we can compute matrix-by-matrix multiplications in $O(N^2log_2N)$ computational complexity. We replace the standard matrix-by-matrix multiplications…

Suppose that the moduli of the coefficients of a power series are 1/n!, while the arguments are arbitrary. If an entire function f represented by such power series decreases exponentially on some ray, then it has to be an exponential. If…

General guidelines for a new fast computation of blocklength 8m+4 DFTs are presented, which is based on a Laurent series involving matrices. Results of non-trivial real multiplicative complexity are presented for blocklengths N=64,…

Like many other physical quantities, the optical force can be expanded using multipole expansion, which has been done in [Nat. Photon. 5, 531], up to electric octupole order. However, in that study, the existence of radiation multipoles…

Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…

We give an $O(N\cdot \log N\cdot 2^{O(\log^*N)})$ algorithm for multiplying two $N$-bit integers that improves the $O(N\cdot \log N\cdot \log\log N)$ algorithm by Sch\"{o}nhage-Strassen. Both these algorithms use modular arithmetic.…

We present the Fast Newton Transform (FNT), an algorithm for performing $m$-variate Newton interpolation in downward closed polynomial spaces with time complexity $\mathcal{O}(|A|m\overline{n})$. Here, $A$ is a downward closed set of…

This paper aims to show that by making use of Ramanujan's Master Theorem and the properties of the lower incomplete gamma function, it is possible to construct a finite Mellin transform for the function $f(x)$ that has infinite series…

This paper deals with circulant matrices. It is shown that a circulant matrix can be multiplied by a vector in time O(n log(n)) in a ring with roots of unity without making use of an FFT algorithm. With our algorithm we achieve a speedup of…

For real power series whose non-zero coefficients satisfy $|a_m|^{1/m}\to~1$ we prove a stronger version of Fabry theorem relating the frequency of sign changes in the coefficients and analytic continuation of the sum of the power series.

At sufficiently high energies the production of a very large number of particles is kinematically allowed. However, it is well-known that already in the simplest case of a weakly-coupled massive $\lambda \varphi^4$ theory, $n$-particle…

Let $F=(F_1, F_2, ... F_n)$ be an $n$-tuple of formal power series in $n$ variables of the form $F(z)=z+ O(|z|^2)$. It is known that there exists a unique formal differential operator $A=\sum_{i=1}^n a_i(z)\frac {\p}{\p z_i}$ such that…

The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of $P:=\mathbf{F}[x_n,...,x_1]$, a polyonomial ring over the finite field $\mathbf{F}:=\mathbf{Z}_q$ of $q$…

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…

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…