English
Related papers

Related papers: Undecidable translational tilings with only two ti…

200 papers

We construct the first aperiodic tiles for two amenable 3-dimensional Lie groups: Sol and the Heisenberg group. Our construction relies on the use of higher-dimensional uniformly finite homology. In particular, we settle completely the…

Group Theory · Mathematics 2012-05-17 Piotr W. Nowak , Shmuel Weinberger

The top of the attractor $A$ of a hyperbolic iterated function system $\left\{ f_{i}:\mathbb{R}^{n}\rightarrow\mathbb{R}^{n}|i=1,2,\dots,M\right\} $ is defined and used to extend self-similar tilings to overlapping systems. The theory…

Dynamical Systems · Mathematics 2026-03-24 Michael F. Barnsley , Corey de Wit

For a (non-unit) Pisot number $\beta$, several collections of tiles are associated with $\beta$-numeration. This includes an aperiodic and a periodic one made of Rauzy fractals, a periodic one induced by the natural extension of the…

Number Theory · Mathematics 2013-10-07 Milton Minervino , Wolfgang Steiner

We establish the undecidability of conditional affine information inequalities, the undecidability of the conditional independence implication problem with a constraint that one random variable is binary, and the undecidability of the…

Information Theory · Computer Science 2022-02-11 Cheuk Ting Li

This study explores the properties of the function which can tile the field $\mathbb{Q}_p$ of $p$-adic numbers by translation. It is established that functions capable of tiling $\mathbb{Q}_p$ is by translation uniformly locally constancy.…

Classical Analysis and ODEs · Mathematics 2025-01-15 Shilei Fan

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

We give a constructive method that can decrease the number of prototiles needed to tile a space. We achieve this by exchanging edge to edge matching rules for a small atlas of permitted patches. This method is illustrated with Wang tiles,…

Combinatorics · Mathematics 2010-03-26 David Fletcher

In 2023, two striking, nearly simultaneous, mathematical discoveries have excited their respective communities, one by Greenfeld and Tao, the other (the Hat tile) by Smith, Myers, Kaplan and Goodman-Strauss, which can both be summed up as…

Discrete Mathematics · Computer Science 2025-11-19 Thierry Coulbois , Anahí Gajardo , Pierre Guillon , Victor Lutfalla

The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…

Logic · Mathematics 2025-10-06 Mikhail Rybakov

In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…

Metric Geometry · Mathematics 2013-12-12 Yohji Akama , Yudai Sakano

The abelian sandpile model is a simple combinatorial model for critical behaviour which has the "abelian property" that the order in which we make moves does not change the final outcome of the game. This might seem to restrict the model's…

Combinatorics · Mathematics 2021-03-26 Hannah Cairns

An h-tiling on a finite simplicial complex is a partition of its geometric realization by maximal simplices deprived of several codimension one faces together with possibly their remaining face of highest codimension. In this last case, the…

Combinatorics · Mathematics 2021-11-30 Jean-Yves Welschinger

In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product $\mathbb Z\wr (\mathbb Z\times \mathbb Z)$. We also show that subsemimodule membership…

Group Theory · Mathematics 2009-03-05 Markus Lohrey , Benjamin Steinberg

A self-affine tiling of a compact set G of positive Lebesgue measure is its partition to parallel shifts of a compact set which is affinely similar to G. We find all polyhedral sets (unions of finitely many convex polyhedra) that admit…

Metric Geometry · Mathematics 2021-07-27 Vladimir Yu. Protasov , Tatyana Zaitseva

In the study of aperiodic order and mathematical models of quasicrystals, questions regarding equivalence relations on Delone sets naturally arise. This work is dedicated to the bounded displacement (BD) equivalence relation, and especially…

Metric Geometry · Mathematics 2020-09-08 Dirk Frettlöh , Yotam Smilansky , Yaar Solomon

One of the most fundamental problems in tiling theory is the domino problem: given a set of tiles and tiling rules, decide if there exists a way to tile the plane using copies of tiles and following their rules. The problem is known to be…

Discrete Mathematics · Computer Science 2024-02-08 Nathalie Aubrun , Manon Blanc , Olivier Bournez

Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…

Classical Analysis and ODEs · Mathematics 2025-09-25 Sigrid Grepstad , Mihail N. Kolountzakis , Emmanuil Spyridakis

We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…

Discrete Mathematics · Computer Science 2015-06-15 Bruno Durand , Andrei Romashchenko

In this paper we study geometric versions of Burnside's Problem and the von Neumann Conjecture. This is done by considering the notion of a translation-like action. Translation-like actions were introduced by Kevin Whyte as a geometric…

Group Theory · Mathematics 2014-11-11 Brandon Seward

Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…

Computational Complexity · Computer Science 2009-09-25 Marek Chrobak , Peter Couperus , Christoph Durr , Gerhard Woeginger
‹ Prev 1 3 4 5 6 7 10 Next ›