Hyperbolic regular polygons with notched edges (Q2486860): Difference between revisions

The tiling problem is: Can one always decide in some algorithmic manner, when given an arbitrary collection of tiles (i.e., a protoset), whether or not the given protoset tessellates the plane? In the paper the tiling problem is solved when a tile \(T\) is hyperbolic or a Euclidean regular polygon whose edges are notched with matching bumps and nicks. In the case when the interior vertex angle of \(T\) is \(2\pi/q\), \(q\geq 4\), either it is possible to tessellate the plane, or it is not possible to make any layer (corona) that can be formed of copies of a tile \(T\) around a single centrally placed one, i.e. the Heesch number is either \(H(T)= \infty\), or \(H(T)= 0\). When \(q= 3\), besides previous possibilities it is also possible \(H(T)= 1\) for some classes of tiles (i.e. tile \(T\) has maximally one corona).