{"title":"Solutions to Seven and a Half Problems on Tilings","authors":"Bojan Bašić, Aleksa Džuklevski, Anna Slivková","doi":"10.37236/11813","DOIUrl":null,"url":null,"abstract":"Four problems about tilings, related to the so-called: Heesch number, isohedral number, $m$-morphic figures, and $\\sigma$-morphic figures, can be asked in four variations of the notion of tiling: protosets with more elements, disconnected tiles, colored tiles and tessellations in larger-dimensional spaces. That makes $16$ combinations in total. Five among them have been previously solved in the literature, and one has been partially solved. We here solve seven of the remaining combinations, and additionally complete that partial solution.","PeriodicalId":11515,"journal":{"name":"Electronic Journal of Combinatorics","volume":"5 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.37236/11813","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Four problems about tilings, related to the so-called: Heesch number, isohedral number, $m$-morphic figures, and $\sigma$-morphic figures, can be asked in four variations of the notion of tiling: protosets with more elements, disconnected tiles, colored tiles and tessellations in larger-dimensional spaces. That makes $16$ combinations in total. Five among them have been previously solved in the literature, and one has been partially solved. We here solve seven of the remaining combinations, and additionally complete that partial solution.
期刊介绍:
The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.