Counting decomposable polynomials with integer coefficients
Art\=uras Dubickas, Min Sha

TL;DR
This paper provides precise bounds and asymptotic formulas for counting decomposable polynomials with integer coefficients, focusing on fixed degree and bounded height, especially for monic polynomials of even degree.
Contribution
It introduces sharp bounds and asymptotic formulas for the enumeration of decomposable integer polynomials, advancing understanding of their distribution.
Findings
Number of monic sextic integer decomposable polynomials asymptotic to (16ζ(3)-5/4)H^3
Established sharp bounds for decomposable polynomials of fixed degree and height
Derived asymptotic formulas for even degree monic decomposable polynomials
Abstract
A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree and bounded height. Moreover, we obtain asymptotic formulas for the number of decomposable monic polynomials of even degree. For example, the number of monic sextic integer polynomials which are decomposable and of height at most is asymptotic to as .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Algebraic Geometry and Number Theory
