Mathematical Sciences: Asymptotic Methods in Combinatorial Theory

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

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.