Questions tagged [tiling]
For questions about mathematical tiling.
284
questions
2
votes
0
answers
87
views
Hexagon tiling and affine Weyl group $\widetilde{A}_2$
Let $H$ be a regular hexagonal room centered at the origin. Let $W$ be the group generated by reflections about the six sides of $H$. It's well known that $W$ is the affine Weyl group of type $\...
2
votes
0
answers
56
views
On convex polygons that can be cut into convex and mutually congruent pieces in exactly one way
Observations: any thin isosceles triangle has exactly 1 partition into 2 congruent pieces - only 1 line, bisector of its apex, does it.
By attaching a right triangle with base 1 and altitude 2 to an ...
1
vote
1
answer
152
views
On cutting tetrahedrons into mutually congruent pieces
Simple observations: A regular tetrahedron can be cut into 2 mutually congruent pieces (in 3 obvious ways which are all basically the same way, giving one and same pair of congruent pieces). The ...
0
votes
0
answers
71
views
Are there triangles that can be cut into 7 mutually congruent connected polygons?
First question below had appeared in a note at Triangles that can be cut into mutually congruent and non-convex polygons
Following the results of Beeson quoted in the answer at Subdivision of ...
8
votes
1
answer
499
views
Tracking a reference: "Karl Scherer, A Puzzling Journey to the Reptiles and Related Animals"
I linked a paper by James Schmerl in a recent question which cites Karl Scherer, A Puzzling Journey to the Reptiles and Related Animals, Privately Published, 1987.
I have had difficulty finding any ...
15
votes
1
answer
477
views
Dividing a polyhedron into two similar copies
The paper Dividing a polygon into two similar polygons proves that there are only three families of polygons that are irrep-2-tiles (can be subdivided into similar copies of the original).
Right ...
1
vote
0
answers
50
views
'Self-similar and perfect' partitions of planar regions
Definition: A partition of a planar figure into finitely many pieces that are all similar to itself and also mutually non-congruent may be called a self-similar perfect partition.
A classical example ...
4
votes
1
answer
420
views
Perfect squaring of rectangles
A perfect squaring of a rectangle may be defined as a partition of the rectangle into finitely many squares all of which are mutually non-congruent. https://en.wikipedia.org/wiki/Squaring_the_square ...
0
votes
0
answers
40
views
Trying to extend a theorem on Tiling with mutually non-congruent triangles
In the light of Cubing the cube - as 'perfectly' as possible, We try to slightly 'relax' the main theorem proved by Kupaavski, Pach and Tardos here:
https://arxiv.org/pdf/1711.04504.pdf
...
4
votes
0
answers
93
views
Non-monotileable amenable groups
This is crossposted from MSE.
We say a subset $A$ of a group $G$ is a monotile for $G$ if $G$ is a disjoint union of right translates of $A$.
In his article Monotileable Amenable Groups, B. Weiss ...
8
votes
0
answers
145
views
Cubing the cube - as 'perfectly' as possible
Ref: https://en.wikipedia.org/wiki/Squaring_the_square
A perfect cubing of a cube is a partition of the cube into some finite number of smaller cubes that are pair-wise non-congruent. The above page ...
5
votes
0
answers
184
views
A puzzle with magic Egyptian tilings
Background
I've recently been devising a puzzle that incorporates elements from Egyptian fractions, magic squares, and tilings. The objective of the puzzle is to tessellate a square with sides of ...
4
votes
0
answers
124
views
Hyponontiling Wang tiles
Call a finite collection of tiles that can tile the plane if we have to use each tile at least once tiling.
Is there a collection of at least 3 tiles that is not tiling, but such that after removing ...
11
votes
1
answer
451
views
Examples of games developed purposely to analyze players' strategies for mathematics research
Background
This question is about games that were created, developed, deployed and popularized1 by researchers because they wanted to learn more about some mathematical structure, and did so by ...
1
vote
1
answer
95
views
To place copies of a planar convex region such that number of 'contacts' among them is maximized
A contact between two planar convex regions obviously happens either along a line segment or at a single point.
Question: Given a planar convex region $C$ and a number $n$, we need to lay out $n$ ...