Related papers: Dynamic Newton-Puiseux Theorem
The well-known Newton-Puiseux Theorem states that each real branch of a planar real analytic curve admits a Puiseux expansion. We generalize this result to characteristic orbit of an isolated singularity of a planar real analytic vector…
In this paper, an explanation of the Newton-Peiseux algorithm is given. This explanation is supplemented with well-worked and explained examples of how to use the algorithm to find fractional power series expansions for all branches of a…
Recent results in the theory and application of Newton-Puiseux expansions, i.e. fractional power series solutions of equations, suggest further developments within a more abstract algebraic-geometric framework, involving in particular the…
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.…
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.…
We prove a skew generalization of the Newton-Puiseux theorem for the field $F = \bigcup_{n=1}^\infty \mathbb{C}((x^\frac{1}{n}))$ of Puiseux series: For any positive real number $\alpha$, we consider the $\mathbb{C}$-automorphism $\sigma$…
A relationship between Puiseux series satisfying an ordinary differential equation corresponding to a polynomial dynamical system and degrees of irreducible invariant algebraic curves is studied. A bound on the degrees of irreducible…
It is shown in "SIAM J. Sci. Comput. 39 (2017):B424-B441" that free-form curves used in computer aided geometric design can usually be represented as the solutions of linear differential systems and points and derivatives on the curves can…
We deal with the algebraicity of a Puiseux series in terms of the properties of its coefficients. We show that the algebraicity of a Puiseux series for given bounded degree is determined by a finite number of explicit polynomial formulae.…
We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…
We construct algebraically closed fields containing an algebraic closure of the field of power series in several variables over a characteristic zero field. Each of these fields depends on the choice of an Abhyankar valuation and are…
We propose a conjectural characterization of when the dynamical Galois group associated to a polynomial is abelian, and we prove our conjecture in several cases, including the stable quadratic case over ${\mathbb Q}$. In the postcritically…
A systematic study of non-trivial cubic extensions of the four-dimensional Poincar\'e algebra is undertaken. Explicit examples are given with various techniques (Young tableau, characters etc).
We explain how to compute in the algebraic closure of a valued field. These computations heavily rely on the \NPAz. They are made in the same spirit as the dynamic algebraic closure of a field. They give a concrete content to the theorem…
Let $R$ be a subring of $\mathbb{C}[[z]]$, and let $X \in \mathbb{C}[[z]]$. The Newton-Puiseux Theorem implies that if the coefficients of $X$ grow sufficiently rapidly relative to the coefficients of the series in $R$, then $X$ is…
The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…
We exhibit an algorithm to compute equations of an algebraic curve over a computable characteristic 0 field from the power series expansions of its regular 1-forms at a nonrational point of the curve, extending a 2005 algorithm of Baker,…
A method for finding Puiseux series goes back to Isaac Newton, which gives the terms of Puiseux series through an infinite recursive process; an additional argument is then used to show that the resulting Puiseux series are convergent. This…
This paper describes an algorithm for determining the branching geometry of algebraic functions. The graphs of these complex-valued functions have a complicated interweaving structure that can be described by analytic branches separated by…