Explicit methods in arithmetic geometry

算术几何中的显式方法

• 批准号: 261486-2013
• 负责人: Bruin, Nils
• 金额: $ 2.11万
• 依托单位: Simon Fraser University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2017
• 资助国家: 加拿大
• 起止时间: 2017-01-01 至 2018-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=635506
• 关键词: Explicit; methods; arithmetic; geometry

A large part of the mathematical sciences is concerned with developing methods for finding solutions to various types of equations. The simplest kind of equation is the polynomial equation, where the variables are combined using just addition and multiplication. This is the oldest type of equation that was ever studied. One calls such an equation a Diophantine equation if one restricts to solutions that are natural numbers, integers, or rational numbers. Equations like this come up in many practical situations, such as in resonance problems, translating election results into seat distributions, and various questions about discrete configurations. In general, it is a very hard problem to decide if a polynomial equation has an integer valued solution. In fact, it has been proved, in response to a challenge that Hilbert set in 1900, that it is fundamentally impossible to create a general algorithm (computer program) that decides if there is an integral solution to a given polynomial equation. In contrast, the answer to the similar problem for rational solutions is unknown. For a special class of equations called curves, recent work has resulted in a method that can often decide whether there are any rational solutions in practice. We even have some reason to believe that the method might actually always work. This research program aims to improve our understanding of the rational solutions of polynomial equations. It will develop new and improve existing methods for deciding if there are any solutions at all and to determine all solutions if they exist.

数学科学的很大一部分是关于寻找各种类型方程的解的方法。最简单的一种方程是多项式方程，其中变量仅使用加法和乘法组合。这是有史以来研究过的最古老的方程。一个所谓的方程丢番图方程，如果一个限制的解决方案，是自然数，整数，或有理数。类似这样的方程出现在许多实际情况中，例如共振问题，将选举结果转换为座位分布，以及关于离散配置的各种问题。一般来说，决定多项式方程是否有整数值解是一个非常困难的问题。事实上，为了回应希尔伯特在1900年提出的一个挑战，已经证明了根本不可能创建一个通用算法（计算机程序）来决定给定多项式方程是否存在整数解。相比之下，类似问题的合理解决方案的答案是未知的。对于一类称为曲线的特殊方程，最近的工作已经产生了一种方法，该方法通常可以确定在实践中是否存在任何合理的解决方案。我们甚至有理由相信这个方法可能总是有效的。本研究计划旨在提高我们对多项式方程有理解的理解。它将制定新的和改进现有的方法，以确定是否有任何解决办法，并确定所有解决办法，如果它们存在的话。