A function field variant of Pillai's problem

Abstract: In this paper, we consider a variant of Pillai's problem over function fields

F

in one variable over

m a t h b b C

. For given simple linear recurrence sequences

G_{n}

and

H_{m}

, defined over

F

and satisfying some weak conditions, we will prove that the equation

G_{n} - H_{m} = f

has only finitely many solutions

(n, m) i n m a t h b b N^{2}

for any non-zero

f i n F

, which can be effectively bounded. Furthermore, we prove that under suitable assumptions there are only finitely many effectively computable

f

with more than one representation of the form

G_{n} - H_{m}

.

Recommendations

Cites Work

Cited In (3)

This page was built for publication: A function field variant of Pillai's problem