Permutation Patterns 2016

第14届排列模式国际会议将于2016年6月27日至7月1日在华盛顿特区的霍华德大学举行。会议将为排列模式领域的演讲者提供高质量的计划，并为初级和高级研究人员以及来自世界各地的参与者提供合作机会。会议将有两个全体会议的发言，时长一小时，还有一些专题演讲，每次时长30分钟。研究人员将展示他们的新成果，并将有时间进行公开讨论，探讨该领域尚未解决的问题。该奖项支持来自美国的学生和早期职业数学家前往会议。这次会议是一系列致力于排列模式领域的年度会议的一部分。自2003年由新西兰奥塔哥大学主办的第一届会议以来，每年都会在世界各地的不同机构举行：北美、欧洲、亚洲和大洋洲。预计约有70名与会者，约有35至40名与会者参加，没有平行会议。会议已通过分发清单、AMS和其他数学活动日历以及相关的会议网站（会议网站为https://permutationpatterns2016.wordpress.com）进行宣传。会议将重点介绍排列模式及其应用领域的最新研究。会议的主要主题包括模式类的结构理论、模式类的渐近行为、广义模式回避、填充密度以及算法和可决性问题。该领域的研究受到理论计算机科学的影响，其历史起源可以追溯到对分拣机的研究。对排列模式的组合兴趣集中在最重要的枚举和打包问题上，例如，确定如何在排列中尽可能频繁地嵌入一个模式的极值问题。排列的统计数据也进入了画面，引起了概率学家的注意。预计这次会议将对数学和计算机科学的各个不同研究领域产生广泛的影响。

The 14th International Conference on Permutation Patterns will be held at Howard University in Washington, DC, from June 27 to July 1, 2016. The conference will provide a high quality program of speakers in the area of permutation patterns with opportunities for collaboration between junior and senior researchers, as well as between participants from around the world. The conference will feature two plenary one-hour speakers and a number of contributed talks, each of thirty minutes long. Researchers will present their new results and there will be time for open discussions to explore unsolved problems in the field. This award supports travel to the conference by students and early career mathematicians from the United States. This conference is part of a series of annual conferences devoted to the area of permutation patterns. Ever since the first conference in 2003, which was hosted by the University of Otago in New Zealand, it has been held every year at different institutions around the world: in North America, Europe, Asia and Australasia. About 70 participants are anticipated, with about 35-40 contributed talks with no parallel sessions. The conference has been publicized through distribution lists, AMS and other mathematical event calendars, and related conference websites (the conference website is at https://permutationpatterns2016.wordpress.com). The conference will feature current research in the area of permutation patterns and its applications. Major themes in the conference include the structural theory of pattern classes, asymptotic behavior of pattern classes, generalized pattern avoidance,packing densities, and algorithmic and decidability problems. Research in the area is influenced by theoretical computer science, and traces its historical origins to the study of sorting machines. Combinatorial interest in permutation patterns focuses on centrally important enumeration and packing problems, for instance the extremal problem to determine how one pattern can be embedded as often as possible in a permutation. The statistics of permutations also enters into the picture, garnering attention from probabilists. The conference is expected to have a wide impact on a variety of different research areas in mathematics and computer science.