报告题目1:On the sum-free sets of generated by some substitution sequences
报 告 人:文志雄 教授 (华中科技大学)
报告时间:2017年04月25日(星期二)下午14:30-15:30
报告题目2:Morphisms on infinite alphabets, countable states automata and regular sequences
报 告 人: 张杰萌 博士 (武汉工程大学)
报告时间:2017年04月25日(星期二)下午15:30-16:30
报告地点:4号楼4135室
欢迎广大师生前往!
数学学院
2017年04月21日
报告1摘要:
Cameron introduced a bijection between the set of sum-free sets and the set of all zero–one sequences. We study the sum-free sets of natural numbers corresponding to certain zero–one sequences which contain the Cantor-like sequences, the generalization of the period-doubling sequences and some invertible substitution sequences, etc. Such sum-free sets considered as integer sequences are regular sequences (whose difference sequences are automatic) or their difference sequences are substitution sequences (maybe they are not automatic).
报告2摘要:
k-regular sequences are the generalization of k-automatic sequences. We prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the regularity of some regular sequences is invariant under some coding.