2010/05/06 by Joachim von zur Gathen, Gathen, Joachim von zur, Mark Giesbrecht +3
Computer Science · Mathematics · #68W30 #Coding theory and cryptography #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Computer and information sciences #FOS: Mathematics #Polynomial and algebraic computation #Symbolic Computation (cs.SC) #cs.SC #math.AC #msc:68W30
paper · pdf · doi:10.48550/arxiv.1005.1087
arxiv created 2010/05/06 · openalex publication_date 2010/05/06 · arxiv updated 2010/05/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields is well understood in many cases, but quite poorly when the degrees of both components are divisible by the characteristic p. This work investigates the decomposition of polynomials whose degree is a power of p.