报告主题:Some topics on combinatorics on words
报 告 人:李硕 副教授
报告时间:2025年 10月28日(星期二)下午15:00-16:00
报告地点:清清文理楼 3A02
邀 请 人:武文 教授
欢迎广大师生前往!
数学学院
2025年10月21日
报告摘要:
Combinatorics on words is an important branch of mathematics that has attracted considerable attention since the early 1900s, beginning with the work of Thue. In this talk, I will demonstrate how problems in this field can be solved using graph and group theory. The talk is divided into three parts: first, I will discuss pattern-counting in finite words using graph representations; second, I will address the uniform distribution property of automatic sequences; and finally, if time permits, I will present my approach to several conjectures concerning the Oldenburger-Kolakoski sequence.
报告人介绍:
李硕,博士,北京航空航天大学国际创新研究院副教授。于2020年博士毕业于索邦大学,之后前往加拿大魁北克大学蒙特利尔分校、温尼伯大学从事博士后研究。2025年入职北航国新院。研究兴趣为词的组合、自动机序列、迭代序列以及与之相关的数论、图论问题。目前在Combinatorial Theory, Advances in Applied Mathematics等期刊发表文章十余篇。
