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

This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…

We develop a class of integrals on a manifold M called exponential iterated integrals, an extension of K. T. Chen's iterated integrals. It is shown that the matrix entries of any upper triangular representation of the fundamental group of M…

Let $F$ be an entire function of exponential type represented by the Taylor series \[ F(z) = \sum_{n\ge 0} \omega_n \frac{z^n}{n!} \] with unimodular coefficients $|\omega_n|=1$. We show that either the counting function $n_F(r)$ of zeroes…

We show an explicit formula, with a quite easy deduction, for the exponential matrix $e^{tA}$ of a real square matrix $A$ of order $n\times n$. The elementary method developed requires neither Jordan canonical form, nor eigenvectors, nor…

A New Number Theoretic Transform(NTT), which is a form of FFT, is introduced, that is faster than FFTs. Also, a multiplication algorithm is introduced that uses this to perform integer multiplication faster than O(n log n). It uses…

The algebraic properties of formal power series, whose coefficients show factorial growth and admit a certain well-behaved asymptotic expansion, are discussed. It is shown that these series form a subring of $\mathbb{R}[[x]]$. This subring…

We present a new algorithm to rapidly and optimally compute power spectra. This new algorithm is based on a generalization of iterative multigrid, and has computational cost O(N log N), compared to the standard brute force approach which…

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…

The problem is to evaluate a polynomial in several variables and its gradient at a power series truncated to some finite degree with multiple double precision arithmetic. To compensate for the cost overhead of multiple double precision and…

The $\beta\gamma$ system is generalized by complex(rational) powers of the fields, which leads to a corresponding extension on the Fock space. Two different approaches to compute the Green functions of the physical operators are proposed.…

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…

This paper proposes a class of power-of-two FFT (Fast Fourier Transform) algorithms, called AM-QFT algorithms, that contains the improved QFT (Quick Fourier Transform), an algorithm recently published, as a special case. The main idea is to…

In the past, empirical evidence has been presented that Hilbert series of symplectic quotients of unitary representations obey a certain universal system of infinitely many constraints. Formal series with this property have been called…

The integer complexity $f(n)$ of a positive integer $n$ is defined as the minimum number of 1's needed to represent $n$, using additions, multiplications and parentheses. We present two simple and faster algorithms for computing the integer…

The present paper proves that if for a power sum $\alpha$ over $\ZZ$ the length of the period of the continued fraction for $\sqrt{\alpha(n)}$ is constant for infinitely many even (resp. odd) $n$, then $\sqrt{\alpha(n)}$ admits a functional…

We propose an efficient algorithm for the evaluation of the potential and its gradient of gravitational/electrostatic $N$-body systems, which we call particle mesh multipole method (PMMM or PM$^3$). PMMM can be understood both as an…

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…

An FI- or an OI-module $\mathbf{M}$ over a corresponding noetherian polynomial algebra $\mathbf{P}$ may be thought of as a sequence of compatible modules $\mathbf{M}_n$ over a polynomial ring $\mathbf{P}_n$ whose number of variables depends…