English
Related papers

Related papers: About the domino problem in the hyperbolic plane, …

200 papers

In this paper, we prove that the general problem of tiling the hyperbolic plane with \`a la Wang tiles is undecidable.

Computational Geometry · Computer Science 2009-07-07 Maurice Margenstern

In this paper, we complete the construction of paper arXiv:cs.CG/0701096v2. Together with the proof contained in arXiv:cs.CG/0701096v2, this paper definitely proves that the general problem of tiling the hyperbolic plane with {\it \`a la}…

Computational Geometry · Computer Science 2009-07-06 Maurice Margenstern

The present paper is a new version of the arXiv paper revisiting the proof given in a previous paper of the author published in 2008 proving that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly…

Discrete Mathematics · Computer Science 2022-07-06 Maurice Margenstern

In this paper, we consider the periodic tiling problem which was proved undecidable in the Euclidean plane by Yu. Gurevich and I. Koriakov in 1972. Here, we prove that the same problem for the hyperbolic plane is also undecidable.

Computational Geometry · Computer Science 2007-05-23 Maurice Margenstern

In this paper, we prove that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael…

Computational Geometry · Computer Science 2008-04-19 Maurice Margenstern

In this paper, we consider the finite tiling problem which was proved undecidable in the Euclidean plane by Jarkko Kari in 1994. Here, we prove that the same problem for the hyperbolic plane is also undecidable.

Computational Geometry · Computer Science 2009-07-07 Maurice Margenstern

We provide a definitive classification of all finite sets of regular polygons that admit a tiling of the hyperbolic plane, thereby establishing the decidability of the Domino Problem for this class of prototiles. We show that admissibility…

Combinatorics · Mathematics 2026-03-31 Arun Maiti

Several articles deal with tilings with squares and dominoes of the well-known regular square mosaic in Euclidean plane, but not any with the hyperbolic regular square mosaics. In this article, we examine the tiling problem with colored…

Combinatorics · Mathematics 2021-04-01 Takao Komatsu , László Németh , László Szalay

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

The translational tiling problem, dated back to Wang's domino problem in the 1960s, is one of the most representative undecidable problems in the field of discrete geometry and combinatorics. Ollinger initiated the study of the…

Combinatorics · Mathematics 2025-06-25 Chao Yang , Zhujun Zhang

We provide a resolution of the Heesch problem for homogeneous (also known as semi-regular) tilings, and as a corollary, for tilings by convex monotiles in the hyperbolic plane. We also provide the first known example of weakly aperiodic…

Combinatorics · Mathematics 2026-05-19 Arun Maiti

We show that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property. As an application, we prove that the domino problem is undecidable for the fundamental group of any closed…

Group Theory · Mathematics 2020-05-07 Nathalie Aubrun , Sebastián Barbieri , Etienne Moutot

We study decision problems on geometric tilings. First, we study a variant of the Domino problem where square tiles are replaced by geometric tiles of arbitrary shape. We show that this variant is undecidable regardless of the shapes,…

Discrete Mathematics · Computer Science 2025-11-13 Benjamin Hellouin de Menibus , Victor Lutfalla , Pascal Vanier

We extend the classical Domino problem to any tiling of rhombus-shaped tiles. For any subshift X of edge-to-edge rhombus tilings, such as the Penrose subshift, we prove that the associated X-Domino problem is $\Pi^0_1$ -hard and therefore…

Discrete Mathematics · Computer Science 2023-08-03 Benjamin Hellouin de Menibus , Victor H. Lutfalla , Camille Noûs

In this paper we present new results regarding the periodicity of outer billiards in the hyperbolic plane around polygonal tables which are tiles in regular two-piece tilings of the hyperbolic plane.

Dynamical Systems · Mathematics 2016-01-20 FIliz Dogru , Emily Fischer , Cristian Mihai Munteanu

We give a proof of Ollinger's conjecture that the problem of tiling the plane with translated copies of a set of $8$ polyominoes is undecidable. The techniques employed in our proof include a different orientation for simulating the Wang…

Combinatorics · Mathematics 2024-12-10 Chao Yang , Zhujun Zhang

The first undecidability result on the tiling is the undecidability of translational tiling of the plane with Wang tiles, where there is an additional color matching requirement. Later, researchers obtained several undecidability results on…

Combinatorics · Mathematics 2025-06-17 Chao Yang , Zhujun Zhang

In this paper, we study diagonalizable hyperbolic systems in one space dimension. Based on a new gradient entropy estimate, we prove the global existence of a continuous solution, for large and nondecreasing initial data. Moreover, we show…

Mathematical Physics · Physics 2008-12-18 Ahmad El Hajj , Regis Monneau

In this study, the existence and uniqueness of the unpredictable solution for a non-homogeneous linear system of ordinary differential equations is considered. The hyperbolic case is under discussion. New properties of unpredictable…

General Mathematics · Mathematics 2018-11-27 Marat Akhmet , Mehmet Onur Fen , Madina Tleubergenova , Akylbek Zhamanshin

In this paper, we remind previous results about the tilings $\{p,q\}$ of the hyperbolic plane. We introduce two new ways to split the hyperbolic plane in order to algorithmically construct the tilings $\{p,q\}$ when $q$ is odd.

Computational Geometry · Computer Science 2009-12-19 Margenstern Maurice
‹ Prev 1 2 3 10 Next ›