Unirational fields of transcendence degree one and functional decomposition

Authors:
Jamie Gutierrez;Rosario Rubio;David Sevilla
Affiliations:
Univ. of Cantabria, Santander, Spain;Univ. of Cantabria, Santander, Spain;Univ. of Cantabria, Santander, Spain
Venue:
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Year:
2001

Citing 6
Cited 3

Improperly parametrized rational curves

Computer Aided Geometric Design
Functional decomposition ofpolynomials: the tame case

Journal of Symbolic Computation - Special issue on computational algebraic complexity
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
Modern computer algebra

Modern computer algebra
Using Groebner Bases to Determine the Algebraic and Transcendental Nature of Field Extensions: Return of the Killer Tag Variables

AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

On multivariate rational function decomposition

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Simplification of surface parametrizations

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem

Journal of Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an algorithm to compute all unirational fields of transcendence degree one, containing a given finite set of multivariate rational functions. In particular, we provide an algorithm to decompose a multivariate rational function f of the form f = g(h), where g is univariate rational function and h a multivariate one.