On the size of a linear combination of two linear recurrence sequences over function fields

Abstract: Let

G_{n}

and

H_{m}

be two non-degenerate linear recurrence sequences defined over a function field

F

in one variable over

m a t h b b C

, and let

m u

be a valuation on

F

. We prove that under suitable conditions there are effectively computable constants

c_{1}

and

C^{'}

such that the bound �egin{equation*} mu(G_n - H_m) leq mu(G_n) + C' end{equation*} holds for

m a x n, m > c_{1}

.

Recommendations

This page was built for publication: On the size of a linear combination of two linear recurrence sequences over function fields