In this talk we discuss a parametric version of the Skolem Problem about decidability of the existence of a zero in a linear recurrence sequence. We show that in some natural parametric families for all but finitely many values of the parameter in the algebraic closure of the rational numbers it can be effectively solved. We then connect this problem to studying the greatest common divisor of two linear recurrence sequences of polynomials. Also, as an application we obtain an explicit version of a result of F. Amoroso, D. Masser and U. Zannier (2017) on the degrees of irreducible factors of polynomial powers sums.
Links:
[1] https://www.mpim-bonn.mpg.de/de/taxonomy/term/39
[2] https://www.mpim-bonn.mpg.de/de/node/3444
[3] https://www.mpim-bonn.mpg.de/de/node/246