Braids, Resolvent Degree and Hilbert's 13th Problem

辫子、解决度和希尔伯特第十三问题

• 批准号: 1811772
• 负责人: Benson Farb
• 金额: $ 55.5万
• 依托单位: University of Chicago
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2018
• 资助国家: 美国
• 起止时间: 2018-07-15 至 2023-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1811772&HistoricalAwards=false
• 关键词: Braids; Resolvent; Degree; Hilbert; 13th

Polynomial equations are everywhere. They are used to describe, explain and predict the motion of any object undergoing a force (gravitational, electrical, etc); they are used to model financial, chemical and biological systems; and they are part of computer algorithms that we use every day. The oldest and perhaps most fundamental problem about polynomials are to understand their solutions; in particular, how the roots (i.e. solutions) of a polynomial depend on its coefficients. The purpose of this project is to use the incredible power of modern mathematics in order to shed new light on this question.One of the main themes in understanding polynomials is to determine the minimal number of parameters R(n) to which the solution of a general degree n polynomial can be reduced. A huge amount of work in the 16th-19th centuries was devoted to giving upper bounds on R(n). Hilbert's 13th Problem (and related conjectures) posits some specific lower bounds on R(n), but until now no nontrivial lower bound has been shown. The formal notion of "resolvent degree" (due to Brauer and Arnol'd-Shimura) makes the definition of R(n) explicit. J. Wolfson and the investigator have built a framework in which these problems are put in a much broader context, which includes for example many problems from enumerative algebraic geometry. With M. Kisin, the investigator is using this new point of view, together with powerful modern tools, to attack Hilbert's problems.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

多项式方程到处都是。 它们被用来描述、解释和预测任何物体在力（引力、电等）作用下的运动;它们被用来模拟金融、化学和生物系统;它们是我们每天使用的计算机算法的一部分。 关于多项式的最古老，也可能是最基本的问题是理解它们的解;特别是，多项式的根（即解）如何依赖于它的系数。这个项目的目的是利用现代数学的不可思议的力量，以揭示这个问题的新的光。在理解多项式的主要主题之一是确定的最小数量的参数R（n）的解决方案的一般n次多项式可以减少。 大量的工作在16 - 19世纪致力于给上界的R（n）。希尔伯特第13问题（及相关命题）在R（n）上设定了一些特定的下界，但直到现在还没有非平凡的下界被证明。 “预解度”的形式概念（由于Brauer和Arnol 'd-Shimura）使R（n）的定义明确。 J.沃尔夫森和研究者建立了一个框架，在这个框架中，这些问题被放在一个更广泛的背景下，其中包括例如枚举代数几何中的许多问题。 与M.该奖项反映了NSF的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。