Effective Equidistribution in Diophantine Approximation : Theory, Interactions and Applications.

丢番图逼近是数论的一个分支，可以粗略地描述为对每个真实的数都可以被任意接近的有理数逼近的性质的定量分析。这个理论可以追溯到古希腊人和中国人，他们对圆周率（3.14...）以准确预测行星和恒星的位置。今天，该理论与许多其他数学领域，如遍历理论，动力系统，概率论和分形几何深深交织在一起。丢番图近似在解决真实的世界问题中也发挥着重要的作用，这些问题包括计算机科学或电子通信、天线设计和信号处理等快速发展的领域中产生的问题。丢番图近似与其他科学学科之间的许多相互作用可以用用更规则的结构来近似复杂结构的普遍需要来解释。因此，许多问题可以归结为对近似集的分布的分析。此外，只要对这些集合所具有的规律性（即它们的等分布性质）有足够好的理解，就可以解决这些问题。该研究项目旨在利用这一富有成果的观点来解决一些深层次和长期存在的问题，这些问题是度量（即概率）数论，凸几何和丢番图分析等主题的核心。其中一个目标与近似相关量的问题有关（例如，一个数和它的立方）的有理数。这导致域的丢番图逼近流形上，其中大多数问题没有一般的理论是可用的。我们的目标是发展这样一个一般性的理论，一个大类的曲线，通过确定分形维数非常接近点躺在他们。这与计算有理点的个数有关，有理点的有界算子位于给定曲线附近，构成了一个非常活跃的研究领域。该项目还将关注凸几何中的一个问题，可以松散地（但令人惊讶地简单）描述如下：假设你站在一个森林中，所有的树干都有相同的（非常小的）尺寸。你能把它们放在这样的位置上吗？它们之间至少有一个单位的距离，而且无论你站在哪里，朝哪个方向看，你都看不到地平线。如果是这样的话，以适当的方式排列树木，可以保证的最小可见度是多少？深层问题是由Danzer（1965）提出的，与数学物理和数学准晶理论中的其他问题密切相关。它仍然是开放的，将通过分析定义为树的中心的点集的分布，用丢番图方法来解决。最后，另一个目标将是回答一些与有效性问题有关的问题（即，已知结果成立，但不知道如何在任何具体例子中检查它的问题）。更准确地说，重点将放在满足以下简单性质的数列上：无论何时，比方说，已知三个连续的1，那么在它们之后的数可以从一个固定的简单规则推导出来，例如将三个给定的数相加并乘以常数。应该清楚的是，列表中前三个数字的数据和第四个数字的（固定）演绎规则决定了整个列表。然后可以证明，在有利的条件下，出现在这个列表中的零的数量总是有限的。例如，在计算机科学中，可判定性的深层问题的核心问题是，能够找到一个范围，在这个范围之外，可以保证所有项都是非零的。这一问题将作为拟议项目的一部分加以研究。

Diophantine Approximation is a branch of Number Theory that can loosely be described as a quantitative analysis of the property that every real number can be approximated by a rational number arbitrarily closely. The theory dates back to the ancient Greeks and Chinese who used good approximations to the number pi (3.14...) in order to accurately predict the position of planets and stars. Today, the theory is deeply intertwined with many other areas of mathematics such as ergodic theory, dynamical systems, probability theory and fractal geometry. It also continues to play a significant role in applications to real world problems including those arising from computer science or from the rapidly developing areas of electronic communications, antenna design and signal processing.The many interactions between Diophantine Approximation and other disciplines in science can be explained by the universal need to approximate complex structures by more regular ones. Many problems can thus be reduced to the analysis of the distribution of sets of approximation. They can furthermore be solved upon having a good enough understanding of the regularity such sets enjoy (that is, their equidistribution properties). The research project aims at exploiting this fruitful point of view to tackle some deep and long-standing problems lying at heart of topics as varied as Metric (i.e. probabilistic) Number Theory, Convex Geometry and Diophantine Analysis.One of the goals is related to the problem of approximating dependent quantities (e.g., a number and its cube) by rationals. This leads to the domain of Diophantine Approximation on manifolds, where for most questions no general theory is available. Our aim is to develop such a general theory for a large class of curves by determining the fractal dimension of very well approximable points lying on them. This is related to the problem of counting the number of rational points with bounded denominators lying close to the given curves and constitutes an extremely active domain of research.The project will also be concerned with a question in Convex Geometry which can loosely (but surprisingly simply) be described as follows: suppose you stand in a forest where all tree trunks have the same (very small) size. Can you position them in such a way that they are at least a unit distance apart from each other and that no matter where you stand and what direction you look in, you will never be able to see the horizon? If so, what is the smallest visibility that can be guaranteed upon arranging the trees in a suitable way? The underlying deep problem is due to Danzer (1965) and is closely related to other questions in mathematical physics and in the theory of mathematical quasicrystals. It is still open, and will be addressed with Diophantine methods by analysing the distribution of the set of points defined as the centers of the trees.Finally, another goal will be to answer some questions related to problems of effectivity (that is, to problems where it is known that a result holds, but where it is not known how to check it in any concrete example). More precisely, the focus will be on sequences of numbers satisfying a simple property such as the following: whenever, say, three consecutive ones are known, then the number coming after them can be deduced from a fixed simple rule such as adding the three given numbers and multiplying them by constants. It should be clear that the data of the first three numbers in the list and of the (fixed) rule of deduction of the fourth one determines the entire list. It can then be shown that, under favorable conditions, the number of zeros appearing in this list is always finite. The question, at the heart of deep problems of decidability in Computer Science for instance, is to be able to find a range beyond which it can be guaranteed that all terms are nonzero. This question is studied as part of the proposed project.