A note on reduction of tiling problems
Combinatorics
2022-11-15 v1 Logic
Abstract
We show that translational tiling problems in a quotient of can be effectively reduced or ``simulated'' by translational tiling problems in . In particular, for any , and the existence of an aperiodic tile in implies the existence of an aperiodic tile in . Greenfeld and Tao have recently disproved the well-known periodic tiling conjecture in for sufficiently large by constructing an aperiodic tile in for suitable .
Keywords
Cite
@article{arxiv.2211.07140,
title = {A note on reduction of tiling problems},
author = {Tom Meyerovitch and Shrey Sanadhya and Yaar Solomon},
journal= {arXiv preprint arXiv:2211.07140},
year = {2022}
}
Comments
10 pages, 4 figures