学术报告通知
题目:
From squares in words to squares in permutations
报告人:
Sergey Kitaev (University of Strathclyde)
时间:
4月23日(周四) 下午3:00
地点:
博理楼B108
摘要:
This talk explores the notion of squares, repeated consecutive blocks, from the classical setting of combinatorics on words to the world of permutations. After reviewing square-free words and their historical development, including Thue’s constructions, we introduce an appropriate definition of squares in permutations based on pattern equivalence. We then address fundamental questions about square-free permutations, including their existence and asymptotic growth.
简介:
Kitaev 教授的研究兴趣涉及组合数学和图论及其应用的各个方面,已在《Journal of Combinatorial Theory, Series A》、《Physical Review Letters 》等期刊发表140 余篇论文,并著有专著《Patterns in Permutations and Words》、《Words and Graphs》。现任《Journal of Combinatorial Theory, Series A》和《Proceedings of the Edinburgh Mathematical Society》 编委。