A rational function decomposition algorithm by near-separated polynomials
From MaRDI portal
Publication:1907270
DOI10.1006/jsco.1995.1030zbMath0840.68048OpenAlexW2001976071MaRDI QIDQ1907270
Cesar Alonso, Tomás Recio, Jaime Gutierrez
Publication date: 1 July 1996
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1995.1030
Related Items
$D$-resultant for rational functions ⋮ A short proof for the open quadrant problem ⋮ A note on separated factors of separated polynomials ⋮ Effective differential Lüroth's theorem ⋮ Computing pullback function of second order differential operators by using their semi-invariants ⋮ Counting decomposable multivariate polynomials ⋮ A partial solution to the problem of proper reparametrization for rational surfaces ⋮ Computation of Belyi maps with prescribed ramification and applications in Galois theory ⋮ Computation of unirational fields ⋮ On tubular vs. swung surfaces ⋮ Computing the bound of an Ore polynomial. Applications to factorization ⋮ Fast algorithms for computing isogenies between elliptic curves ⋮ On the decomposition of rational functions ⋮ On multivariate rational function decomposition ⋮ Generalizing circles over algebraic extensions ⋮ On the problem of proper reparametrization for rational curves and surfaces ⋮ Plotting missing points and branches of real parametric curves ⋮ Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem ⋮ Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem ⋮ Algorithms for Function Fields ⋮ Algorithmic solution of Abel's equation ⋮ A recombination algorithm for the decomposition of multivariate rational functions ⋮ The place of exceptional covers among all diophantine relations ⋮ Unnamed Item ⋮ Effective computation of singularities of parametric affine curves
Uses Software
