Composite values of polynomial power sums
Decomposability of polynomials is a very interesting and deep problem. In the present paper the authors consider decomposability of polynomial recurrence sequences. \par Let \((G_n(x))_{n=0}^{\infty}\) be a non-degenerate simple linear recurrence sequence of order \(d\ge 2\) with power sum representation \[ G_n(x)=a_1\alpha_1^n+\ldots +a_d\alpha_d^n \] with \(a_1,\ldots,a_d\in\mathbb C\), \(\alpha_1,\ldots,\alpha_d\in\mathbb C[x]\). Note that \textit{C. Fuchs} et al. [Manuscr. Math. 159, No. 3--4, 321--346 (2019; Zbl 1465.11060)] considered decomposability of binary recurrence sequences. These results are extended to arbitrary order in this work. Assume \(\deg\alpha_1 \geq \max \{\deg\alpha_2\ldots,\deg\alpha_d\}\). Let \(m\ge 2\) be an integer and let \(m_0\) be the smallest integer with \(\alpha_1^{m_0/m}\in\mathbb C[x]\). The main result of the paper says that if \(G_n(x)=g\circ h\) with \(\deg g=m,\deg h\geq 1\), then there are \(c_1,\ldots,c_l\in\mathbb C\) with \[ h(x)=c_1\gamma_1^{\ell}+\ldots + c_l\gamma_l^{\ell}, \] where \(m_0\ell=n\) and \(l\in\mathbb N\) is bounded explicitly in terms of \(m,d\) and \(\deg\alpha_1+\ldots+\deg\alpha_d\) and \(\gamma_1,\ldots\gamma_l\in\mathbb C(x)\) can be effectively given in terms of \(\alpha_1,\ldots,\alpha_d\), both independently of \(n\). \par The proof is based mainly on the ideas of \textit{U. Zannier} [Invent. Math. 174, No. 1, 127--138 (2008; Zbl 1177.12004)].
- Decomposable polynomials in second order linear recurrence sequences
- Perfect powers in polynomial power sums
- On decompositions of binary recurrent polynomials
- On the Indecomposability of Polynomials*
- The zero multiplicity of linear recurrence sequences
- Complete decomposition of Dickson-type polynomials and related Diophantine equations
- scientific article; zbMATH DE number 1471864
- On linear recursions with nonnegative coefficients
- scientific article; zbMATH DE number 1486504
- scientific article; zbMATH DE number 3865368
- Addendum to the paper: ``On the number of terms of a composite polynomial (Acta Arith. 127 (2007), 157–167)
- Algebraic function fields and codes
- Combinatorial Diophantine equations and a refinement of a theorem on separated variables equations
- Composite rational functions expressible with few terms
- Composite rational functions having a bounded number of zeros and poles
- Decomposable polynomials in second order linear recurrence sequences
- Decomposition of polynomials and approximate roots
- Effective bounds for the zeros of linear recurrences in function fields
- Finiteness of integral values for the ratio of two linear recurrences
- scientific article; zbMATH DE number 3169149 (Why is no real title available?)
- scientific article; zbMATH DE number 1467743 (Why is no real title available?)
- scientific article; zbMATH DE number 3244441 (Why is no real title available?)
- On composite lacunary polynomials and the proof of a conjecture of Schinzel
- On fewnomials, integral points, and a toric version of Bertini’s theorem
- On the Diophantine equation \(G_n(x)=G_m(P(x))\) for third order linear recurring sequences
- On the Diophantine equation \(G_{n}(x) = G_{m}(P(x))\)
- On the Diophantine Equation G n (x) = G m (y) with Q (x, y)=0
- On the Diophantine equation 𝐺_{𝑛}(𝑥)=𝐺_{𝑚}(𝑃(𝑥)): Higher-order recurrences
- On the integer solutions of exponential equations in function fields.
- On the number of terms of a composite polynomial
- The classical fields. Structural features of the real and rational numbers
- The Diophantine equation f(x) = g(y)
- The Equation f(X) = f(Y) in Rational Functions X = X(t), Y = Y(t)
- The intersection of recurrence sequences
- Vanishing sums in function fields
- When Is a Polynomial a Composition of Other Polynomials?
This page was built for publication: Composite values of polynomial power sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292677)
