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

0
votes
0answers
15 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
37 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
39 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 ...
9
votes
2answers
182 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
322 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
424 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 ...
3
votes
1answer
402 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 ...
12
votes
4answers
213 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
103 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
17 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
23 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
1k 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 ...
1
vote
0answers
30 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 ...
6
votes
2answers
220 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
42 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
182 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
105 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
31 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
26 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
22 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
38 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
684 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
373 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
34 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
140 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$ ...
-2
votes
2answers
229 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
38 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
528 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
102 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
59 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
221 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
43 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 ...
0
votes
1answer
57 views

covering chess board with 3*1 dominoes [duplicate]

Why is it not possible to cover the chess board with 3X1 dominoes if one of the corner squares is missing (e.g. the top right square)?
5
votes
1answer
73 views

Covering any rectangle with this shape is not possible

Why can I not tile any rectangle without gaps with the given shape? http://i.stack.imgur.com/9oxO4.png You can mirror the shape (i.e. turn it around an axis in its own plane by $\pi$).
3
votes
3answers
146 views

Is this an instance of any existing convex pentagonal tilings?

Inspired by Wikipedia's article on pentagonal tiling, I made my own attempt. I believe this belongs to the 4-tile lattice category, because it's composed of pentagons pointing towards 4 different ...
4
votes
1answer
113 views

Tiling a rectangle and tensor products

Consider the following theorem: Whenever a rectangle is tiled by rectangles each of which has at least one integer side, then the tiled rectangle has at least one integer side. There is a paper ...
2
votes
1answer
115 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 ...
0
votes
2answers
36 views

How many face we could make regular convex polyhedron

I want to tile the sphere as many face as possible. And I want every face be the same size and shape. Is it possible to generate more than 100 or 1000 faces of regular convex polyhedron?
3
votes
2answers
330 views

On pentagonal tilings

The following image has been in the news recently: My understanding is that these are all the known (to-date) tilings of the plane using convex pentagons. Can someone explain to me why the ...
11
votes
4answers
2k views

Penrose Tile generator

Does anyone know if there's a client or web app that generates Penrose patterns which can then be converted to a tileable rectangular background image for web site? I found this ...
0
votes
1answer
27 views

Wrong number of $4\times 4$ domino tilings, but why?

From the internet, I know that a domino tiling of a $4\times4 $ checker board can be arranged in $36$ different ways. With the following reasoning, I conclude that it must be $37$, which is one more ...
3
votes
1answer
130 views

Planar kelvin problem

What is the minimal possible value of the maximal total side length shared by any two tiles in a tiling of the plane if all tiles have the same area $A$? $\text{Total side length} = ...
2
votes
1answer
72 views

Shapes for tiling a circular disk?

Does anyone know of a catalog of sorts for what shapes are allowed for tiling a circular disk? For example, if you are allowed one piece to tile the disk, are all the possibilities essentially ...
0
votes
0answers
22 views

Tessellations of Flower like Functions of the form k + Sin[mx]/n

When, if ever, does the shape of the polar plot of k + Sin[mx]/n from $0\leq x\leq 2 \pi$, where k,m,n $\in$ N form a monotiling in the Euclidean Plane? If some values of k,m, and n allow for this ...
1
vote
1answer
168 views

Truncated octahedron is bipartite. Prove?

Any idea how to prove that when 3D space is tiled with truncated octahedra, all vertices can be colored black and white such that no two vertices, sharing the same color, are adjacent?
2
votes
1answer
63 views

Dominoes on chessboard

A $2016\times 2016$ chessboard is tiled with $2 \times 1$ dominoes. I can prove that there is a grid line that pass through at least $505$ dominoes. But how to prove or disprove that there is a ...
81
votes
5answers
5k views

What is the smallest number of $45^\circ-60^\circ-75^\circ$ triangles that a square can be divided into?

What is the smallest number of $45^\circ-60^\circ-75^\circ$ triangles that a square can be divided into? The image below is a flawed example, from http://www.mathpuzzle.com/flawed456075.gif ...
2
votes
1answer
91 views

Number of algebraic solutions to a formula related to a square tiling problem

How can many different sets of prime-factors fit together so well in this formula? I am curious about the number of solutions to the following equation: $$ r_3 = \sqrt{2}\; \frac{ 1 + r_1 (r_2 ...
2
votes
0answers
84 views

Are there 3D tilings of a 3D projective hyperplane or 3-sphere?

I noticed that pentagons tile the projective plane (a spherical dodecahedron). Something they do not do on a flat euclidean plane. Is there analogous 3D tilings (honeycombs) of a 3D projective ...
2
votes
3answers
406 views

Pictorial puzzle

Can someone suggest a pictorial representation of a mathematical puzzle or problem that could be represented in coloured tiles on an orangery floor $4489\times7525$mm with an insert of $907 ...