Sphere packings and related extremal problems

本文研究了度量空间中的球体填充问题、其他点分配问题以及相关的组合对象问题。通过在美国和国外举行的会议和座谈会介绍调查结果，将扩大对这些主题的讨论，并激发进一步的发展。同样，研究人员希望为教育目标做出贡献，即告知下一代数学家并激励他们进行自己的相关研究。研究人员将采用两种主要方法分析极值点分配。阻塞或不可约图的方法可以追溯到Schutte和van der Waerden， Fejes Toth和Danzer，并且与刚性理论直接相关。正定约束的方法已被用于分析点构型的性质，并导出其大小的界限，依赖于勋伯格，Bochner和Delsarte的经典作品。PI和co-PI打算解决n大于13的Tammes问题，对二维球面上的不可约图进行分类，并描述其他表面（包括n大于8的方形平面环面）和高维上的最优球面填充。研究人员还将尝试量化正定松弛对点集描述的影响以及已知德尔萨特界对码的准确性。通过对少距离集的分析，PI和co-PI将为经典的组合问题提供新的工具；而在这些集合的研究中使用的几何思想可能会导致寻找强正则图和原始关联方案约束的新方法。德劳内三角剖分法是分析球体填料和覆盖物的重要工具；PI和co-PI打算将已知结果扩展到更大的点构型集合，并寻找新的全维函数，其中Delaunay三角剖分总是最优的。

This proposal is devoted to the problems of sphere packings in metric spaces, other point allocations, and related combinatorial objects. The presentation of the findings through conferences and colloquia, both in the USA and abroad, will broaden the discussion of these topics and inspire further developments therein. Likewise the investigators expect to contribute to the educational goal of informing the next generation of mathematicians and inspiring them to conduct related research of their own.The investigators will employ two major methods of analyzing extremal point allocations. The method of jammed or irreducible graphs goes back to Schutte and van der Waerden, Fejes Toth, and Danzer, and is directly related to the rigidity theory. The method of positive definite constraints that has been used to analyze the properties of point configurations, and to derive bounds on their size, relies on classical works of Schoenberg, Bochner, and Delsarte. The PI and co-PI intend to solve the Tammes problem for values of n larger than 13, classify irreducible graphs on a two-dimensional sphere, and describe optimal sphere packings on other surfaces (including a square flat torus with n larger than 8) and in higher dimensions. The investigators will also attempt to quantify the impact of the positive definite relaxation on the description of point sets and the accuracy of the known Delsarte bounds on codes. Through the proposed analysis of few-distance sets, the PI and co-PI will contribute new tools to a classic combinatorial problem; while geometric ideas used in the study of such sets could lead to new approaches to finding constraints on strongly regular graphs and primitive association schemes. Delaunay triangulations provide an important tool for analysis of sphere packings and coverings; the PI and co-PI intend to extend known results to a larger set of point configurations and to find new all-dimensional functionals for which a Delaunay triangulation is always optimal.