Markoff Surfaces and Superstrong Approximation
Markoff Surfaces and Superstrong Approximation
批准号:
1603715
负责人:
Alexander Gamburd
金额:
$18.0万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2016
资助国家:
美国
项目状态:
已结题
起止时间:
2016-06-01 至 2021-05-31
中文摘要
无理数的存在自古以来就一直吸引着人类,用有理数逼近无理数在理论和应用上都具有重要意义。马尔科夫丢番图方程出现在马克夫的基本工作中(1879年),它描述了那些极难逼近的无理数。这个方程式出现在数学的几个领域。它的整数解具有树形结构,对这些Markoff数(第一个与黄金比例有关,在某种意义上是最差逼近的无理数)的算术性质的研究导致了图论中的重要问题。本研究项目研究与马尔可夫树相关的图的连通性。除了对数论的重要性外,这项研究还与乘积替换算法(计算群论中最流行但仍鲜为人知的工具)和计算机科学中的扩展图有着深刻的联系和应用。对马尔科夫数的算术性质的研究导致了通过马尔可夫树的模约简得到的图是否连通(强逼近)的问题。超强近似是指断言这些图实际上是高度连通的,也就是说形成了一族扩展器。在过去的十年里,稀疏群(无限指数的Zariski稠密子群)的超强逼近领域的活动出现了显着的爆炸性增长。许多研究都是由仿射筛子的开发推动的。对于Zariski闭包的Levi因子为半单的薄群,其强、超强逼近及其在仿射筛子中的应用到目前为止已被熟知。另一方面,环面提出了特别困难的问题,无论是在轨道元素的稀疏性及其丢番图性质方面,还是在强逼近方面,在这种情况下,这相当于Artin的原根猜想。这项研究项目将在介于Tori和细线性群之间的难度水平的设置下研究强和超强逼近,即由Markoff方程定义的曲面上的非线性作用以及其他Markoff类型曲面的背景下的强和超强逼近。细线性群的超强逼近结果将在本研究中发挥重要作用,与Lang猜想和代数PainlevéVI方程分类有关的技术和方法也将在本研究中发挥重要作用。
英文摘要
The existence of irrational numbers has fascinated mankind since antiquity; their approximation by rational numbers is of great importance in both theory and applications. The Markoff Diophantine equation arose in Markoff's fundamental work (in 1879) characterizing those irrationals that are badly approximable. The equation arises in several fields of mathematics. Its integer solutions have a tree structure, and investigation of the arithmetic properties of these Markoff numbers (the first of which is associated with the golden ratio, in a sense the most badly approximable irrational number) leads to important questions in graph theory. This research project investigates the connectivity of graphs related to the Markoff tree. In addition to its importance for number theory, this investigation has deep connections and applications to, among other topics, the product replacement algorithm (the most prevalent but still poorly understood tool in computational group theory) and expander graphs in computer science.Investigation of the arithmetic properties of Markoff numbers leads to the question of whether the graphs obtained by the modular reduction of the Markoff tree are connected (strong approximation). Superstrong approximation is the assertion that these graphs are in fact highly connected, that is to say form a family of expanders. The past decade saw a remarkable explosion of activity in the area of superstrong approximation for thin groups (Zariski dense subgroups of infinite index). Much of the research was driven by development of the affine sieve. In the case of thin groups with Levi factor of its Zariski closure semisimple, the strong and superstrong approximation and their applications in affine sieve are by now well-understood. On the other hand, the tori pose particularly difficult problems, both in terms of sparsity of elements in an orbit and their Diophantine properties as well as in terms of strong approximation, which in this case amounts to Artin's primitive root conjecture. This research project will investigate strong and superstrong approximation in a setting that is intermediate in level of difficulty between that of tori and that of thin linear groups, namely, that of nonlinear actions on a surface defined by the Markoff equation as well as in the context of other surfaces of Markoff type. Superstrong approximation results for thin linear groups will play an important role in this investigation, as will techniques and methods related to progress on Lang's conjecture and to the classification of algebraic Painlevé VI equations.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
CAREER: Expander Graphs: Interactions between Arithmetic, Group Theory and Combinatorics
-
批准号:0645807
-
项目类别:Standard Grant
-
资助金额:$40.0万
-
财政年份:2007
-
负责人:Alexander Gamburd
-
依托单位:
Interactions Between Random Matrix Theory, Number Theory and Combinatorics
-
批准号:0501245
-
项目类别:Continuing Grant
-
资助金额:$0.0万
-
财政年份:2005
-
负责人:Alexander Gamburd
-
依托单位:
Expander Graphs, Random Matrices, and Quantum Chaos
-
批准号:0102023
-
项目类别:Fellowship Award
-
资助金额:$9.0万
-
财政年份:2001
-
负责人:Alexander Gamburd
-
依托单位:
海外基金