English
Related papers

Related papers: Tiling an Equilateral Triangle

200 papers

There is a sufficiently large $N\in h\mathbb{N}$ such that the following holds. If $G$ is a tripartite graph with $N$ vertices in each vertex class such that every vertex is adjacent to at least $2N/3+2h-1$ vertices in each of the other…

Combinatorics · Mathematics 2018-08-14 Kirsten Hogenson , Ryan R. Martin , Yi Zhao

Nandakumar asked whether there is a tiling of the plane by pairwise non-congruent triangles of equal area and equal perimeter. Here a weaker result is obtained: there is a tiling of the plane by pairwise non-congruent triangles of equal…

Metric Geometry · Mathematics 2016-03-31 Dirk Frettlöh

The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…

Data Structures and Algorithms · Computer Science 2017-03-07 Grzegorz Głuch , Krzysztof Loryś

Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three…

Combinatorics · Mathematics 2021-04-01 László Németh

Let $T$ be a tile in $\mathbb{Z}^n$, meaning a finite subset of $\mathbb{Z}^n$. It may or may not tile $\mathbb{Z}^n$, in the sense of $\mathbb{Z}^n$ having a partition into copies of $T$. However, we prove that $T$ does tile $\mathbb{Z}^d$…

Combinatorics · Mathematics 2016-08-23 Vytautas Gruslys , Imre Leader , Ta Sheng Tan

We show that if $\mathbb Z^3$ can be tiled by translated copies of a set $F\subseteq\mathbb Z^3$ of cardinality the square of a prime then there is a weakly periodic $F$-tiling of $\mathbb Z^3$, that is, there is a tiling $T$ of $\mathbb…

Combinatorics · Mathematics 2022-10-11 Abhishek Khetan

The edge-to-edge tilings of the sphere by congruent quadrilaterals of Type $a^2bc$ are classified as $3$ classes: a sequence of two-parameter families of $2$-layer earth map tilings with $2n$ $(n\ge3)$ tiles, a one-parameter family of…

Combinatorics · Mathematics 2022-07-26 Yixi Liao , Pinren Qian , Erxiao Wang , Yingyun Xu

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…

Geometric Topology · Mathematics 2007-05-23 Simon A. King

We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least $\log_2p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some…

Combinatorics · Mathematics 2016-09-06 Richard Kenyon

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

Convex hexagons that can tile the plane have been classified into three types. For the generic cases (not necessarily convex) of the three types and two other special cases, we classify tilings of the plane under the assumption that all…

Combinatorics · Mathematics 2024-05-09 Xinlu Yu , Erxiao Wang , Min Yan

The edge-to-edge tilings of the sphere by congruent polygons, where all edges are straight, have been completely classified. We classify the curvilinear version of the similar triangular tilings, where the edges may not be straight, and…

Combinatorics · Mathematics 2026-01-14 Keyi Jin , Linming Lu , Erxiao Wang , Lijuan Wu , Min Yan

We introduce an elementary transformation called flips on tilings by squares and triangles and conjecture that it connects any two tilings of the same region of the Euclidean plane.

Discrete Mathematics · Computer Science 2024-06-25 Thomas Fernique , Olga Mikhailovna Sizova

We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…

Metric Geometry · Mathematics 2017-11-27 Christian Richter , Melchior Wirth

We study $C^1$-regular surfaces in $R^3$ that admit tilings by a finite number of rigid motion congruence classes of tiles. We construct examples with various topologies and present a framework for a systematic study, mainly concentrating…

Differential Geometry · Mathematics 2025-12-15 David Brander , Jens Gravesen

We solve a problem of R. Nandakumar by proving that there is no tiling of the plane with pairwise noncongruent triangles of equal area and equal perimeter. We also show that no convex polygon with more than three sides can be tiled with…

Combinatorics · Mathematics 2018-04-12 Andrey Kupavskii , János Pach , Gábor Tardos

We prove that is a measurable domain tiles R or R^2 by translations, and if it is "close enough" to a line segment or a square respectively, then it admits a lattice tiling. We also prove a similar result for spectral sets in dimension 1,…

Classical Analysis and ODEs · Mathematics 2016-09-07 Mihail N. Kolountzakis , Izabella Laba

A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that…

Probability · Mathematics 2012-07-24 Omer Angel , Alexander E. Holroyd , Gady Kozma , Johan Wästlund , Peter Winkler

There exist tilings of the plane with pairwise noncongruent triangles of equal area and bounded perimeter. Analogously, there exist tilings with triangles of equal perimeter, the areas of which are bounded from below by a positive constant.…

Combinatorics · Mathematics 2018-02-07 Andrey Kupavskii , János Pach , Gábor Tardos

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