Rotafest: A Conference in Honor of Gian-Carlo Rota; April 17-20, 1996; Cambridge, MA

Rotafest：纪念 Gian-Carlo Rota 的会议；

• 批准号: 9600082
• 负责人: Richard Stanley
• 金额: --
• 依托单位: Massachusetts Institute of Technology
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1996
• 资助国家: 美国
• 起止时间: 1996-04-01 至 1996-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9600082&HistoricalAwards=false
• 关键词: Rotafest; Conference; Honor; Gian; Carlo

This award provides support Rotafest, a conference in honor of the 64th birthday of Gian-Carlo Rota. The conference will be held at Massachusetts Institute of Technology on April 17--20, 1996. The subject of the talks is not being restricted other than that they be connected to the work of Professor Rota. It is expected that most of the talks will be in combinatorics or algebraic combinatorics. The main object of the conference is to provide a perspective on the multitude of work that has taken place in these areas in the past thirty years and to provide impetus for further work. Combinatorics attempts to find efficient methods to study 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. In addition, the type of enumerative information being sought in this project has been of use in the design of geometric algorithms for problems in robotics and motion planning.

这个奖项提供了支持Rotafest，在吉安-卡洛罗塔64岁生日的荣誉会议。会议将于1996年4月17日至20日在马萨诸塞州理工学院举行。 会谈的主题不受限制，只是与罗塔教授的工作有关。预计大部分的会谈将在组合或代数组合。会议的主要目的是对过去三十年来在这些领域开展的大量工作提供一个视角，并为进一步的工作提供动力。 组合数学试图找到有效的方法来研究如何安排离散的对象集合。离散系统的行为对现代通信极为重要。例如，大型网络的设计，如电话系统中的网络设计，以及计算机科学中的算法设计，都要处理离散的对象集，这就需要使用组合研究。此外，在这个项目中所寻求的枚举信息的类型已在机器人和运动规划问题的几何算法的设计中使用。