数苑讲座之三：Polynomial mean complexity and Sarnak conjecture

发布时间：2021-09-17 来源：赢咖3 浏览次数：

Speaker:	黄文	DateTime:	2021年9月20日（周一）下午4:50-5:50
Brief Introduction to Speaker: 黄文教授，中国科技大学。		Place:	6号楼二楼报告厅
Abstract:We will review some recent progresses in Sarnak conjecture related to complexity. In particular, we will investigate the relation between {0,1}- sequences with polynomial mean complexity and the Logarithmic Sarnak conjecture.