Related papers: How to Compute a Puiseux Expansion

We prove an exponential integral estimate for the quadratic partial sums of multiple Fourier series on large sets that implies some new properties of Fourier series.

We propose a novel method for reconstructing Laurent expansion of rational functions using $p$-adic numbers. By evaluating the rational functions in $p$-adic fields rather than finite fields, it is possible to probe the expansion…

This article discusses the usage of a partiton based Fubini calculus for Poisson processes. The approach is an amplification of Bayesian techniques developed in Lo and Weng for gamma/Dirichlet processes. Applications to models are…

We consider the problem of learning high dimensional polynomial transformations of Gaussians. Given samples of the form $p(x)$, where $x\sim N(0, \mathrm{Id}_r)$ is hidden and $p: \mathbb{R}^r \to \mathbb{R}^d$ is a function where every…

This work introduces a new functional series for expanding an analytic function in terms of an arbitrary analytic function. It is generally applicable and straightforward to use. It is also suitable for approximating the behavior of a…

In this article we use a method of finding the index of a complex-valued function by determined number of arithmetic operations to describe an algorithm of localization of roots of square-free polynomials. We give an estimation of the…

For a two-dimensional quantum mechanical problem, we obtain a generalized power-series expansion of the S-matrix that can be done near an arbitrary point on the Riemann surface of the energy, similarly to the standard effective range…

Fast convergent, accurate, computationally efficient, parallelizable, and robust matrix inversion and parameter estimation algorithms are required in many time-critical and accuracy-critical applications such as system identification,…

Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…

For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…

A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…

We give a combinatorial rule for calculating the coefficients in the expansion of a product of two factorial Schur functions. It is a special case of a more general rule which also gives the coefficients in the expansion of a skew factorial…

We consider the effective resummation of a Borel sum by its associated factorial series expansion. Our approach provides concrete estimates for the remainder term when truncating this factorial series. We then generalize a theorem of…

We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…

In the present paper, we deal with Fourier-transformation of Frobenius-Euler polynomials. We shall give its applications by using infinite series. Our applications possess interesting properties which we state in this paper.

The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…

We extend the Newton's method and show the extended Newton's method leads to the binomial expansion of Newton's method that the convergences become the quadratic and linearly. In case of the quadratic convergence, we give the convergence…

We present an iterative method to obtain approximations to Bessel functions of the first kind $J_p(x)$ ($p>-1$) via the repeated application of an integral operator to an initial seed function $f_0(x)$. The class of seed functions $f_0(x)$…

Thw purpose of this paper is to present a systemic study of some families of the generalized q-Euler numbers and polynomials of higher order.

In this paper we develop a symbolic algorithm to calculate multivariate power series expansions of univariate polynomials over general base rings. We use this to give a complete power series algorithm to calculate the dual intersection…