Use this tag for questions about (not necessarily periodic) tilings of metric spaces, their combinatorial, topological and dynamical properties, as well as basic definitions and concepts.

learn more… | top users | synonyms

1
vote
1answer
29 views

Making bigger penny triangles from smaller

I thought up a problem a long time ago, and googling doesn't even close to turn up the answer. It is this: Given unlimited 3-penny triangles (e.g. triangles with 3 pennies touching each other,) for ...
4
votes
3answers
157 views

Substitution tilings with parallelograms

I'm looking for a substitution tiling made with parallelograms, that is, a tiling of the plane with parallelograms (which do not have to be of the same shape) such that we can take one parallelogram ...
2
votes
1answer
51 views

Pentagonal tiling

I am currently working on a research project in my last year of high school. For this paper we are discussing Eschers tesselations, both in the euclidian and the non-euclidian plane. At the moment I ...
3
votes
2answers
1k views

How to tile a sphere with points at an even density?

I'm writing a bit of code to plot twitter usage across the globe. To do this, I'm searching for users within n km of a certain longitude/latitude (a circular area), at many different lat/lon ...
5
votes
0answers
96 views

Similar Triangle dissections

Andrzej Zak found that a triangle with sides based on powers of the root $d^6-d^2-1=0$, $(d=1.15096...)$ that can replicate itself with 6 differently sized copies. The numbers are powers of $d$. The ...
5
votes
2answers
66 views

Can we cover the entire plane with the square with area 1/n for each positive integer n?

We have one square with area 1/n for each positive integer n. Is it possible to place these squares in the xy-plane in such a way that they completely cover the entire plane. If Yes, can you describe ...
3
votes
1answer
442 views

Squaring rectangles

it is a nice high-school exercise to prove that a square can be tiled with n squares if and only if n=1, 4 or is any integer greater or equal to 6. A direct consequence is that any rectangle that can ...
5
votes
0answers
37 views

Plane tesselation, using stairs $n\times n$, is it possible?

The other day I was constructing new mathematical problems for my pupils and thought of something like this: Given the infinite sequence of "stairs" $n\times n$, constructed from $1\times1$ ...
1
vote
0answers
54 views

Scaling factor closest to 1 in an infinite sequential rectangle packing

The Ammann Chair can be used in an infinite dissection of a rectangle, where the pieces have a scaling factor of $ k = 1/\sqrt{\phi} = 0.786151...$. The largest piece has area $\sqrt{5}$ and longest ...
1
vote
1answer
249 views

Determining if a set of hexagons on a grid can tile the plane

Suppose I have a regular grid of identical hexagons that tile the plane, that is a hexagonal lattice. How can I determine if a connected subset of these hexagons (i.e. a poly-hex) can tile the plane ...
1
vote
0answers
99 views

Progressive packings in a convex shape

Take a shape, and scale it by 1 to $n$. For a tiny set of tightly related shapes, such as isosceles right triangles with shortest sides 1 and sqrt(2), scale the set of shapes by 1 to $n$. What is ...
16
votes
1answer
170 views

Curtains and groups

This picture is a copy of the pattern on my curtains. The points of a hexagonal lattice are each coloured with one of four possible colours. It has translational symmetry in two directions: a ...
2
votes
1answer
84 views

penrose tilings and symmetry

After going through the following question on Penrose Tiling and reading de Bruijn's papers on the subject, I came accross Grünbaum and Shephardbook "Tilings and Patterns", p. 543, where they say that ...
8
votes
3answers
252 views

Getting started with aperiodic tiling

I spent a little time looking around the Wikipedia and Wolfram articles on Penrose Tiling, the Domino Problem, Wang Tiles, etc., but I'm having a little trouble getting into them. A lot of these ...
2
votes
1answer
76 views

Program for playing around with aperiodic tilings

I know this is technically a software question, but I figure the mathematicians here would know more about it: I'm looking for software to play around with different "paintings" (different patterns ...
4
votes
0answers
59 views

Is this a 16th type of a convex pentagon that can tile a plane?

As you can read here: http://www.npr.org/sections/thetwo-way/2015/08/14/432015615/with-discovery-3-scientists-chip-away-at-an-unsolvable-math-problem there are now 15 known convex pentagons, or ...
3
votes
1answer
29 views

3d equivalent geometric shape of a 2d tiled space

In case anyone remembers the old game Comets, it was about this: You had a spaceship which you could move around the screen and various meteors appeared and you had to shoot them up. When you moved ...
3
votes
2answers
85 views

