Counting decomposable multivariate polynomials

Original Paper

DOI: 10.1007/s00200-011-0141-9

Cite this article as:
von zur Gathen, J. AAECC (2011) 22: 165. doi:10.1007/s00200-011-0141-9


A polynomial f (multivariate over a field) is decomposable if \({f=g \circ h}\) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number over a finite field. The relative error in our approximations is exponentially decaying in the input size.


Computer algebra Polynomial decomposition Multivariate polynomials Finite fields Combinatorics on polynomials 

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  1. 1.B-IT, Universität BonnBonnGermany

Personalised recommendations