Seminars on Discrete Mathematics：Universal partial words for combinatorial structures

：Sergey Kitaev（英国思克莱德大学）
：2023-03-28 10:00
：厦大海韵园数理大楼686会议室

报告人：Sergey Kitaev（英国思克莱德大学）

时  间：2023年3月28日上午10:00-11:30

地  点：厦大海韵园数理大楼686会议室

内容摘要:

A universal word  for a finite alphabet A and some positive integer n is a word over A such that every word of length n appears exactly once as a (consecutive) subword. It is well known and is easy to prove that universal words exist for any A and n. The notion of a universal word was extended to other combinatorial structures (admitting encoding by words).

Universal partial words are words that in addition to the letters from A may contain an arbitrary number of a special “joker” symbol, which can be substituted by any letter from A. The study of universal partial words was initiated by Chen, Kitaev, Mutze and Sun.

In my talk, I will discuss a number of existence and non-existence results related to universal partial words, and will discuss ways to shorten universal cycles and universal words for permutations.

个人简介：

Sergey Kitaev，英国思克莱德大学理学院副院长、教授。2003年博士毕业于瑞典哥德堡大学。主要研究组合计数问题，完成了置换与词和图的两本著作，在J. Combin. Theory Ser. A，Adv in Appl. Math., European J. Combin.等杂志上发表多篇文章。先后主持过冰岛和英国国家基金委的项目，并多次被邀请在重要组合数学会议上做大会报告。

 

联系人：靳宇