关于举行Henna Koivusalo博士学术报告的通知

报告题目：Patterncomplexity in cut and project sets

报告人：HennaKoivusalo博士（英国约克大学数学系）

报告时间：2015年3月25日（周三）下午3：00-4：00

报告地点：4号楼4232室

欢迎广大师生参加。              

             数学学院

                                   2015年3月17日

摘要：Acut and project set is a discrete set obtained by projecting acertain subset of the integer lattice onto a subspace. This procedurehas an interpretation in Diophantine approximation, dynamics of atoral rotation, and in tilings. We will present some new resultsconcerning complexity of patterns arising in cut andproject setups, and discuss their connections to theseinterpretations. Based on joint work with Alan Haynes, Jamie Waltonand Lorenzo Sadun.