Pseudorandom majorants over number fields with applications in arithmetic geometry

丢番图方程（英语：Diophantine equation）是一个多项式方程，其中所有系数都是整数（整数）或有理数（分数）。最基本的问题，给定一个丢番图方程，是它是否有一个解决方案，即整数或有理数的集合，满足这个方程。要决定一个给定的丢番图方程是否有解是非常困难的，尽管几个世纪以来已经发展了大量的数学机器来解决这些问题。一个著名的例子是费马大定理。尽管它的陈述相对简单，即对于任何大于2的整数n，两个正n次幂的和不可能是n次幂，但350多年来，数学家们的努力一直未能证明。它产生了许多新的发展，并最终由安德鲁怀尔斯在世纪末完成。方程不仅定义数论，而且定义几何对象。世纪发展起来的一种特别成功的方法，试图通过相应的几何对象来研究丢番图方程的解。使用这些几何技术研究丢番图方程的现代研究被称为算术（或丢番图）几何。数论的另一个分支，英国数学家在其中发挥了世界领先的作用，被称为加法组合学。这门学科的目标之一是通过将整数分解成结构化和随机的部分来理解整数的子集，主要挑战来自于这样一个事实，即这通常不是一个干净的二分法，而是一个完整的谱。最近，通过将加法组合学的某些结果和技术应用于算术几何问题，从而大大扩展了我们对丢番图方程的知识。该项目的中心目标是通过使这些技术在算术几何中自然存在的更广泛的背景下可用来增强这些技术的影响。

A Diophantine equation, named after the ancient Hellenistic mathematician Diophantus of Alexandria, is a polynomial equation in which all the coefficients are integers (whole numbers) or rational numbers (fractions). The most fundamental question, given a Diophantine equation, is whether it has a solution, that is a collection of integers or rational numbers which satisfy this equation. To decide whether a given Diophantine equation has a solution can be extremely hard, in spite of extensive mathematical machinery that was developed over centuries to attack these questions. A famous example is Fermat's Last Theorem. Despite the relative simplicity of its statement that for any integer n greater than two, the sum of two positive nth powers can not be an nth power, a proof has eluded the efforts of mathematicians for more than 350 years. It has spawned numerous new developments and was finally completed by Andrew Wiles at the end of the 20th century.Equations define not just number theoretic, but also geometric objects. A particularly successful approach, developed in the 20th century, tries to investigate solutions to Diophantine equations via the corresponding geometric objects. The modern study of Diophantine equations using these geometric techniques is called arithmetic (or Diophantine) geometry.Another branch of number theory, in which UK mathematicians play a world leading role, is called additive combinatorics. One of the aims of this discipline is to understand subsets of the integers by decomposing them into structured and random looking parts, with the main challenge arising from the fact that this is usually not a clean dichotomy, but rather a full spectrum.Extremely fruitful connections between these two fields were initiated very recently by applying certain results and techniques from additive combinatorics to questions in arithmetic geometry, thus expanding our knowledge of Diophantine equations significantly. The central aim of this project is to enhance the impact of these techniques by making them available in a much wider context that is natural in arithmetic geometry.