English
Related papers

Related papers: Periodicity in tilings

200 papers

System design is often taught through domain-specific solutions specific to particular domains, such as databases, operating systems, or computer architecture, each with its own methods and vocabulary. While this diversity is a strength, it…

Other Computer Science · Computer Science 2025-07-31 Joy Arulraj

We define a new family of non-periodic tilings with square tiles that is mutually locally derivable with some family of tilings with isosceles right triangles. Both families are defined by simple local rules, and the proof of their…

Combinatorics · Mathematics 2023-08-01 Nikolay Vereshchagin

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…

Formal Languages and Automata Theory · Computer Science 2012-09-04 Thomas Fernique , Mathieu Sablik

Icosahedral tilings, although non-periodic, are known to be characterized by their configurations of some finite size. This characterization has also been expressed in terms of a simple alternation condition. We provide an alternative proof…

Combinatorics · Mathematics 2016-08-16 Nicolas Bédaride , Thomas Fernique

In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…

Logic · Mathematics 2023-07-26 Mark Carney

The period set of a dynamical system is defined as the subset of all integers $n$ such that the system has a periodic orbit of length $n$. Based on known results on the intersection of period sets of torus maps within a homotopy class, we…

Dynamical Systems · Mathematics 2014-06-23 Jaume Llibre , Natascha Neumärker

Recurrence is a fundamental characteristic of dynamical systems with complicated behavior. Understanding the inner structure of recurrence is challenging, especially if the system has many degrees of freedom and is subject to noise. We…

Dynamical Systems · Mathematics 2024-12-16 Ulrich Bauer , David Hien , Oliver Junge , Konstantin Mischaikow

The present paper presents and proves a proposition concerning the time complexity of finite languages. It is shown herein, that for any finite language (a language for which the set of words composing it is finite) there is a Turing…

Computational Complexity · Computer Science 2007-05-23 Mircea Alexandru Popescu Moscu

We introduce a new family of nonperiodic tilings, based on a substitution rule that generalizes the pinwheel tiling of Conway and Radin. In each tiling the tiles are similar to a single triangular prototile. In a countable number of cases,…

Group Theory · Mathematics 2018-07-10 Lorenzo Sadun

We consider tiling dynamical systems and topological conjugacies between them. We prove that the criterion of being finite type is invariant under topological conjugacy. For substitution tiling systems under rather general conditions,…

Dynamical Systems · Mathematics 2018-07-18 Charles Holton , Charles Radin , Lorenzo Sadun

By reformulating Wang tiles with tensors, we propose a natural generalization to the probabilistic and quantum setting. In this new framework, we introduce notions of tilings and periodicity directly extending their classical counterparts.…

Quantum Physics · Physics 2024-11-11 Titouan Carette , Etienne Moutot

Aperiodic tiling is a well-know area of research. First developed by mathematicians for the mathematical challenge they represent and the beauty of their resulting patterns, they became a growing field of interest when their practical use…

Metric Geometry · Mathematics 2021-10-19 Vincent Van Dongen

We consider the dynamics of light rays in the trihexagonal tiling where triangles and hexagons are transparent and have equal but opposite indices of refraction. We find that almost every ray of light is dense in a region of a particular…

Metric Geometry · Mathematics 2018-07-24 Diana Davis , W. Patrick Hooper

We consider tilings of quadriculated regions by dominoes and of triangulated regions by lozenges. We present an overview of results concerning tileability, enumeration and the structure of the space of tilings.

Combinatorics · Mathematics 2007-05-23 Nicolau C. Saldanha , Carlos Tomei

An aperiodic tile set was first constructed by R.Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics…

Computational Complexity · Computer Science 2010-01-27 Bruno Durand , Andrei Romashchenko , Alexander Shen

Given a random distribution of impurities on a periodic crystal, an equivalent uniquely ergodic tiling space is built, made of aperiodic, repetitive tilings with finite local complexity, and with configurational entropy close to the entropy…

Dynamical Systems · Mathematics 2010-11-04 Ian Palmer , Jean Bellissard

We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of…

Combinatorics · Mathematics 2015-11-11 Anne Kenyon , Martin Tassy

A longstanding open problem asks for an aperiodic monotile, also known as an "einstein": a shape that admits tilings of the plane, but never periodic tilings. We answer this problem for topological disk tiles by exhibiting a continuum of…

Combinatorics · Mathematics 2024-07-08 David Smith , Joseph Samuel Myers , Craig S. Kaplan , Chaim Goodman-Strauss

This is a chapter in an incoming book on aperiodic order. We review results about the topology, the dynamics, and the combinatorics of aperiodically ordered tilings obtained with the tools of noncommutative geometry.

Operator Algebras · Mathematics 2014-12-18 Antoine Julien , Johannes Kellendonk , Jean Savinien

In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…

Discrete Mathematics · Computer Science 2022-06-06 Jarkko Kari , Etienne Moutot