how to divide a hexagon into regular polygons

I want to cut a hexagon paper into regions of equal areas (more precisely either into squares of side c or into regular hexagons of side c). In both cases some of the papers will be wasted. Is it ...
2
votes
2answers
174 views

Prove that it is not possible to completely cover a 6 × 6 chessboard by tiles which have dimensions 1 × 4.

I think I have some sort of understanding of how to solve this but I'm not sure. I would colour the board with 4 colours such that every 1x4 rectangle would cover one of each colour. Then cover the ...
1
vote
1answer
30 views

Scalene rectangulation of a square: let me count the ways

A rectangulation of a square is a dissection of the square $S$ into smaller rectangles $R_i$, $i=1,\ldots,n$ with the usual caveats: $S = \cup_i R_i$ and the interiors of distinct rectangles ...
0
votes
0answers
17 views

An infinite tiling problem

Assume we have an infinite area of hexagonal close tiling with hexagon side $s$ metres with corners of the hexagons marked by straight narrow trees of $d$ metres diameter and height $h$. Assume the ...
2
votes
0answers
46 views

How far can the plane be tiled by congruent regular pentagons?

What is the limit, as the radius of the disk increases, of the greatest area, in proportion to the area of the disk, of the region covered by regular pentagons of the same fixed size, all lying within ...
2
votes
2answers
45 views

Placing tetrominos in square, maximum size

