Mathematical Sciences: Asymptotic Methods in Combinatorial Theory

数学科学：组合理论中的渐近方法

• 批准号: 9021113
• 负责人: E. Canfield
• 金额: $ 6.27万
• 依托单位: University of Georgia Research Foundation Inc
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1991
• 资助国家: 美国
• 起止时间: 1991-07-01 至 1994-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9021113&HistoricalAwards=false
• 关键词: Mathematical; Sciences; Asymptotic; Methods; Combinatorial

This award supports the research of Professor E. Canfield to work in combinatorics. He intends to investigate asymptotic behavior of solutions to recurrence equations, maps on surfaces, cycle sizes in permutations, random partitions and Hamiltonian cycles in a class of random degree restricted graphs. 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.

该奖项支持E. Canfield教授在组合学方面的研究。他打算研究递归方程解的渐近行为，曲面上的映射，置换中的环大小，随机分区和一类随机度限制图中的哈密顿环。这项研究是在组合学的一般领域。组合学试图找到有效的方法来研究如何组织离散的对象集合。因此，它对现代通信非常重要，例如电话系统中大型网络的设计以及计算机科学中算法的设计。