AN APERIODIC TILE WITH EDGE-TO-EDGE ORIENTATIONAL MATCHING RULES

نویسندگان

چکیده

We present a single, connected tile which can the plane but only non-periodically. The is hexagonal with edge markings, impose simple rules as to how adjacent tiles are allowed meet across edges. first of these standard matching rule, that certain decorations match second condition new type allows when in particular orientation given opposite charge. This forces form hierarchy triangles, following central idea Socolar--Taylor tilings. However, edge-to-edge orientational rule this structure very different way, for surprisingly proof aperiodicity. show hull all tilings satisfying our uniquely ergodic and almost belong minimal core generated by substitution. Identifying charge-flips each other, shown have pure point dynamical spectrum regular model set structure.

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Edge-Matching Problems with Rotations

Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity II puzzle, and new complexity results. In this paper we consider a number of settings which ...

متن کامل

Sufficient conditions for maximally edge-connected and super-edge-connected

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...

متن کامل

Orientational minimal redundancy wavelets: from edge detection to perception

Natural images are complex but very structured objects and, in spite of its complexity, the sensory areas in the neocortex in mammals are able to devise learned strategies to encode them efficiently. How is this goal achieved? In this paper, we will discuss the multiscaling approach, which has been recently used to derive a redundancy reducing wavelet basis. This kind of representation can be s...

متن کامل

Deterministic Aperiodic Tile Sets

Wang tiles are square tiles with colored edges. We construct an aperiodic set of Wang tiles that is strongly deterministic in the sense that any two adjacent edges of a tile determine the tile uniquely. Consequently, the tiling group of this set is not hyperbolic and it acts discretely and co-compactly on a CAT(0) space.

متن کامل

Edge Deletion Games with Parity Rules

We analyze three combinatorial games played on simple undirected graphs. A move consists of deleting a single edge; which edges can be deleted depends on the parity of each edge’s endpoints. While determining the possible values of each game, we show relationships between these games and graph matchings, octal games, vertex deletion games, and graph colourings.

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of The Institute of Mathematics of Jussieu

سال: 2021

ISSN: ['1474-7480', '1475-3030']

DOI: https://doi.org/10.1017/s1474748021000517