报告题目:What Makes a Bijection “Good”? A Case Study on Pattern-Avoiding Permutations

报告人：Sergey Kitaev

报告时间：4月5日  上午9：00-10：00

摘要：A bijection is a one-to-one correspondence between two sets. Often, there is more than one way to construct a bijection between equinumerous sets - and if the sets are not very small and we do not require the bijections to be intelligible, there can be many. But what makes a bijection "good"? Should it be easy to describe? Or should it reveal deeper structural similarities between the sets? While the answer “it depends” is valid, much more can be said under certain assumptions in specific contexts.In this talk, I will explore this idea through a remarkable story in the theory of permutation patterns. The talk will be accessible to a general audience.

报告人简介：Sergey Kitaev，现就职于苏格兰思克莱德大学。在哥德堡大学获得数学博士学位，师从Einar Steingrimsson。他的研究兴趣涉及组合学和图论的各个方面。其著有《排列和单词中的模式》和《文字与图表》等书，分别介绍了排列模式领域和文字表示图理论。Kitaev教授在《Journal of Combinato- rial Theory, Series A》,《Discrete Mathematics》等杂志上发表了超过 120篇文章。