Mathematical Sciences: Research in Enumerative Combinatorics

该奖项支持对枚举组合学若干领域问题的研究。所有这些都涉及到生成函数方法的应用，无论是解决计数问题还是研究有理数序列。要研究的主题是二叉树，非交换对称函数，车论，非负幂级数系数的有理函数，以及广义Dedekind和。这项研究属于组合学的一般领域。组合学的目标之一是找到研究离散对象集合如何排列的有效方法。离散系统的行为对现代通信极为重要。例如，大型网络的设计，比如那些出现在电话系统中的网络，以及计算机科学中处理离散对象集的算法设计，这就利用了组合研究。

Gessel This award supports the investigations of Gessel on problems in several areas of enumerative combinatorics. All involve applications of the method of generating functions, either to solve counting problems or to study sequence of rational numbers. The topics to be studied are binary trees, noncommutative symmetric functions, rook theory, rational functions with nonnegative power series coefficients, and generalized Dedekind sums. This research is in the general area of Combinatorics. One of the goals of Combinatorics is to find efficient methods of studying how discrete collections of objects can be arranged. The behavior of discrete systems is extremely important to modern communications. For example, the design of large networks, such as those occurring in telephone systems, and the design of algorithms in computer science deal with discrete sets of objects, and this makes use of combinatorial research.