On Multivariate Rational Function Decomposition
β Scribed by Jaime Gutierrez; Rosario Rubio; David Sevilla
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 291 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
In this paper we present an algorithm for decomposing rational functions over an arbitrary coefficient field. The algorithm requires exponential time, but is more efficient in practice than the previous ones, including the polynomial time algorithm. Moreover, our algorithm is easier to implement. We
Direct arguments are presented showing that for rational series in several commuting variables, the rational series problem is undecidable, and closure under Hadamard product fails.