Indecomposability of the polynomials P(x)=f(x)^n(x-a₁)^k₁ (x-a_m)^k_m

DOI10.1007/S00605-025-02144-4MaRDI QIDQ6846402zbMATH OpenFDO

Authors Csaba Rakaczki

Publication date 11 March 2026

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00605-025-02144-4

zbMATH Keywords

complete decompositionindecomposability of polynomialspolynomials with real rootsspecial polynomials

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Polynomials (irreducibility, etc.) (11R09)

Cites work

• Composite Polynomials with Coefficients in an Arbitrary Field of Characteristic Zero
• Decomposable polynomials in second order linear recurrence sequences
• Decomposition of a recursive family of polynomials
• Diophantine equations for second-order recursive sequences of polynomials
• Diophantine equations with Euler polynomials
• Functional composition of polynomials: indecomposability, Diophantine equations and Lacunary polynomials
• scientific article; zbMATH DE number 1467743 (Why is no real title available?)
• Indecomposability of mixed linear combinations of Bernoulli and Euler polynomials
• On the decomposability of linear combinations of Bernoulli polynomials
• On the decomposability of linear combinations of Euler polynomials
• Polynomial Substitutions
• Prime and composite polynomials
• Prime and composite polynomials.
• Ritt's Second Theorem in arbitrary characteristic.
• The Diophantine equation f(x) = g(y)
• The Diophantine equation f(x)=g(y)$f(x)=g(y)$ for polynomials with simple rational roots
• The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations

This page was built for publication: Indecomposability of the polynomials \(P(x)=f(x)^n(x-a_1)^{k_1}\cdots (x-a_m)^{k_m}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846402)