Good reduction of Puiseux series and applications
DOI10.1016/J.JSC.2011.08.008zbMATH Open1235.30002OpenAlexW2027088875MaRDI QIDQ654032FDOQ654032
Authors: 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
Recommendations
Symbolic computation and algebraic computation (68W30) Polynomials (irreducibility, etc.) (11R09) Polynomials in general fields (irreducibility, etc.) (12E05) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rational parametrizations of algebraic curves using a canonical divisor
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calcul pratique des coefficients de Taylor d'une fonction algébrique
- Title not available (Why is that?)
- Modern computer algebra
- On expansion of algebraic functions in power and Puiseux series. I
- Title not available (Why is that?)
- All Algebraic Functions Can Be Computed Fast
- A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
- Complexity of computation of embedded resolution of algebraic curves
- Title not available (Why is that?)
- Hurwitz schemes and irreducibility of moduli of algebraic curves
- On Natural Radii of p-Adic Convergence
- Algebroid curves in positive characteristic
- Computing GCDs of polynomials over algebraic number fields
- Title not available (Why is that?)
- An algorithm for computing an integral basis in an algebraic function field
- Differential equations for algebraic functions
- On expansion of algebraic functions in power and Puiseux series. II
- Fast evaluation of holonomic functions
- On the complexity of rational Puiseux expansions
- Effective analytic functions
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- Hensel construction of F(x, u 1 , ..., x l ) l ≥ 2 at a singular point and its applications
- Puiseux's théorem revisited
- Computing Riemann matrices of algebraic curves
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
- Factoring Polynomials Over Algebraic Number Fields
- Computing the Abel map
- Integration of elementary functions
- Absolute Factorization of Polynomials: A Geometric Approach
- Title not available (Why is that?)
Cited In (11)
- Fractional Hermite interpolation for non-smooth functions
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
- The method of Gauss-Newton to compute power series solutions of polynomial homotopies
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- An algorithm for the inversion of Laplace transforms using Puiseux expansions
- The high order augmented finite volume methods based on series expansion for nonlinear degenerate parabolic equations
- [[Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
- The practical Gauss type rules for Hadamard finite-part integrals using Puiseux expansions
- The modified composite Gauss type rules for singular integrals using Puiseux expansions
- Computing monodromy via continuation methods on random Riemann surfaces
- Computing Puiseux series: a fast divide and conquer algorithm
Uses Software
This page was built for publication: Good reduction of Puiseux series and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654032)
