Good reduction of Puiseux series and applications

DOI10.1016/j.jsc.2011.08.008zbMath1235.30002OpenAlexW2027088875MaRDI QIDQ654032

Adrien Poteaux, Marc Rybowicz

Publication date: 21 December 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.08.008

zbMATH Keywords

Puiseux seriesalgebraic functionsmodular reductionRNPuiseuxsymbolic-numerical computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials (irreducibility, etc.) (11R09) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items (10)

A quasi-linear irreducibility test in \(\mathbb{K}x[y\)] ⋮ The practical Gauss type rules for Hadamard finite-part integrals using Puiseux expansions ⋮ Computing monodromy via continuation methods on random Riemann surfaces ⋮ Complexity bounds for the rational Newton-Puiseux algorithm over finite fields ⋮ Fractional Hermite interpolation for non-smooth functions ⋮ An algorithm for the inversion of Laplace transforms using Puiseux expansions ⋮ The method of Gauss-Newton to compute power series solutions of polynomial homotopies ⋮ The high order augmented finite volume methods based on series expansion for nonlinear degenerate parabolic equations ⋮ The modified composite Gauss type rules for singular integrals using Puiseux expansions ⋮ Computing Puiseux series: a fast divide and conquer algorithm

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
• Puiseux's théorem revisited
• Computing the Abel map
• On expansion of algebraic functions in power and Puiseux series. I
• On expansion of algebraic functions in power and Puiseux series. II
• Algebroid curves in positive characteristic
• Fast evaluation of holonomic functions
• On the complexity of rational Puiseux expansions
• Rational parametrizations of algebraic curves using a canonical divisor
• The Magma algebra system. I: The user language
• An algorithm for computing an integral basis in an algebraic function field
• Computing GCDs of polynomials over algebraic number fields
• Effective analytic functions
• Calcul pratique des coefficients de Taylor d'une fonction algébrique
• Hurwitz schemes and irreducibility of moduli of algebraic curves
• Integration of elementary functions
• Absolute Factorization of Polynomials: A Geometric Approach
• On Natural Radii of p-Adic Convergence
• Factoring Polynomials Over Algebraic Number Fields
• All Algebraic Functions Can Be Computed Fast
• Hensel construction of F(x, u ₁ , ..., x _l ) l ≥ 2 at a singular point and its applications
• A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
• Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
• Complexity of computation of embedded resolution of algebraic curves
• Computing Riemann matrices of algebraic curves

This page was built for publication: Good reduction of Puiseux series and applications