arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.10339math.NT
收藏

Pillai问题的一个函数域变体

A function field variant of Pillai's problem

Clemens Fuchs, Sebastian Heintze

AI总结:

本文研究复数域上一元函数域上Pillai问题的变体,证明在弱条件下简单线性递推序列方程仅有有限且可有效界定的解,且仅有有限个可有效计算的$f$具有多重表示。

摘要:

本文考虑复数域$\mathbb{C}$上的一元函数域$F$上Pillai问题的一个变体。对于定义在$F$上且满足某些弱条件的给定简单线性递推序列$G_n$和$H_m$,我们将证明方程$G_n - H_m = f$对于任意非零的$f \in F$仅有有限多个解$(n,m) \in \mathbb{N}^2$,且这些解可被有效界定。此外,我们证明在适当假设下,仅有有限多个可有效计算的$f$具有多于一种$G_n - H_m$形式的表示。

英文摘要:

In this paper, we consider a variant of Pillai's problem over function fields $ F $ in one variable over $ \mathbb{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) \in \mathbb{N}^2 $ for any non-zero $ f \in 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 $.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