arXiv · 0901.0054
Counting decomposable univariate polynomials
Abstract
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 the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number 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 error bounds. The wild case, where p divides n, is more challenging and our error bounds are weaker.
Explore related subjects
Keep this discovery
Joachim von zur Gathen. 2009-09-17. Counting decomposable univariate polynomials. https://doi.org/10.1017/s0963548314000388
Cite the original work for its findings. Save a collection to share your selection of sources.