Rational function decomposition
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
A rational function decomposition algorithm by near-separated polynomials
Journal of Symbolic Computation
Reduced Gro¨bner bases under composition
Journal of Symbolic Computation
Basic algorithms for rational function fields
Journal of Symbolic Computation
Modern computer algebra
Unirational fields of transcendence degree one and functional decomposition
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
On the problem of proper reparametrization for rational curves and surfaces
Computer Aided Geometric Design
Real implicitization of curves and geometric extraneous components
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Detecting real singularities of a space curve from a real rational parametrization
Journal of Symbolic Computation
High order derivatives and decomposition of multivariate polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
Journal of Symbolic Computation
On the problem of proper reparametrization for rational curves and surfaces
Computer Aided Geometric Design
Inversion, degree and reparametrization for rational surfaces
Proceedings of the 12th IMA international conference on Mathematics of surfaces XII
Decomposition of generic multivariate polynomials
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
On decomposition of tame polynomials and rational functions
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
On Ritt's decomposition theorem in the case of finite fields
Finite Fields and Their Applications
A partial solution to the problem of proper reparametrization for rational surfaces
Computer Aided Geometric Design
A computer algebra user interface manifesto
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
In this paper we discuss several notions of decomposition for multivariate rational functions, and we present algorithms for decomposing multivariate rational functions over an arbitrary field. We also provide a very efficient method to decide if a unirational field has transcendence degree one, and in the affirmative case to compute the generator.