English
Related papers

Related papers: Tiling with arbitrary tiles

200 papers

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 polygons $R$ with arbitrary convex polygonal tiles. Such tilings come in continuous families obtained by moving tile edges parallel to themselves (keeping edge directions fixed). We study how the tile shapes and areas…

Combinatorics · Mathematics 2021-06-08 Richard Kenyon

An integral self-affine tile is the solution of a set equation $\mathbf{A} \mathcal{T} = \bigcup_{d \in \mathcal{D}} (\mathcal{T} + d)$, where $\mathbf{A}$ is an $n \times n$ integer matrix and $\mathcal{D}$ is a finite subset of…

Number Theory · Mathematics 2013-09-02 Wolfgang Steiner , Jörg Thuswaldner

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 $k$-tiling problem for a convex polytope $P$ is the problem of covering $\mathbb R^d$ with translates of $P$ using a discrete multiset $\Lambda$ of translation vectors, such that every point in $\mathbb R^d$ is covered exactly $k$…

Metric Geometry · Mathematics 2016-01-25 Swee Hong Chan

This paper is concerned with realizing Lattes maps as subdivision maps of finite subdivision rules. The main result is that the Lattes maps in all but finitely many analytic conjugacy classes can be realized as subdivision maps of finite…

Dynamical Systems · Mathematics 2009-10-23 J. W. Cannon , W. J. Floyd , W. R. Parry

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…

Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…

Probability · Mathematics 2021-04-08 Richard Kenyon , Cosmin Pohoata

Let $A$ be a hereditary algebra over an algebraically closed field $k$ and $A^{(m)}$ be the $m$-replicated algebra of $A$. Given an $A^{(m)}$-module $T$, we denote by $\delta (T)$ the number of non isomorphic indecomposable summands of $T$.…

Representation Theory · Mathematics 2013-01-24 Shunhua Zhang

Motivated by a question of Erd\"{o}s and inquiries by Beeson and Laczkovich, we explore the possible $N$ for which a triangle $T$ can tile into $N$ congruent copies of a triangle $R$. The \emph{reptile} cases (where $T$ is similar to $R$)…

Combinatorics · Mathematics 2026-04-07 Yan X Zhang

A basic assumption of tiling theory is that adjacent tiles can meet in only a finite number of ways, up to rigid motions. However, there are many interesting tiling spaces that do not have this property. They have "fault lines", along which…

Dynamical Systems · Mathematics 2007-05-23 Natalie Priebe Frank , Lorenzo Sadun

In this paper, we provide a geometric characterization of tiles in the finite abelian groups \( \mathbb{Z}_{p^n} \times \mathbb{Z}_q \) and \( \mathbb{Z}_{p^n} \times \mathbb{Z}_p \) using the concept of a \( p \)-homogeneous tree, which…

Classical Analysis and ODEs · Mathematics 2024-11-06 Shilei Fan , Mamateli Kadir , Peishan Li

This paper characterizes when an $m \times n$ rectangle, where $m$ and $n$ are integers, can be tiled (exactly packed) by squares where each has an integer side length of at least 2. In particular, we prove that tiling is always possible…

Computational Geometry · Computer Science 2023-08-30 MIT CompGeom Group , Zachary Abel , Hugo A. Akitaya , Erik D. Demaine , Adam C. Hesterberg , Jayson Lynch

We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…

Computational Geometry · Computer Science 2025-03-14 Bahram Sadeghi Bigham , Mansoor Davoodi , Samaneh Mazaheri , Jalal Kheyrabadi

We give a necessary and sufficient condition on a $d$-dimensional affine subspace of $\mathbb{R}^n$ to be characterized by a finite set of patterns which are forbidden to appear in its digitization. This can also be stated in terms of local…

Dynamical Systems · Mathematics 2024-10-03 Nicolas Bédaride , Thomas Fernique

We give a new proof of the following interesting fact recently proved by Bower and Michael: if a d-dimensional rectangular box can be tiled using translates of two types of rectangular bricks, then it can also be tiled in the following way.…

Combinatorics · Mathematics 2007-05-23 Mihail N. Kolountzakis

A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…

Combinatorics · Mathematics 2022-03-09 Izabella Laba , Itay Londner

Given a substitution tiling $T$ of the plane with subdivision operator $\tau$, we study the conformal tilings $\mathcal{T}_n$ associated with $\tau^n T$. We prove that aggregate tiles within $\mathcal{T}_n$ converge in shape as…

Dynamical Systems · Mathematics 2017-03-14 Richard Kenyon , Kenneth Stephenson

We exhibit a subset of a finite Abelian group, which tiles the group by translation, and such that its tiling complements do not have a common spectrum (orthogonal basis for their $L^2$ space consisting of group characters). This disproves…

Classical Analysis and ODEs · Mathematics 2007-05-23 Mihail N. Kolountzakis , Mate Matolcsi

A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…

Computational Geometry · Computer Science 2016-03-10 Stefan Langerman , Andrew Winslow
‹ Prev 1 3 4 5 6 7 10 Next ›