Decomposition of algebraic functions
- First Online:
- Cite this paper as:
- Kozen D., Landau S., Zippel R. (1994) Decomposition of algebraic functions. In: Adleman L.M., Huang MD. (eds) Algorithmic Number Theory. ANTS 1994. Lecture Notes in Computer Science, vol 877. Springer, Berlin, Heidelberg
Functional decomposition—whether a function f(x) can be written as a composition of functions g(h(x)) in a nontrivial way—is an important primitive in symbolic computation systems. The problem of univariate polynomial decomposition was shown to have an efficient solution by Kozen and Landau . Dickerson  and von zur Gathen  gave algorithms for certain multivariate cases. Zippel  showed how to decompose rational functions. In this paper, we address the issue of decomposition of algebraic functions. We show that the problem is related to univariate resultants in algebraic function fields, and in fact can be reformulated as a problem of resultant decomposition. We characterize all decompositions of a given algebraic function up to isomorphism, and give an exponential time algorithm for finding a nontrivial one if it exists. The algorithm involves genus calculations and constructing transcendental generators of fields of genus zero.
Unable to display preview. Download preview PDF.