On the decomposition of rational functions

Ayad, Mohamed and Fleischmann, Peter (2008) On the decomposition of rational functions. Journal of Symbolic Computation, 43 (4 ). 259-274 . ISSN 0747-7171. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL


Let f := p/q epsilon K(x) be a rational function in one variable. By Luroth's theorem, the collection of intermediate fields K(f) subset of L subset of K(x) is in bijection with inequivalent proper decompositions f = g circle h, with g, h epsilon K(x) of degrees >= 2. In [Alonso, Cesar, Gutierrez, Jaime, Recio, Tomas, 1995. A rational function decomposition algorithm by near-separated polynomials. J. Symbolic Comput. 19, 527-544] an algorithm is presented to calculate such a function decomposition. In this paper we describe a simplification of this algorithm, avoiding expensive solutions of linear equations. A MAGMA implementation shows the efficiency of our method. We also prove some indecomposability criteria for rational functions, which were motivated by computational experiments.

Item Type: Article
Uncontrolled keywords: rational function decomposition; indecomposable rational function; normal form of a rational function
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Q Science > QA Mathematics (inc Computing science)
Divisions: Faculties > Science Technology and Medical Studies > School of Mathematics Statistics and Actuarial Science
Depositing User: Peter Fleischmann
Date Deposited: 05 Feb 2009 13:43
Last Modified: 19 May 2014 13:26
Resource URI: https://kar.kent.ac.uk/id/eprint/8941 (The current URI for this page, for reference purposes)
  • Depositors only (login required):