Directions in Quantitative Topology

定量拓扑方向

• 批准号: 0504721
• 负责人: Shmuel Weinberger
• 金额: $ 29万
• 依托单位: University of Chicago
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2005
• 资助国家: 美国
• 起止时间: 2005-08-01 至 2009-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0504721&HistoricalAwards=false
• 关键词: Directions; Quantitative; Topology

Weinberger plans to develop both quantitative versions of known theorems of algebraic and geometric topology, extending the basic ideas of controlled topology into directions of both more and less smoothness. In part, this interacts with logic and computer science, as in the analysis of Dehn functions, and applications of Kolmogorov complexity arguments to variational problems, but the goal is to get more realistic upper and lower bounds on specific (solvable) topological problems. A subsidiary task is to understand the "information based complexity" of geometric problems, and understand the rates of growth of various sets arising in classification problems via the philosophy of the Goodwillie calculus. The motivation for this comes from a number of directions, both applied and theoretical. In applications of topology to experimental sciences, one rarely has as explicit space to study: one has large data sets, and the investigator must infer an underlying space. The features that often arise as hypotheses in mathematical theorems cannot simply be seen: they must be detected. One problem to be studied is how to determine, say, the dimension of such an underlying space. After that come problems of implementing software and understanding how much data one needs to make reliable estimates. Another sort of problem comes from the existence of singularities in many equations of applied mathematics and geometry. As topology usually confines itself to the study of continuous maps, the implication of discontinuities of various sorts could potentially be of use. Finally, in many problems of pure geometry, the detailed structure of solutions which have only been proved to exist, but which have never been "seen" would be of great value. Reproving their existence with quantitative estimates should lead to a better understanding of their nature.

Weinberger计划开发已知代数和几何拓扑定理的定量版本，将控制拓扑的基本思想扩展到更多和更少平滑的方向。在某种程度上，这与逻辑和计算机科学相互作用，如在Dehn函数的分析中，以及Kolmogorov复杂性参数在变分问题中的应用，但目标是在特定（可解）拓扑问题上获得更现实的上限和下界。辅助任务是理解几何问题的“基于信息的复杂性”，并通过古德威利微积分的哲学理解分类问题中出现的各种集合的增长速度。这样做的动机来自许多方向，包括应用和理论。在拓扑学在实验科学中的应用中，人们很少有明确的空间来研究：人们有大量的数据集，研究者必须推断出一个潜在的空间。在数学定理中经常作为假设出现的特征不能简单地看到：它们必须被探测到。需要研究的一个问题是如何确定，比如说，这样一个底层空间的维度。接下来的问题是实现软件和理解需要多少数据才能做出可靠的估计。另一类问题来自于许多应用数学和几何方程中奇点的存在。由于拓扑学通常局限于对连续映射的研究，因此各种不连续性的含义可能会有潜在的用途。最后，在许多纯几何问题中，只被证明存在但从未被“看到”的解的详细结构将是很有价值的。用定量估计来证明它们的存在，应该能使我们更好地了解它们的性质。