English
Related papers

Related papers: Fixed Point and Aperiodic Tilings

200 papers

Aperiodic crystals constitute a fascinating class of materials that includes incommensurate (IC) modulated structures and quasicrystals (QCs). Although these two categories share a common foundation in the concept of superspace, the…

Soft Condensed Matter · Physics 2024-07-15 Toranosuke Matsubara , Akihisa Koga , Atsushi Takano , Yushu Matsushita , Tomonari Dotera

Recently, Greenfeld and Tao disprove the conjecture that translational tilings of a single tile can always be periodic [Ann. Math. 200(2024), 301-363]. In another paper [to appear in J. Eur. Math. Soc.], they also show that if the dimension…

Combinatorics · Mathematics 2025-04-10 Chao Yang , Zhujun Zhang

A universal schema for diagonalization was popularized by N. S. Yanofsky (2003) in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many…

Logic · Mathematics 2019-07-02 Ahmad Karimi , Saeed Salehi

We consider the collection of uniformly discrete point sets in Euclidean space equipped with the vague topology. For a point set in this collection, we characterise minimality of an associated dynamical system by almost repetitivity of the…

Dynamical Systems · Mathematics 2014-12-22 Dirk Frettlöh , Christoph Richard

In this work we study the existence of periodic and asymptotically periodic solutions of a system of nonlinear Volterra difference equations with infinite delay. By means of fixed point theory, we furnish conditions that guarantee the…

Classical Analysis and ODEs · Mathematics 2013-03-28 Murat Adıvar , H. Can Koyuncuoğlu , Youssef N. Raffoul

We prove a version of uniqueness theorem for Cuntz-Pimsner algebras of discrete product systems over semigroups of Ore type. To this end, we introduce Doplicher-Roberts picture of Cuntz-Pimsner algebras, and the semigroup dual to a product…

Operator Algebras · Mathematics 2016-12-01 B. K. Kwasniewski , W. Szymanski

It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…

Combinatorics · Mathematics 2007-05-23 Cristopher Moore , John Michael Robson

How, in principle, could one solve the atomic structure of a quasicrystal, modeled as a random tiling decorated by atoms, and what techniques are available to do it? One path is to solve the phase problem first, obtaining the density in a…

Materials Science · Physics 2007-05-23 C. L. Henley , V. Elser , M. Mihalkovic

This paper provides a bridge between the classical tiling theory and the complex neighborhood self-assembling situations that exist in practice. The neighborhood of a position in the plane is the set of coordinates which are considered…

Computational Complexity · Computer Science 2011-04-12 Lila Kari , Benoît Masson

We present a new aperiodic tileset containing 11 Wang tiles on 4 colors, and we show that this tileset is minimal, in the sense that no Wang set with either fewer than 11 tiles or fewer than 4 colors is aperiodic. This gives a definitive…

Discrete Mathematics · Computer Science 2021-01-12 Emmanuel Jeandel , Michael Rao

This paper deals with (globally) random substitutions on a finite set of prototiles. Using renormalization tools applied to objects from operator algebras we establish upper and lower bounds on the rate of deviations of ergodic averages for…

Dynamical Systems · Mathematics 2023-05-26 Rodrigo Treviño

The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…

Formal Languages and Automata Theory · Computer Science 2014-03-21 Pierre Gillibert

The question of whether a given region can be successfully filled by a finite set of tiles has been commonly studied, and there are many available arguments for whether a given finite region can be tiled. We can show that there is no domino…

Combinatorics · Mathematics 2025-09-29 Leigh Foster

Aperiodic algebras are infinite dimensional algebras with generators corresponding to an element of the aperiodic set. These algebras proved to be an useful tool in studying elementary excitations that can propagate in multilayered…

Rings and Algebras · Mathematics 2023-03-07 Daniele Corradetti , David Chester , Raymond Aschheim , Klee Irwin

Aperiodic tilings support two classically studied but hitherto separately presented structures: matching rules, which enforce global order via local constraints, and height functions, which encode global geometry through integer-valued…

Combinatorics · Mathematics 2026-03-17 Sebastian Pardo-Guerra , Jonathan Washburn , Elshad Allahyarov

Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston's height function approach to a nearly…

Combinatorics · Mathematics 2016-11-07 Igor Pak , Adam Sheffer , Martin Tassy

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

We show that in the hierarchical tile assembly model, if there is a producible assembly that overlaps a nontrivial translation of itself consistently (i.e., the pattern of tile types in the overlap region is identical in both translations),…

Computational Geometry · Computer Science 2014-11-26 Ho-Lin Chen , David Doty , Ján Maňuch , Arash Rafiey , Ladislav Stacho

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin

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…

Combinatorics · Mathematics 2015-09-21 Maxwell Hutchinson , Michael Widom