虎门体育官方登录入口网

报告题目：Pattern complexity in cut and project sets

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

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

报告地点：4号楼 4232室

欢迎广大师生参加。              

             数学虎门体育app下载官网

                                    2015年3月17日

摘要：A cut and project set is a discrete set obtained by projecting a certain subset of the integer lattice onto a subspace. This procedure has an interpretation in Diophantine approximation, dynamics of a toral rotation, and in tilings. We will present some new results concerning complexity of patterns arising in cut and project setups, and discuss their connections to these interpretations. Based on joint work with Alan Haynes, Jamie Walton and Lorenzo Sadun.