Zsigmondy's theorem and primitive divisors of the Lucas and Lehmer sequences in polynomial rings (Q2049398): Difference between revisions

A prime divisor of a term \(a_m\) of a sequence \((a_n)_{n\ge 1}\) in a ring is called primitive if it divides no earlier term. Determining a `Zsigmondy bound' -- the point beyond which every term of a given sequence has a primitive divisor -- arises in many parts of mathematics. \textit{Yu. Bilu} et al. [J. Reine Angew. Math. 539, 75--122 (2001; Zbl 0995.11010)] proved a uniform bound for all Lucas and Lehmer sequences over the integers using a mixture of algebraic and Diophantine arguments. \textit{A. Flatters} and \textit{T. Ward} [J. Algebra 343, No. 1, 138--142 (2011; Zbl 1257.11028)] used algebraic arguments to find Zsigmondy bounds for related sequences over the ring \(K[t]\) for \(K\) a field. Here the methods of Flatters and the reviewer are developed to find analogues of these results for Lucas and Lehmer sequences in polynomial rings of several variables.