Critical points, critical values of a prime polynomial
Mohamed Ayad
Abstract
Mohamed Ayad
Abstract
Given a polynomial f (x), we study the possibility of expressing it as the composition of two non-constant and non-linear polynomials. In this case f(x) is said to be composite otherwise it is prime. We give sufficient conditions for a polynomial to be prime in terms of its critical values and critical points. Given two polynomials, f (x) and h(x) we give methods to decide if h(x) is a right composition factor of f (x) and in that case to find the polynomial g(x) such that f = g ○ h. Finally we propose an algorithm to decompose a polynomial f (x) into its prime factors if one knows its list of critical points with their valencies.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Given a polynomial f (x), we study the possibility of expressing it as the composition of two non-constant and non-linear polynomials. In this case f(x) is said to be composite otherwise it is prime. We give sufficient conditions for a polynomial to be prime in terms of its critical values and critical points. Given two polynomials, f (x) and h(x) we give methods to decide if h(x) is a right composition factor of f (x) and in that case to find the polynomial g(x) such that f = g ○ h. Finally we propose an algorithm to decompose a polynomial f (x) into its prime factors if one knows its list of critical points with their valencies.
Key concepts: Mathematics, Prime (order theory), Polynomial, Combinatorics, Prime factor, Discrete mathematics, Mathematical analysis