中文
相关论文

相关论文: The finite tiling problem is undecidable in the hy…

200 篇论文

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.

计算几何 · 计算机科学 2009-12-19 Margenstern Maurice

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…

组合数学 · 数学 2021-04-01 Takao Komatsu , László Németh , László Szalay

This paper focuses on the undecidability of translational tiling of $n$-dimensional space $\mathbb{Z}^n$ with a set of $k$ tiles. It is known that tiling $\mathbb{Z}^2$ with translated copies with a set of $8$ tiles is undecidable.…

组合数学 · 数学 2025-06-24 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…

组合数学 · 数学 2025-06-17 Chao Yang , Zhujun Zhang

The Finiteness Problem is shown to be unsolvable for any sufficiently large class of modular lattices.

逻辑 · 数学 2019-01-11 Christian Herrmann

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…

组合数学 · 数学 2024-12-10 Chao Yang , Zhujun Zhang

We consider the characteristic problem for the ultrahyperbolic equation in the Euclidean space. The value of a solution is prescribed on the characteristic hyperplane. A well-posed set-up of the problem is discussed. We obtain a certain…

偏微分方程分析 · 数学 2026-04-27 Maxim N. Demchenko

Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…

In this paper, we distinguish two levels for the plane-filling property. We consider a simple and a strong one. In this paper, we give the construction which proves that the simple plane-filling property also holds for the hyperbolic plane.…

计算几何 · 计算机科学 2007-10-02 Maurice Margenstern

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…

组合数学 · 数学 2025-04-10 Chao Yang , Zhujun Zhang

We prove that any finite set $F\subset {\mathbb{Z}^2}$ that tiles ${\mathbb{Z}^2}$ by translations also admits a periodic tiling. As a consequence, the problem whether a given finite set $F$ tiles ${\mathbb{Z}^2}$ is decidable.

组合数学 · 数学 2016-02-19 Siddhartha Bhattacharya

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…

组合数学 · 数学 2026-04-29 Chunlin Li , Erxiao Wang , Wu Jie , Min Yan

We describe a method to classify crystallographic tilings of the Euclidean and hyperbolic planes by tiles whose stabiliser group contains translation isometries or whose topology is not that of a closed disk. We tackle this problem from two…

几何拓扑 · 数学 2019-04-09 Benedikt Kolbe , Vanessa Robins

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…

形式语言与自动机理论 · 计算机科学 2012-09-04 Thomas Fernique , Mathieu Sablik

In this paper we define an infinite family of triangular tilings of the hyperbolic plane defined by two parameters ranging in the natural nummbers and we give a uniform way to define coordinates for locating the triangles of the tiling.

形式语言与自动机理论 · 计算机科学 2011-01-04 Maurice Margenstern

We prove that acylindrically hyperbolic groups are monotileable. That is, every finite subset of the group is contained in a finite tile. This provides many new examples of monotileable groups, and progress on the question of whether every…

群论 · 数学 2026-05-14 Joseph MacManus , Lawk Mineh

The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…

计算机科学中的逻辑 · 计算机科学 2024-04-17 Miroslav Chodil , Antonín Kučera

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…

离散数学 · 计算机科学 2023-08-03 Benjamin Hellouin de Menibus , Victor H. Lutfalla , Camille Noûs

We consider the ultrahyperbolic equation in the Euclidean space. The behavior at the infinity of a certain class of solutions is studied. We examine the issue of existence of solutions to the scattering problem: for a given asymptotics at…

偏微分方程分析 · 数学 2024-10-29 Maxim N. Demchenko

The paper is devoted to some extremal problems, related to convex polygons in the Euclidean plane and their perimeters. We present a number of results that have simple formulations, but rather intricate proofs. Related and still unsolved…

度量几何 · 数学 2023-11-28 Yu. G. Nikonorov , O. Yu. Nikonorova