Counting Decomposable Univariate Polynomials

DOI10.1017/S0963548314000388zbMath1371.68335arXiv0901.0054MaRDI QIDQ5364223

Joachim von zur Gathen

Publication date: 4 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06) Special polynomials in general fields (12E10)

Related Items (3)

Counting decomposable polynomials with integer coefficients ⋮ Counting invariant subspaces and decompositions of additive polynomials ⋮ Tame decompositions and collisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting decomposable multivariate polynomials
• Decomposition of algebraic functions
• Functional decomposition of polynomials: the tame case
• Functional decomposition of polynomials: the wild case
• On composite lacunary polynomials and the proof of a conjecture of Schinzel
• Counting reducible and singular bivariate polynomials
• Prime and composite polynomials
• Lower bounds for decomposable univariate wild polynomials
• Normal form for Ritt's second theorem
• Compositions and collisions at degree \(p^2\)
• On Ritt's decomposition theorem in the case of finite fields
• The number of decomposable univariate polynomials. extended abstract
• Ritt's Second Theorem in arbitrary characteristic.
• Indecomposable polynomials and their spectrum
• Sur la composition des polynômes
• Polynomial decomposition algorithms

This page was built for publication: Counting Decomposable Univariate Polynomials