Complete decomposition of Dickson-type polynomials and related Diophantine equations
A decomposition of a polynomial \(f\in\mathbb{C}[x]\) is a representation \(f= r\circ q\) with some non-constant polynomials \(r,g\in\mathbb{C}[x]\), where the operation is the usual functional composition. The decomposition is called non-trivial if \(\deg r\), \(\deg q> 1\). Two decompositions \(f= r_1\circ q_1\) and \(f= r_2\circ q_2\) are said to be equivalent if there is a linear polynomial \(k\) such that \(r_2= r_1\circ k\) and \(q_2= k^{-1}\circ q_1\). The Dickson-type recursive polynomials over \(\mathbb{R}\) (respectively \(\mathbb{Q}\)) are the polynomials \(f_k\in\mathbb{R}[x]\) (respectively \(\mathbb{Q}[x]\)) defined by the relations \[ f_0(x)= B,\quad f_1(x)= x,\quad f_{n+1}(x)= xf_n(x)- af_{n-1}(x),\quad n\geq 1, \] where \(B\), \(a\in\mathbb{R}\) (respectively \(\mathbb{Q}\)). The main result of the paper under review is that the Dickson-type polynomials \(f_n\) over \(\mathbb{R}\) with \(a\neq 0\), \(B\neq 2\), are decomposable ovec \(\mathbb{C}\) if and only if \(n= 2k\) with \(k\geq 2\). In that case \(f_n= h_k\circ x^2\) and \(h_k\) is decomposable over \(\mathbb{C}\) if and only if \(B= -2\), \(n= 8\) such that \[ f_8= (x^2- 4a^2 x- 2a^4)\circ (x^2- 2ax)\circ x^2. \] Moreover, all non-trivial decompositions of \(f_n\) are equivalent to the above two decompositions. As a consequence of this result, the author studies Diophantine equations of the form \(f_n(x)= g(y)\), where \(g(x)\) is an arbirary polynomial of \(\mathbb{Q}[x]\), and in case where a such equation has infinitely many rational solutions \((x,y)\) with bounded denominators, he gives necessary conditions on \(g(x)\). Furthermore, if \(f_n^{(a,B)}(x)= f_n(x)\) and \(h_k^{(a,B)}= f_{2k}^{(a,B)}(\sqrt{x})\), then he obtains necessary and sufficient conditions for the equation \[ f_n^{(a,B)}(x)= f_m^{(a', B')}(y), \] where \(a,a',B,B'\in\mathbb{Q}\) and \(m\geq n\geq 3\), to have infinitely many rational solutions with bounded denomiantors.
- Decomposition of a recursive family of polynomials
- scientific article; zbMATH DE number 4070997
- Functional composition of polynomials: indecomposability, Diophantine equations and Lacunary polynomials
- On special extrema of polynomials with applications to Diophantine problems
- On the decomposition of \(x^d + a_ex^e +\dots +a_1x +a_0\)
- A class of Diophantine equations involving Bernoulli polynomials
- Decomposition of a recursive family of polynomials
- Decomposition of perturbed Chebyshev polynomials
- Diophantine equations between polynomials obeying second order recurrences
- Diophantine equations for classical continuous orthogonal polynomials
- Diophantine equations for second-order recursive sequences of polynomials
- Diophantine equations involving general Meixner and Krawtchouk polynomials
- Diophantine equations with Bernoulli polynomials
- scientific article; zbMATH DE number 2186400 (Why is no real title available?)
- scientific article; zbMATH DE number 3765914 (Why is no real title available?)
- scientific article; zbMATH DE number 732318 (Why is no real title available?)
- scientific article; zbMATH DE number 1467743 (Why is no real title available?)
- scientific article; zbMATH DE number 1752496 (Why is no real title available?)
- scientific article; zbMATH DE number 2108683 (Why is no real title available?)
- INDECOMPOSABILITY OF POLYNOMIALS AND RELATED DIOPHANTINE EQUATIONS
- Octahedrons with equally many lattice points
- On a class of combinatorial Diophantine equations
- On the Diophantine equation \(x(x + 1)(x + 2)\dots (x + (m - 1)) =g(y)\)
- On the diophantine equation x(x-1)...(x-(m-1 ) )= λy(y-1 )...(y-(n-1 ) )+ l
- On the Indecomposability of Polynomials*
- Polynomials. Translated from the second Russian edition by Dimitry Leites.
- The Diophantine equation f(x) = g(y)
- On the decomposition of \(x^d + a_ex^e +\dots +a_1x +a_0\)
- Diophantine equations in separated variables and polynomial power sums
- On decompositions of binary recurrent polynomials
- Composite values of polynomial power sums
- Decomposition of a recursive family of polynomials
- Decomposition of perturbed Chebyshev polynomials
- Root geometry of polynomial sequences. II: Type (1,0).
- Functional composition of polynomials: indecomposability, Diophantine equations and Lacunary polynomials
- INDECOMPOSABILITY OF POLYNOMIALS AND RELATED DIOPHANTINE EQUATIONS
- Dickson polynomials over finite fields
- A numerical approach with error estimation to solve general integro-differential-difference equations using Dickson polynomials
- Lower bounds for genera of fiber products
- Polynomial values of sums of hyperbolic binomial coefficients
This page was built for publication: Complete decomposition of Dickson-type polynomials and related Diophantine equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483159)
