Diophantine problems

丢番图问题

• 批准号: RGPIN-2018-03734
• 负责人: Bennett, Michael
• 金额: $ 2.55万
• 依托单位: University of British Columbia
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2018
• 资助国家: 加拿大
• 起止时间: 2018-01-01 至 2019-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=645167
• 关键词: Diophantine; problems

Number theory is one of the most ancient fields within mathematics and yet, even today, continues to provide unexpected applications within and without the discipline. It is also somewhat notorious for having classical problems that have the feature that they are easy to state, yet, apparently, hard to solve. Our proposed research focusses on a number of results of this nature; we term our approach "explicit methods for Diophantine problems". The machinery we employ to prove our results is somewhat diverse. One of the basic fields we utilize is that of Diophantine approximation, which, classically, seeks to measure how well rational numbers approximate irrational ones. Where our proposal has a certain amount of novelty is in its combining these techniques with modifications of those famously used by Wiles to prove Fermat's Last Theorem (together with results coming from other areas of number theory, analytic and combinatorial).******Our proposed work is centred upon two thematically-connected problems - theoretical and computational aspects of elliptic curves and explicit solution of classical problems from Diophantine equations. A common thread running through much of these two problems is their connection to solving a class of what are known as S-unit equations. Finding the solutions to such equations over cubic number fields enables us to tabulate all elliptic curves with rational coefficients and "small" conductor (known to be a finite problem since work of Shafarevich). Extending this to fields of higher degree allows one to carry this analysis to elliptic curves over number fields. Our proposed research will provide tables of such curves that greatly extend the current literature, as well as computational tools for solving S-unit equations that should find use in a wide variety of other settings.******Our methods will also allow us to make progress on a number of other classical problems, including that of finding shifted powers in recurrence sequences, various polynomial-exponential equations, and the general n-term S-unit equation. To carry this out, we must first sharpen and generalize a number of recent results on ternary equations arising from the modularity of associated Galois representations, as well as the hypergeometric method of Thue-Siegel. In the course of carrying out this latter goal, we are led to a project in analytic and computational number theory, joint with Martin, O'Bryant and Rechnitzer, where we seek to obtain completely explicit bounds with error terms saving at least a logarithm for each standard function counting primes in arithmetic progression.

数论是数学中最古老的领域之一，然而，即使在今天，数论仍然在学科内外提供意想不到的应用。它还因为一些经典问题而臭名昭著，这些问题的特点是它们很容易陈述，但显然很难解决。我们建议的研究集中在这种性质的一些结果上；我们称我们的方法为“丢番图问题的显式方法”。我们用来证明结果的方法有些不同。我们使用的一个基本领域是丢芬图近似值，经典地，它试图衡量有理数近似无理数的程度。我们的建议有一定的新颖性，因为它将这些技术与Wiles用来证明费马大定理的那些著名的修改相结合（以及来自数论，解析和组合的其他领域的结果）。******我们建议的工作集中在两个主题连接的问题-椭圆曲线的理论和计算方面以及丢番图方程经典问题的显式解。贯穿这两个问题的一个共同点是，它们都与解决一类所谓的s单位方程有关。在三次数域上找到这些方程的解使我们能够将所有具有有理系数和“小”导体的椭圆曲线（自Shafarevich的工作以来已知是有限问题）制成表格。将此扩展到更高次的域，可以将此分析应用于多个域上的椭圆曲线。我们提出的研究将提供这些曲线的表格，极大地扩展了当前的文献，以及求解s单位方程的计算工具，这些计算工具应该在各种其他设置中找到用途。******我们的方法也将使我们在许多其他经典问题上取得进展，包括在递归序列中寻找移位的幂，各种多项式指数方程，以及一般的n项s单位方程。为了实现这一点，我们必须首先锐化和推广一些最近的关于三元方程的结果，这些结果是由相关伽罗瓦表示的模块化引起的，以及tue - siegel的超几何方法。在实现后一个目标的过程中，我们与Martin， O'Bryant和Rechnitzer合作，在分析和计算数论方面进行了一个项目，在这个项目中，我们寻求获得带有误差项的完全显式界限，为每个标准函数在等差数列中计数素数至少节省一个对数。