Counting decomposable polynomials with integer coefficients

DOI10.1007/s00605-022-01778-yOpenAlexW2793656896MaRDI QIDQ2684469

Min Sha, Arturas Dubickas

Publication date: 16 February 2023

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.08755

zbMATH Keywords

heightdegreeasymptotic formuladecomposable polynomial

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials in real and complex fields: factorization (12D05) PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06)

Cites Work

• Unnamed Item
• Unnamed Item
• Counting decomposable multivariate polynomials
• Counting degenerate polynomials of fixed degree and bounded height
• Specializations of indecomposable polynomials
• Positive density of integer polynomials with some prescribed properties
• Functional decomposition of polynomials: the tame case
• Functional decomposition of polynomials: the wild case
• Enumerative Galois theory for cubics and quartics
• Lattice points in convex bodies with planar points on the boundary
• On the number of monic integer polynomials with given signature
• On the number of integer polynomials with multiplicatively dependent roots
• Prime and composite polynomials
• Lower bounds for decomposable univariate wild polynomials
• Counting invariant subspaces and decompositions of additive polynomials
• Irreducible polynomials of bounded height
• Normal form for Ritt's second theorem
• Irreducibility of random polynomials of large degree
• On the distribution of polynomials with bounded height
• Compositions and collisions at degree \(p^2\)
• On the invariance of chains of fields
• On the probability that \(k\) positive integers are relatively prime
• Counting and Testing Dominant Polynomials
• ON NUMBER FIELDS WITH NONTRIVIAL SUBFIELDS
• Ritt's Second Theorem in arbitrary characteristic.
• Indecomposable polynomials and their spectrum
• Sur la composition des polynômes
• Density of real and complex decomposable univariate polynomials
• A polynomial time algorithm for computing all minimal decompositions of a polynomial
• Counting Decomposable Univariate Polynomials
• Die Seltenheit der reduziblen Gleichungen und der Gleichungen mit Affekt
• Polynomial Substitutions
• Composite Polynomials with Coefficients in an Arbitrary Field of Characteristic Zero
• Polynomial decomposition algorithms
• Polynomial decomposition algorithms
• Tame decompositions and collisions

This page was built for publication: Counting decomposable polynomials with integer coefficients