Heesch's Tiling Problem
نویسنده
چکیده
1. INTRODUCTION. Let T be a tile in the plane. By calling T a tile, we mean that T is a topological disk whose boundary is a simple closed curve. But also implicit in the word " tile " is our intent to use congruent or reflected copies of T to cover the plane without gaps or overlapping; that is, we want to tessellate the plane with copies of T. In a minor abuse of language, one often speaks of T (as opposed to copies of it) as tiling or tessellating the plane, in the sense that T generates a tessellation. A tessellation by T may or may not be possible, so in order to learn something of T 's abilities with regard to tessellating the plane, we perform the following procedure: around a centrally placed copy of T , we attempt to form a full layer, or corona, of congruent copies of T. We require as part of the definition that no point of T should be visible from the exterior of a corona to a Flatland creature in this plane. Also, we should form the corona without allowing gaps or overlapping, just as if we were building a tessellation. If a corona can be formed, then we attempt to surround this corona with yet another corona, and then another, and so on; if we get stuck, we go back and change a previously placed tile and try again. If T tessellates the plane, then this procedure will never end. On the other hand, if T does not tessellate the plane, and if we check all of the possible ways of forming a first corona, a second corona, and so forth, we will find that there is a maximum number of coronas that can be formed. This maximum number of layers that can be formed around a single centrally placed copy of T is called the Heesch number of T and is denoted by H (T). We consider a few examples before proceeding. Consider first a regular hexagon. All bees know that a regular hexagon tessellates the plane, so H = ∞ for a regular hexagon. Next consider a regular pentagon. It is not hard to see that not even a single corona of copies of a regular pentagon can be formed around a central copy, whence H = 0 for a regular pentagon. These two examples exhibit the …
منابع مشابه
Polygonal tiling of some surfaces containing fullerene molecules
A tiling of a surface is a decomposition of the surface into pieces, i.e. tiles, which cover it without gaps or overlaps. In this paper some special polygonal tiling of sphere, ellipsoid, cylinder, and torus as the most abundant shapes of fullerenes are investigated.
متن کاملReport On Cobweb Posets' Tiling Problem
Responding to Kwaśniewski’s cobweb posets’ problems posed in [3, 4] we present here some results on one of them namely on Cobweb Tiling Problem. Kwaśniewski cobweb posets with tiling property are designated-coded by their correspondent tiling sequences. We show that the family of all cobweb tiling sequences includes Natural numbers, Fibonacci numbers, Gaussian integers and show that there are m...
متن کاملCode Tiling for Improving the Cache Performance of PDE Solvers
For SOR-like PDE solvers, loop tiling either helps little in improving data locality or hurts their performance. This paper presents a novel compiler technique called code tiling for generating fast tiled codes for these solvers on uniprocessors with a memory hierarchy. Code tiling combines loop tiling with a new array layout transformation called data tiling in such a way that a significant am...
متن کاملOn Cobweb posets tiling problem
Kwaśniewski’s cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers and it entailes natural enquieres already formulated therein. In our note we response to one of those problems. This is a tili...
متن کاملThe Finite Tiling Problem is Undecidable in the Hyperbolic Plane
In this paper, we consider the nite tiling problem which was proved undecidable in the Euclidean plane by Jarkko Kari, see [4]. Here, we prove that the same problem for the hyperbolic plane is also undecidable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 111 شماره
صفحات -
تاریخ انتشار 2004