Twenty-Second Cumberland Conference on Combinatorics, Graph Theory and Computing; Bowling Green, KY; Spring 2009

第二十二届坎伯兰组合学、图论和计算会议；

• 批准号: 0904269
• 负责人: Bela Csaba
• 金额: $ 1.23万
• 依托单位: Western Kentucky University Research Foundation
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2009
• 资助国家: 美国
• 起止时间: 2009-02-15 至 2010-01-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0904269&HistoricalAwards=false
• 关键词: Twenty; Second; Cumberland; Conference; Combinatorics

ABSTRACTTwenty-Second Cumberland Conference on Combinatorics, Graph Theory and ComputingBela CsabaAn international research conference, the Twenty-Second Cumberland Conference on Combinatorics, Graph Theory and Computing will be held from May 21-23, 2009 at Western Kentucky University in Bowling Green, Kentucky. The Cumberland Conference is an annual conference held to bring together combinatorial mathematicians and computer scientists from the southern and southeastern regions of the United States. It has been held every year since 1988, with the venue changing from year to year, moving around between universities.The conference will focus on two active areas of research: extremal and probabilistic combinatorics, and complexity theory. These areas have applications in the natural and social sciences, and form the theoretical foundation of modern information infrastructure. Combinatorial methods are used in problems of computer science, ecology, statistical physics, chemistry, logistics, applied for the reliability of transportation and communication networks such as the Internet, scheduling, and many optimization problems. Computational complexity theory is a branch of computer science which investigates the problems related to the amounts of resources required for the execution of algorithms, and in many cases uses combinatorial tools. The conference is expected to have about 100 participants, and about 60 contributed talks, arranged in two or three parallel sessions. There will be five principal speakers who will give one-hour presentations. Vitaly Bergelson (Ohio State University), Ralph Faudree (University of Memphis), Alexandr Kostochka (University of Illinois at Urbana-Champaign), Benny Sudakov (University of California at Los Angeles), and Mario Szegedy (Rutgers University) have accepted our invitations to be principal speakers. The conference is organized by a committee of six people from the Department of Mathematics and Computer Science at Western Kentucky University, the chair of the committee is Bela Csaba.

第二十二届坎伯兰组合学、图论和计算会议贝拉·卡萨巴在国际研究会议上，第二十二届坎伯兰组合学、图论和计算会议将于2009年5月21日至23日在肯塔基州鲍林格林的西肯塔基大学举行。坎伯兰会议是一年一度的会议，旨在将来自美国南部和东南部地区的组合数学家和计算机科学家聚集在一起。自1988年以来，它每年都举行，每年的地点都不同，在不同的大学之间流动。会议将集中在两个活跃的研究领域：极值和概率组合学，以及复杂性理论。这些领域在自然科学和社会科学中都有应用，构成了现代信息基础设施的理论基础。组合方法应用于计算机科学、生态学、统计物理、化学、物流等领域，应用于互联网、调度等交通通信网络的可靠性问题，以及许多优化问题。计算复杂性理论是计算机科学的一个分支，它研究与执行算法所需的资源量有关的问题，并在许多情况下使用组合工具。会议预计将有大约100人参加，约60人参与演讲，安排在两到三个平行的会议上。将有五位主要演讲者进行一小时的演讲。维塔利·伯格尔森(俄亥俄州立大学)、拉尔夫·福德里(孟菲斯大学)、亚历山大·科斯托奇卡(伊利诺伊大学厄巴纳-香槟分校)、本尼·苏达科夫(加州大学洛杉矶分校)和马里奥·塞格迪(罗格斯大学)已接受我们的邀请成为主要演讲人。这次会议是由西肯塔基大学数学和计算机科学系的六人委员会组织的，委员会主席是贝拉·卡萨巴。