Skip to main content Accesibility Help

Counting Decomposable Univariate Polynomials


A univariate polynomial f over a field is decomposable if it is the composition f = g ○ h of two polynomials g and h whose degree is at least 2. We determine an approximation to the number of decomposables over a finite field. The tame case, where the field characteristic p does not divide the degree n of f, is reasonably well understood, and we obtain exponentially decreasing relative error bounds. The wild case, where p divides n, is more challenging and our error bounds are weaker.

Hide All
[1] Blankertz, R., von zur Gathen, J. and K., Ziegler, (2013) Compositions and collisions at degree p2 . J. Symbol. Comput. 59 113145. Extended abstract in Proc. 2012 International Symposium on Symbolic and Algebraic Computation: ISSAC2012, pp. 91–98.
[2] Bodin, A., Dèbes, P. and Najib, S. (2009) Indecomposable polynomials and their spectrum. Acta Arithmetica 139 79100.
[3] Dorey, F. and Whaples, G. (1974) Prime and composite polynomials. J. Algebra 28 88101.
[4] von zur Gathen, J. (1990) Functional decomposition of polynomials: The tame case. J. Symbol. Comput. 9 281299.
[5] von zur Gathen, J. (1990) Functional decomposition of polynomials: The wild case. J. Symbol. Comput. 10 437452.
[6] von zur Gathen, J. (2002) Factorization and decomposition of polynomials. In The Concise Handbook of Algebra (Mikhalev, A. V. and Pilz, G. F., eds), Kluwer Academic, pp. 159161.
[7] von zur Gathen, J. (2008). Counting reducible and singular bivariate polynomials. Finite Fields and Their Applications 14 944978. Extended abstract in Proc. 2007 International Symposium on Symbolic and Algebraic Computation: ISSAC2007, pp. 369–376.
[8] von zur Gathen, J. (2009). The number of decomposable univariate polynomials: Extended abstract. In Proc. 2009 International Symposium on Symbolic and Algebraic Computation: ISSAC2009 (May, J. P., ed.), ACM Press, pp. 359366.
[9] von zur Gathen, J. (2010). Counting decomposable multivariate polynomials. Applicable Algebra in Engineering, Communication and Computing 22 165185. Abstract in Abstracts of the Ninth International Conference on Finite Fields and their Applications, Claude Shannon Institute, pp. 21–22.
[10] von zur Gathen, J. (2013) Lower bounds for decomposable univariate wild polynomials. J. Symbol. Comput. 50 409430.
[11] von zur Gathen, J. (2014) Finite Fields and Their Applications 27 4171. ISSN 1071-5797.
[12] von zur Gathen, J., Kozen, D. and Landau, S. (1987) Functional decomposition of polynomials. In Proc. 28th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, pp. 127131. Final version in J. Symbol. Comput.
[13] Giesbrecht, M. W. (1988) Complexity results on the functional decomposition of polynomials. Technical Report 209/88, Department of Computer Science, University of Toronto. arXiv:1004.5433
[14] Grabmeier, J., Kaltofen, E. and Weispfenning, V. (eds) (2003) Computer Algebra Handbook: Foundations, Applications, Systems, Springer.
[15] Gutierrez, J. and Kozen, D. (2003) Polynomial decomposition. In [14], Section 2.2.4, pp. 26–28.
[16] Gutierrez, J. and Sevilla, D. (2006) On Ritt's decomposition theorem in the case of finite fields. Finite Fields Appl. 12 403412.
[17] Kozen, D. and Landau, S. (1986) Polynomial decomposition algorithms. Technical Report 86-773, Department of Computer Science, Cornell University.
[18] Kozen, D. and Landau, S. (1989) Polynomial decomposition algorithms. J. Symbol. Comput. 7 445456.
[19] Kozen, D., Landau, S. and Zippel, R. (1996) Decomposition of algebraic functions. J. Symbol. Comput. 22 235246.
[20] Ritt, J. F. (1922) Prime and composite polynomials. Trans. Amer. Math. Soc. 23 5166.
[21] Schinzel, A. (1982) Selected Topics on Polynomials, The University of Michigan Press.
[22] Schinzel, A. (2000) Polynomials With Special Regard to Reducibility, Cambridge University Press.
[23] Tortrat, P. (1988) Sur la composition des polynômes. Colloq. Math. 55 329353.
[24] Zannier, U. (1993). Ritt's Second Theorem in arbitrary characteristic. J. Reine Angewandte Mathematik 445 175203.
[25] Zannier, U. (2008) On composite lacunary polynomials and the proof of a conjecture of Schinzel. Inventio. Math. 174 127138.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed