A CRITERION FOR POLYNOMIAL DECOMPOSITION

Authors

  • Petar R. Lazov Ss. Cyril and Methodius University in Skopje image/svg+xml Author

Keywords:

polynomial decomposition, polynomial solution of algebraic equation, polynomial part of a \(n\)-th root of polynomial

Abstract

Abstract:
Let \(B=B(x)\) be a complex polynomial for which
\[
\deg B(x)=m\cdot n,\qquad m\geq 1,\quad n\geq 2,\quad m,n\in N.
\]
In this work we state a criterion for the following proposition to hold:
\[
\left\{
\begin{aligned}
&\text{there exist complex polynomials } y=y(x),\quad \deg y(x)=m\\
&\text{and } u=u(x),\quad \deg u(x)=n,\quad \text{such that}\\
&B(x)=u(y(x)).
\end{aligned}
\right.
\]

In addition, as an auxiliary result we obtain a theorem that completely solves the problem of the polynomial solutions of the algebraic equation
\[
B(x)=c_0+c_1\cdot y+\cdots+c_{n-1}\cdot y^{n-1}+c_n\cdot y^n,
\]
giving also an algorithm for finding them.

Downloads

Download data is not yet available.

Downloads

Published

1995-01-01

Issue

Section

Articles

How to Cite

[1]
P. R. Lazov, “A CRITERION FOR POLYNOMIAL DECOMPOSITION”, Mat. Bilt., vol. 19, no. 1, pp. 43–52, Jan. 1995, Accessed: Aug. 14, 2026. [Online]. Available: https://bilten.smm.org.mk/index.php/bilten/article/view/1556