I am currently coding an algorithm which places a list of Tetrominos (tetris pieces) in the smallest square possible. My question is : is there a mathematical way to know the maximum size (upper ...
10
votes
2answers
213 views

Tiling of a $9\times 7$ rectangle

Can a rectangle $9\times 7$ be tiled by "L-blocks" (an L-block consists of $3$ unit squares)? Although the problem seems to be easy, coloring didn't help me. The general theory is interesting, but ...
5
votes
2answers
386 views

An Olympiad Problem (tiling a rectangle with the L-tetromino)

An L block that is 3 unit blocks high and 2 unit blocks wide . It is true that if an n by m rectangle can be covered by such L blocks with out overlap that we would require an even amount of L blocks, ...
3
votes
5answers
526 views

Is the rhombic dodecahedron the only isohedral polyhedron that tiles 3-space (other than the cube)?

Is the rhombic dodecahedron the only face-transitive (or isohedral, i.e. all faces are the same) polyhedron that seamlessly tiles 3-dimensional Euclidean space (other than the cube)? I'm looking ...
13
votes
4answers
251 views

Maximal tiling without any 3-in-a-rows

You are given an arbitrarily large grid, where each square can either be off or on (think Game-of-life type board). You need to tile such a grid to maximize the number of "on" squares without there ...
5
votes
0answers
110 views

Graph Relatives for Tessellation of the Hyperbolic Plane

I'm trying to get into the theory about the Modular group. Among the "Paracompact hyperbolic uniform tilings in [∞,3] family" in the section "Tessellation of the hyperbolic plane" I found the Order-3 ...
0
votes
0answers
19 views

Isohedral polygons that tile space in Voronoi tessellations

Besides the three uniform tilings of space in $\mathbb{R}^2$, are there other regular or semiregular tilings, by one or more types of isohedral polygon, that are also Voronoi tessellations of some ...
0
votes
0answers
27 views

Is the “Fibonacci square tiling” of Fibonacci-sided rectangles always optimal?

Is an optimal square tiling of a rectangle with side lengths of successive Fibonacci numbers always the sequence of Fibonacci numbers, as in the picture below?
31
votes
1answer
2k views

Dividing a square into equal-area rectangles

How many ways are there to tile an $n\times n$ square with exactly $n$ rectangles, each of which has integer sides and area $n$? The sequence $C(n)$ begins 1, 2, 2, 9, 2, 46, 2, 250, 37. Clearly ...
6
votes
2answers
228 views

Squaring the plane, with consecutive integer squares. And a related arrangement

Q1. I was fiddling around with squaring-the-square type algebraic maths, and came up with a family of arrangements of $n^2$ squares, with sides $1, 2, 3\ldots n^2$ ($n$ odd). Which seems like it would ...
3
votes
1answer
46 views

Aperiodic tessellations of the plane

Here are some examples of non-periodic tessellations of the plane. Sir Roger Penrose is the expert in that field. How could someone go about proving that a certain tiling of the infinite plane with ...
1
vote
2answers
193 views

Generating function for number of different tessellation checkered rectangle

Let $R_n$ be checkered rectangle sized $n \times 4, n \ge 1$. Let $a_n$ be number of different $R_n$ tiling with rectangles sized $1 \times 3$. $\ \ \ $ $\ \ \ $ $\ \ \ $ $\ \ \ $ $\ \ \ $ $\ \ \ ...
2
votes
2answers
111 views

Tiling $\mathsf{L}$-shaped spaces using the well-ordering principle

Prove, using the well-ordering principle, that, for all $n\geq 1$, an $\mathsf{L}$-shaped space with two sides of length $2n$ and four sides of length $n$ can be tiled using some number of 3 square ...
1
vote
0answers
47 views

Filling a rectangle with congruent squares in two columns

I have a rectangle. This rectangle is divided into two columns; the widths of these columns are not necessarily equal, and are not known. I want to fill the rectangle with squares. The number of ...
2
votes
1answer
31 views

Is there a convex polygon such that it cannot be tiled with some number of congruent connected pieces?

So the title says it all. I assume that polygons have straight line segments as their edges and that they have finite number of edges. The number $n$ of pieces is, of course, $n>1$, to avoid ...
3
votes
1answer
25 views

Tiling the concave polygons with non-polygons

Suppose that we reside in the set of all concave polygons (that is, polygons which are non-convex and simple, simple means that the boundary of the polygon does not cross itself). Let us denote that ...
5
votes
1answer
40 views

Equilateral polygon plane tiling

From playing around with some toothpicks and peas, I think that it should be possible to prove that the plane cannot be tiled by a possibly infinite set of equilateral polygons with the same number of ...
5
votes
2answers
694 views

How do you build a square from this figure?

If you can use only this figure, what is the LEAST number of such figures that you can use to build a square ? You can use any isometry to build a square and it must be full from the inside.
4
votes
1answer
388 views

Fill the board with dominoes

Imagine a 8x8 cell board that is missing two cells at the opposite corners, a domino takes up exactly two cells. How can you fill the board with dominoes so that none overlap or hang off the edge?
0
votes
0answers
39 views

Tetromino coloring problem on a grid

Problem: All the tiles on an $n\times n$ grid are black or white. Every possible T-tetromino of tiles on the grid is examined. A T-tetromino is 'happy' if has 2 white tiles and 2 black tiles. ...
8
votes
1answer
158 views

Tiling of squares in instances of Pythagoras Theorem

The Pythagorean Theorem (PT) states that in a right triangle, the square on the hypotenuse equals the sum of the squares on the legs or $a^2 + b^2 = c^2$. Is there an instance of PT (a given $a$, $b$ ...
-1
votes
2answers
263 views

Tiling problem: 100 by 100 grid and 1 by 8 pieces

Why can't I tile a $100 \times 100$ table with $1$ by $8$ pieces? If we look at the number of tiles, $100^2$ is divisible by $8$. So this does not contradict existence of such tiling. The standard ...
4
votes
0answers
47 views

When are convex polygon tilings Voronoi?

A square is divided into convex polygons. Is this always a Voronoi diagram? If not, what are some simple examples of non-Voronoi tilings? Which of the pentagon tilings are Voronoi? I took a look ...
7
votes
3answers
541 views

Decidability of tiling of $\mathbb{R}^n$

Given a polytope of dimension $n$, is there some general way to determine if it can tile $\mathbb{R}^n$?
0
votes
1answer
123 views

Tiling a rectangle with L-tromino [duplicate]

Consider a $2^{1999} \times 2^{1999}$ square, with a single $1 \times 1$ square removed. Show that no matter where the small square is removed it is possible to tile this "giant square minus tiny ...
3
votes
2answers
72 views

non-trivial non-repetitive aperiodic tiling of the plane

Which is the less trivial example of non-repetitive aperiodic tiling of the plane you know? I cannot come up with a famous non-repetitive tiling. Are there any? A tiling is repetitive if for every ...
3
votes
1answer
244 views

Tetromino Proof

Prove that an 8 x 8 board cannot be covered by 15 L-tetrominos and one square tetromino (an L-tetromino is a plane figure shown below, constructed from four unit squares arranged in the form of L; a ...
0
votes
1answer
46 views

Can you partition a rectangle into exactly 3 congruent non-rectangular parts?

Recently I came upon the following result: Theorem (*): Let $n$ be a positive integer not equal to $1,3,5,7,9$. Then it is possible to partition a rectangle into exactly $n$ congruent non-rectangular ...