基本信息
浏览量:2
职业迁徙
个人简介
Wang tiles are unit squares with colored markings on each side; they may be used to tesselate the plane, but only with tiles that have matching colors on adjoining edges. The problem of determining whether a set of Wang tiles forms a valid tessellation is undecidable, and its undecidability rests on finding sets of Wang tiles that can only tesselate the plane aperiodically, in such a way that no translation of the plane is a symmetry of the tiling. The first set of aperiodic Wang tiles found, by Robert Berger, had over 20,000 different tiles in it. Kari reduced the size of this set to only 14, by finding a set of tiles that (when used to tile the plane) simulates the construction of a Beatty sequence by Mealy machines The same approach was later shown to lead to aperiodic sets of 13 tiles, the minimum known. Kari has also shown that the Wang tiling problem remains undecidable. in the hyperbolic plane, and has discovered sets of Wang tiles with additional mathematical properties.
研究兴趣
论文共 181 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
Jarkko Kari, Victor H. Lutfalla
Natural Computing: an international journalno. 3 (2022): 539-561
引用0浏览0EI引用
0
0
Automata and Complexitypp.345-358, (2022)
Advances in Intelligent Systems and ComputingProceedings of First Asian Symposium on Cellular Automata Technologypp.17-25, (2022)
Jarkko Kari, Victor H. Lutfalla
Discrete & Computational Geometryno. 2 (2022): 349-398
引用0浏览0EI引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn