Weak local rules for planar octagonal tilings

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak colored local rules for planar tilings

A linear subspace E of R has colored local rules if there exists a finite set of decorated tiles whose tilings are digitizations of E. The local rules are weak if the digitizations can slightly wander around E. We prove that a linear subspace has weak colored local rules if and only if it is computable. This goes beyond the previous results, all based on algebraic subspaces. We prove an analogo...

متن کامل

Local Rules for Computable Planar Tilings

Aperiodic tilings are non-periodic tilings characterized by local constraints. They play a key role in the proof of the undecidability of the domino problem (1964) and naturally model quasicrystals (discovered in 1982). A central question is to characterize, among a class of non-periodic tilings, the aperiodic ones. In this paper, we answer this question for the well-studied class of non-period...

متن کامل

No Weak Local Rules for the 4p-Fold Tilings

On the one hand, Socolar showed in 1990 that the n-fold planar tilings admit weak local rules when n is not divisible by 4 (the n = 10 case corresponds to the Penrose tilings and is known since 1974). On the other hand, Burkov showed in 1988 that the 8-fold tilings do not admit weak local rules, and Le showed the same for the 12-fold tilings (unpublished). We here show that this is actually the...

متن کامل

Enumeration of octagonal tilings

Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of the number of distinct tilings to the number of constituent tiles. Tilings by squares and 45 rhombi receive special attention as presumably the simplest mode...

متن کامل

Enumeration of octagonal random tilings by the Gessel-Viennot method

We propose the first algebraic determinantal formula to enumerate random rhombus tilings filling a centro-symmetric octagon of any size. This result uses the GesselViennot technique and generalizes to any octagon a former specialized formula by Elnitsky.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2017

ISSN: 0021-2172,1565-8511

DOI: 10.1007/s11856-017-1582-z