{"title":"Geometrical Penrose tilings are characterized by their 1-atlas","authors":"Thomas Fernique , Victor Lutfalla","doi":"10.1016/j.tcs.2024.114883","DOIUrl":null,"url":null,"abstract":"<div><div>Penrose rhombus tilings are tilings of the plane by two decorated rhombi such that the decorations match at the junction between two tiles (like in a jigsaw puzzle). In dynamical terms, they form a tiling space of finite type. If we remove the decorations, we get, by definition, a sofic tiling space that we here call geometrical Penrose tilings. Here, we show how to compute the patterns of a given size which appear in these tilings by three different methods: two based on the substitutive structure of the Penrose tilings and the last on their definition by the cut and projection method. We use this to prove that the geometrical Penrose tilings are characterized by a small set of patterns called vertex-atlas, <em>i.e.</em>, they form a tiling space of finite type. Though considered as folklore, no complete proof of this result has been published, to our knowledge.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1022 ","pages":"Article 114883"},"PeriodicalIF":0.9000,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005000","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Penrose rhombus tilings are tilings of the plane by two decorated rhombi such that the decorations match at the junction between two tiles (like in a jigsaw puzzle). In dynamical terms, they form a tiling space of finite type. If we remove the decorations, we get, by definition, a sofic tiling space that we here call geometrical Penrose tilings. Here, we show how to compute the patterns of a given size which appear in these tilings by three different methods: two based on the substitutive structure of the Penrose tilings and the last on their definition by the cut and projection method. We use this to prove that the geometrical Penrose tilings are characterized by a small set of patterns called vertex-atlas, i.e., they form a tiling space of finite type. Though considered as folklore, no complete proof of this result has been published, to our knowledge.
期刊介绍:
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.