Skip to main content
Article thumbnail
Location of Repository

Decomposition of algebraic functions

By Dexter Kozen and Susan Landau


Abstract. Functional decomposition|whether a function f(x) canbe 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 e cient solution by Kozen and Landau [9]. Dickerson [5] and von zur Gathen [13] gave algorithms for certain multivariate cases. Zippel [15] showed how to decompose rational functions. In this paper, we address the issue of decomposition of algebraic functions. We showthat the problem is related to univariate resultants in algebraic function elds, and in fact can be reformulated as a problem of resultant decomposition. Wecharacterize all decompositions of a given algebraic function up to isomorphism, and give an exponential time algorithm for nding a nontrivial one if it exists. The algorithm involves genus calculations and constructing transcendental generators of elds of genus zero.

Year: 2014
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.