Decomposable polynomials in second order linear recurrence sequences

DOI10.1007/s00229-018-1070-8zbMath1465.11060arXiv1703.03258OpenAlexW2748040020WikidataQ129151497 ScholiaQ129151497MaRDI QIDQ2420667

Christina Karolus, Clemens Fuchs, Dijana Kreso

Publication date: 6 June 2019

Published in: Manuscripta Mathematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.03258

zbMATH Keywords

linear recurrence sequencesdecomposable polynomials

Mathematics Subject Classification ID

Iteration theory, iterative and composite equations (39B12) Polynomials (irreducibility, etc.) (11R09) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (8)

Perfect powers in polynomial power sums ⋮ On decompositions of binary recurrent polynomials ⋮ Pillai's conjecture for polynomials ⋮ A polynomial variant of diophantine triples in linear recurrences ⋮ An analysis of polynomial sequences and their application to discrete fractional operators ⋮ A function field variant of Pillai's problem ⋮ Composite values of polynomial power sums ⋮ ON THE GROWTH OF LINEAR RECURRENCES IN FUNCTION FIELDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Composite rational functions expressible with few terms
• Algebraic function fields and codes
• Effective bounds for the zeros of linear recurrences in function fields
• On common values of lacunary polynomials at integer points
• On composite lacunary polynomials and the proof of a conjecture of Schinzel
• On the Diophantine equation \(G_n(x)=G_m(P(x))\) for third order linear recurring sequences
• On the integer solutions of exponential equations in function fields.
• On the Diophantine equation \(G_{n}(x) = G_{m}(P(x))\)
• On a conjecture of Schur
• Diophantine equations between polynomials obeying second order recurrences
• Polynomials with a common composite
• Diophantine Equations for Second-Order Recursive Sequences of Polynomials
• Permutation groups with a cyclic two-orbits subgroup and monodromy groups of Laurent polynomials
• On the number of terms of a composite polynomial
• On the Diophantine Equation G n (x) = G m (y) with Q (x, y)=0
• Vanishing sums in function fields
• On the Diophantine equation 𝐺_{𝑛}(𝑥)=𝐺_{𝑚}(𝑃(𝑥)): Higher-order recurrences
• On Ritt's Factorization of Polynomials
• The Diophantine equation f(x) = g(y)
• Quadratic factors of f(x) -g(y)
• Diophantine equations in separated variables and lacunary polynomials

This page was built for publication: Decomposable polynomials in second order linear recurrence sequences