{"title":"Planar Rosa: a family of quasiperiodic substitution discrete plane tilings with 2n-fold rotational symmetry","authors":"Jarkko Kari, Victor H. Lutfalla","doi":"10.1007/s11047-022-09929-8","DOIUrl":null,"url":null,"abstract":"<p>We present Planar Rosa, a family of rhombus tilings with a 2<i>n</i>-fold rotational symmetry that are generated by a primitive substitution and that are also discrete plane tilings, meaning that they are obtained as a projection of a higher dimensional discrete plane. The discrete plane condition is a relaxed version of the cut-and-project condition. We also prove that the Sub Rosa substitution tilings with 2<i>n</i>-fold rotational symmetry defined by Kari and Rissanen do not satisfy even the weaker discrete plane condition. We prove these results for all even <span>\\(n\\geqslant 4\\)</span>. This completes our previously published results for odd values of <i>n</i>.</p>","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":"9 3","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2022-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Natural Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11047-022-09929-8","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
We present Planar Rosa, a family of rhombus tilings with a 2n-fold rotational symmetry that are generated by a primitive substitution and that are also discrete plane tilings, meaning that they are obtained as a projection of a higher dimensional discrete plane. The discrete plane condition is a relaxed version of the cut-and-project condition. We also prove that the Sub Rosa substitution tilings with 2n-fold rotational symmetry defined by Kari and Rissanen do not satisfy even the weaker discrete plane condition. We prove these results for all even \(n\geqslant 4\). This completes our previously published results for odd values of n.
期刊介绍:
The journal is soliciting papers on all aspects of natural computing. Because of the interdisciplinary character of the journal a special effort will be made to solicit survey, review, and tutorial papers which would make research trends in a given subarea more accessible to the broad audience of the journal.