Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem

DOI10.1016/j.jco.2010.05.001zbMath1216.65054OpenAlexW3103289733MaRDI QIDQ990817

Guillaume Chèze

Publication date: 1 September 2010

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2010.05.001

zbMATH Keywords

complexityrational functionspolynomial time algorithmfactorizationLüroth's theoremGutieres-Rubio-Sevilla decomposition algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)

Related Items (3)

Effective differential Lüroth's theorem ⋮ Bounding the number of remarkable values via Jouanolou's theorem ⋮ A recombination algorithm for the decomposition of multivariate rational functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional decomposition of polynomials: the tame case
• Functional decomposition of polynomials: the wild case
• The number of reducible hypersurfaces in a pencil. -- Erratum
• A matrix-based approach to properness and inversion problems for rational surfaces
• Reducibility of rational functions in several variables
• Reducibility of polynomials in several variables. II
• Improperly parametrized rational curves
• Fast parallel absolute irreducibility testing
• Equations de Pfaff algébriques
• Reducibility of polynomials in two variables
• Irreducibility of polynomials modulo \(p\) via Newton polytopes.
• Multivariate polynomial decomposition
• Recognizing simple subextensions of purely transcendental field extensions
• A note on a theorem of Fried and MacRae
• A rational function decomposition algorithm by near-separated polynomials
• Lifting and recombination techniques for absolute factorization
• Improved dense multivariate polynomial factorization algorithms
• Algebraic closure of a rational function
• Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem
• Unirational fields of transcendence degree one and functional decomposition
• Sharp precision in Hensel lifting for bivariate polynomial factorization
• Reduzibilität ebener Kurven.
• Fast Algorithms for Manipulating Formal Power Series
• Translates of Polynomials
• On a Theorem of Lueroth
• Polynomial decomposition algorithms
• Polynomial decomposition algorithms

This page was built for publication: Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem