Mathematical Sciences: The Combinatorics of Hyperplane Arrangements

数学科学：超平面排列的组合学

• 批准号: 9201490
• 负责人: Paul Edelman
• 金额: $ 9万
• 依托单位: University of Minnesota-Twin Cities
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1992
• 资助国家: 美国
• 起止时间: 1992-07-01 至 1996-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9201490&HistoricalAwards=false
• 关键词: Mathematical; Sciences; Combinatorics; Hyperplane; Arrangements

This award supports the research of Professor P. Edelman to work in combinatorics. He intends to investigate the combinatorics of hyperplane arrangements. This will include a detailed study of the counterexample to Orlik's conjecture and a continuation of work on h-complexes and h-shellings. The research is in the general area of combinatorics. Combinatorics attempts to find efficient methods to study how discrete collections of objects can be organized. And, so it is extremely important to modern communications, for example the design of large networks as in telephone systems and the design of algorithms in computer science.

该奖项支持P.Edelman教授从事组合学的研究。他打算研究超平面排列的组合学。这将包括对Orlik猜想的反例的详细研究，以及关于h-复形和h-壳层的继续工作。这项研究属于组合学的一般领域。组合学试图找到有效的方法来研究如何组织离散的对象集合。因此，它对现代通信极其重要，例如电话系统中的大型网络设计和计算机科学中的算法设计。