Special Year Workshops on Combinatorics and Complexity

组合学和复杂性特别年研讨会

• 批准号: 1742283
• 负责人: Madhu Sudan
• 金额: $ 9.6万
• 依托单位: Harvard University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2017
• 资助国家: 美国
• 起止时间: 2017-09-01 至 2018-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1742283&HistoricalAwards=false
• 关键词: Special; Year; Workshops; Combinatorics; Complexity

The Special Year Workshops on Combinatorics and Complexity award supports four workshops at the interface of the two fields during the periods of 2-6 October 2017, 13-17 November 2017, 5-9 February 2018, and 9-13 April 2018 at the Harvard Center of Mathematical Sciences and Applications (CMSA) in Cambridge, Massachusetts. Combinatorics and Computational Complexity have enjoyed a rich history of interaction leading to many significant developments in the two fields, such as the theories of NP-completeness, expander graphs, pseudorandomness, and property testing. Lately these fields have seen many new points of intersection such as in the development of the polynomial method (used, for example, in recent advances on the cap-set problem as well as in development of optimal list-decodable codes), the method of interlacing families of polynomials (yielding Ramanujan graphs and the resolution of the Kadison-Singer problem), and the theory of randomness extractors (yielding explicit constructions of Ramsey graphs. The base funding for the workshops will be provided by the Harvard CMSA and will enable the participation of senior visitors and a core group of leaders in the fields. Additional funding provided by this award will support the travel and local arrangements of graduate students, postdocs, junior researchers, members of underrepresented groups, and those without other forms of support. Topics to be covered by the workshops include: (1) Additive Combinatorics (organized by Ben Green, Swastik Kopparty, Ryan O'Donnell and Tamar Zeigler). (2) Algebraic Methods in Combinatorics (organized by Zeev Dvir, Larry Guth and Shubhangi Saraf). (3) Probabilistic and Extremal Combinatorics (organized by David Conlon and Benjamin Sudakov) and (4) Coding and Information Theory (organized by Alexander Barg, Venkatesan Guruswami, and Mary Wootters). Further information on the workshops and other special year activities may be found at http://cmsa.fas.harvard.edu/combinatorics/.

组合学和复杂性特别年度研讨会奖支持在2017年10月2日至6日，2017年11月13日至17日，2018年2月5日至9日和2018年4月9日至13日期间在哈佛数学科学与应用中心（CMSA）在马萨诸塞州剑桥举行的两个领域的接口的四个研讨会。 组合学和计算复杂性有着丰富的相互作用的历史，导致了这两个领域的许多重大发展，如NP完全性理论，扩展图，伪随机性和属性测试。 最近，这些领域出现了许多新的交叉点，例如多项式方法的发展（例如，在帽集问题的最新进展以及最佳列表可解码代码的开发中使用），交错多项式族的方法（产生拉马努金图和卡迪森-辛格问题的解决），和随机性提取器的理论（产生Ramsey图的显式构造。讲习班的基本资金将由哈佛大学公共管理学院提供，并将使高级访问者和外地领导人核心小组能够参加。该奖项提供的额外资金将支持研究生，博士后，初级研究人员，代表性不足的群体成员以及没有其他形式支持的人的旅行和当地安排。讲习班的主题包括：（1）加法组合学（由Ben绿色、Swastik Kopparty、Ryan奥唐纳和Tamar Zeigler组织）。(2)组合数学中的代数方法（由Zeev Dvir，Larry Guth和Shubhangi Saraf组织）。(3)概率与极值组合学（由大卫康伦和本杰明·苏达科夫组织）和（4）编码与信息理论（由亚历山大·巴格、文卡特桑·古鲁斯瓦米和玛丽·伍特斯组织）。关于讲习班和其他特别年活动的进一步资料，可查阅http://cmsa.fas.harvard.edu/combinatorics/。