Mathematical Sciences: One Day Combinatorics and Graph Theory Conferences

该奖项支持哈斯教授组织一系列关于组合学和图论的研讨会。这些会议将主要用作新英格兰教职员工和研究生见面和交流思想的论坛。这类会议以前也曾举行过，并被证明是成功的。特别是，它们有可能对促进参与者的职业生涯产生巨大影响。由于这些会议吸引了大量女性数学家，这是增加成功女性数学家数量的独特机会。这项研究属于组合学的一般领域。组合学试图找到有效的方法来研究如何组织离散的集合。离散系统的行为对于现代通信来说是极其重要的。例如，大型网络的设计，如电话系统，以及计算机科学中的算法设计，都涉及离散对象，这利用了组合研究。

This award supports Professor Haas to organize a series of workshops in combinatorics and graph theory. These meetings will mainly be used as a forum for faculty and graduate students in New England to meet and exchange ideas. Meetings of this type have been held before and they have proven to be successful. In particular, they have the potential to have great impact in promoting the careers of the participants. Since these meetings have attracted a good number of women mathematicians, this represents a unique opportunity to increase the number of successful female mathematicians. The research is in the general area of combinatorics. Combinatorics attempts to find efficient methods to study how discrete collections can be organized. The behavior of discrete systems 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 all deal with discrete objects, and this makes use of combinatorial research.