English
Related papers

Related papers: Fixed-point tile sets and their applications

200 papers

This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…

Dynamical Systems · Mathematics 2015-02-24 David Damanik , Daniel Lenz

We prove the computational weakness of a model of tile assembly that has so far resisted many attempts of formal analysis or positive constructions. Specifically, we prove that, in Winfree's abstract Tile Assembly Model, when restricted to…

Computational Complexity · Computer Science 2015-07-31 Pierre-Étienne Meunier , Damien Regnault

We prove a Kleene theorem for higher-dimensional automata. It states that the languages they recognise are precisely the rational subsumption-closed sets of finite interval pomsets. The rational operations on these languages include a…

Formal Languages and Automata Theory · Computer Science 2024-12-18 Uli Fahrenberg , Christian Johansen , Georg Struth , Krzysztof Ziemiański

The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand,…

Discrete Mathematics · Computer Science 2017-05-09 Alexandre Derouet-Jourdan , Shizuo Kaji , Yoshihiro Mizoguchi

Moir\'e patterns of twisted and scaled bilayers have recently emerged as a fertile source of quasiperiodic order in two-dimensional materials. Inspired by these systems, we introduce the \emph{near-coincidence method} for generating…

Materials Science · Physics 2026-04-07 Meshy Ochana , Ron Lifshitz

We study close-packed dimers on the quasiperiodic Ammann-Beenker (AB) graph, that was recently shown to have the unusual feature that hard-core dimer constraints are exactly reproduced at successive discrete length scales. This observation…

Statistical Mechanics · Physics 2023-02-17 Sounak Biswas , S. A. Parameswaran

Substitution schemes provide a classical method for constructing tilings of Euclidean space. Allowing multiple scales in the scheme, we introduce a rich family of sequences of tile partitions generated by the substitution rule, which…

Dynamical Systems · Mathematics 2020-04-21 Yotam Smilansky

The initial algebra for an endofunctor F provides a recursion and induction scheme for data structures whose constructors are described by F. The initial-algebra construction by Ad\'amek (1974) starts with the initial object (e.g. the empty…

Logic in Computer Science · Computer Science 2024-05-22 Thorsten Wißmann , Stefan Milius

We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…

Logic in Computer Science · Computer Science 2022-08-16 Yasha Savelyev

Recently Taylor and Socolar introduced an aperiodic mono-tile. The associated tiling can be viewed as a substitution tiling. We use the substitution rule for this tiling and apply the algorithm of \cite{AL} to check overlap coincidence. It…

Metric Geometry · Mathematics 2012-12-19 Shigeki Akiyama , Jeong-Yup Lee

In this paper we consider a one dimensional liner piecewise-smooth discontinuous map. It is well known that stable periodic orbits exist in this type of map for a specific parameter region. It is also known that the corresponding…

Dynamical Systems · Mathematics 2015-06-04 Bhooshan Rajpathak , Harish Pillai , Santanu Bandyopadhyay

The problem of filtering of finite-alphabet stationary ergodic time series is considered. A method for constructing a confidence set for the (unknown) signal is proposed, such that the resulting set has the following properties: First, it…

Information Theory · Computer Science 2012-07-10 Boris Ryabko , Daniil Ryabko

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

Group Theory · Mathematics 2015-07-07 Emmanuel Jeandel

In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…

Metric Geometry · Mathematics 2014-08-14 Carlos Ramos-Cuevas

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Combinatorics · Mathematics 2023-06-28 Anitha G , P Vanchinathan

We generalize the notion of (geometric) substitution rule to obtain overlapping substitutions. Our motivating example is the substitution presented in Ziherl, Dotera and Bekku \cite{DBZ}, which features a substitution matrix with…

Combinatorics · Mathematics 2025-12-23 Shigeki Akiyama , Yasushi Nagai , Shu-Qin Zhang

This paper focuses on the construction of periodic solutions of nonlinear beam equations on the $d$-dimensional tori. For a large set of frequencies, we demonstrate that an equivalent form of the nonlinear equations can be obtained by a…

Dynamical Systems · Mathematics 2018-05-09 Bochao Chen , Yong Li , Yixian Gao

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

We formulate and prove a variational principle (in the sense of thermodynamics) for random domino tilings, or equivalently for the dimer model on a square grid. This principle states that a typical tiling of an arbitrary finite region can…

Combinatorics · Mathematics 2012-03-15 Henry Cohn , Richard Kenyon , James Propp

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