English

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

Number Theory 2023-12-05 v1

Abstract

Let Gn G_n and Hm H_m be two non-degenerate linear recurrence sequences defined over a function field F F in one variable over C \mathbb{C} , and let μ \mu be a valuation on F F . We prove that under suitable conditions there are effectively computable constants c1 c_1 and C C' such that the bound \begin{equation*} \mu(G_n - H_m) \leq \mu(G_n) + C' \end{equation*} holds for max{n,m}>c1 \max \{n,m\} > c_1 .

Cite

@article{arxiv.2207.05554,
  title  = {On the size of a linear combination of two linear recurrence sequences over function fields},
  author = {Sebastian Heintze},
  journal= {arXiv preprint arXiv:2207.05554},
  year   = {2023}
}

Comments

10 pages

R2 v1 2026-06-25T00:50:58.524Z