Supplemental Funding for a Conference on: Combinatorics, groups, algorithms, and complexity; March 2010; Columbus, OH

会议的补充资金：组合学、群、算法和复杂性；

• 批准号: 0946649
• 负责人: Akos Seress
• 金额: $ 2万
• 依托单位: Ohio State University Research Foundation -DO NOT USE
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2009
• 资助国家: 美国
• 起止时间: 2009-12-01 至 2010-11-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0946649&HistoricalAwards=false
• 关键词: Supplemental; Funding; Conference; Combinatorics; groups; Supplemental; Funding; Conference; Combinatorics; groups

ABSTRACTPrincipal Investigator: Seress, Akos Proposal Number: DMS - 0946649Institution: Ohio State University Research Foundation Title: Supplemental Funding for a Conference on: Combinatorics, groups, algorithms, and complexityA conference on ``Combinatorics, groups, algorithms, and complexity'' will be held on March 21-24, 2010, at The Ohio State University. The objective of the conference is to provide a forum to explore the manifold interactions between the branches of mathematics and computer science named in the title. Ever since the inception of the polynomial-time paradigm in the late 1960s, theoretical computer science has been a major consumer of concepts and techniques developed in combinatorics, and, conversely, the conceptual frameworks developed in algorithms and complexity theory have transformed much of combinatorics. As the relatively young areas of combinatorics and complexity theory have matured in the past decades, algebraic methods have become increasingly relevant to each. Group theory has played an important role both as a source of techniques and as a subject of rigorous algorithmic study, with the subarea of asymptotic group theory leading the way in the interaction.The subareas to be covered include but are not limited to arithmetic combinatorics, asymptotic group theory, automorphism groups of combinatorial structures, vertex-transitive graphs, expanders, combinatorial models of computation (circuits, decision trees, communication complexity, etc.), probabilistically checkable proofs and approximation algorithms, derandomization, algebraic graph theory, abelian sandpiles, algorithmic problems in combinatorics and algebra, mathematical problems motivated by problems in algorithms and complexity theory. This interdisciplinary conference will focus on the crossfertilization between the areas of combinatorics, group theory, algorithms, and complexity theory, the first two being areas of mathematics and the last two - areas of theoretical computer science. Each of these areas has significantly contributed to the development of the others over the past decades. It is expected that the conference will increase our understanding of the deeper mathematical issues that underlie the connections between these areas, with implications to each of the areas concerned. A particular occasion for this meeting will be the 60th birthday of Laszlo Babai whose work has been influential in developing connections between these fields.

摘要大文研究者：Seress，Akos建议编号：DMS -0946649 INSTITITION：俄亥俄州立大学研究基金会标题：补充会议的补充资金：组合，组，算法，算法和Complextitya会议```````'会议的目的是提供一个论坛，以探索数学分支与标题中指定的计算机科学分支之间的多种互动。自1960年代后期多项式范式启动以来，理论计算机科学一直是组合学中开发的概念和技术的主要消费者，相反，在算法和复杂性理论中开发的概念框架已经改变了很多组合学。在过去的几十年中，组合学和复杂性理论的相对年轻领域已经成熟，代数方法已经变得越来越相关。 Group theory has played an important role both as a source of techniques and as a subject of rigorous algorithmic study, with the subarea of​​ asymptotic group theory leading the way in the interaction.The subareas to be covered include but are not limited to arithmetic combinatorics, asymptotic group theory, automorphism groups of combinatorial structures, vertex-transitive graphs, expanders, combinatorial models of computation （电路，决策树，沟通复杂性等），概率可检查的证明和近似算法，降低的态度，代数图理论，Abelian Sandpiles，组合术和代数中的算法问题，数学问题，算法和复杂性理论中的问题所激发的数学问题。这次跨学科会议将重点关注组合学，小组理论，算法和复杂性理论之间的交叉利用，前两个是数学领域以及理论计算机科学的最后两个领域。 在过去的几十年中，这些领域中的每一个都为其他领域的发展做出了重大贡献。 预计会议将增加我们对这些领域之间联系的更深层次数学问题的理解，这对每个领域的影响。 这次会议的一个特殊场合将是Laszlo Babai的60岁生日，他的工作在这些领域之间建立联系一直具有影响力。