Related papers: How to Compute a Puiseux Expansion
We give an algorithm to compute term by term multivariate Puiseux series expansions of series arising as local parametrizations of zeroes of systems of algebraic equations at singular points. The algorithm is an extension of Newton's method…
In this paper we outline an algorithmic approach to compute Puiseux series expansions for algebraic surfaces. The series expansions originate at the intersection of the surface with as many coordinate planes as the dimension of the surface.…
A polyhedral method to solve a system of polynomial equations exploits its sparse structure via the Newton polytopes of the polynomials. We propose a hybrid symbolic-numeric method to compute a Puiseux series expansion for every space curve…
We explain how to encode an algebraic series by finite data and how to do effective arithmetic on the level of these encodings. The reasoning is based on the Newton-Puiseux algorithm and an effective equality test for algebraic series.…
The goal in this preprint is to give an efficient algorithm to compute Puiseux expansions at cusps of X0(N). It is based on a relation with a hypergeometric function that holds for any N.
A constructive version of Newton-Puiseux theorem for computing the Puiseux expansions of algebraic curves is presented. The proof is based on a classical proof by Abhyankar. Algebraic numbers are evaluated dynamically; hence the base field…
We have designed a new symbolic-numeric strategy to compute efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well chosen prime $p$…
We provide a very effective and explicit algorithm of finding a Puiseux expansion of a cuspidal singularity of a plane curve, when this singularity is given in a parametric form.
When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…
We begin by explaining how to compute Fourier expansions at all cusps of any modular form of integral or half-integral weight thanks to a theorem of Borisov-Gunnells and explicit expansions of Eisenstein series at all cusps. Using this, we…
We develop an iterative method to calculate the roots of arbitrary polynomials over the field of Puiseux series including non-separable ones. The method works by transforming the polynomial and its roots into a special form and then…
Puiseux series are power series in which the exponents can be fractional and/or negative rational numbers. Several computer algebra systems have one or more built-in or loadable functions for computing truncated Puiseux series. Some are…
We consider the extension of the method of Gauss-Newton from complex floating-point arithmetic to the field of truncated power series with complex floating-point coefficients. With linearization we formulate a linear system where the…
In this paper we use a set of partial differential equations to prove an expansion theorem for multiple complex Hermite polynomials. This expansion theorem allows us to develop a systematic and completely new approach to the complex Hermite…
Fractional $q$-extensions of some classical $q$-orthogonal polynomials are introduced and some of the main properties of the new defined functions are given. Next, a fractional $q$-difference equation of Gauss type is introduced and solved…
Puiseux series are power series in which the exponents can be fractional and/or negative rational numbers. Several computer algebra systems have one or more built-in or loadable functions for computing truncated Puiseux series -- perhaps…
I present an algorithm based on sector decomposition and Mellin-Barnes techniques to power expand Feynman integrals. The coefficients of this expansion are given in terms of finite integrals that can be calculated numerically. I show in an…
Adapting the Newton-Puiseux Polygon process to nonlinear q-difference equations of any order and degree, we compute their power series solutions, study the properties of the set of exponents of the solutions and give a bound for their…
It is very fundamental to study irreducible plane curve singularities in algebraic geometry. The contents of the paper consist of three parts, called Part[A], Part[B] and Part[C] with Good Appendix. Our aim is to prove by Part[B] and…
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…