Dissecting a square into congruent polygons
From MaRDI portal
Abstract: We study the dissection of a square into congruent convex polygons. Yuan emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. extbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number , it is true that the tile must be a rectangle. We conjecture that the same conclusion still holds even if the number of tiles is an odd number . Our conjecture has been confirmed for triangles in earlier works. We prove that the conjecture holds if either the tile is a convex -gon with or it is a right-angle trapezoid.
Recommendations
- Dissecting the square into seven or nine congruent parts
- Dissections of regular polygons into similar triangles
- Tilings of convex polygons by equilateral triangles of many different sizes
- Tiling convex polygons with congruent isosceles right triangles
- A generalized conjecture about cutting a polygon into triangles of equal areas
Cites work
- A Dissection Problem
- A textbook of graph theory
- Dissecting a square into rectangles of equal area
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- scientific article; zbMATH DE number 752601 (Why is no real title available?)
- On Dividing a Square Into Triangles
- Rectangular dissections of a square
- Tiling the unit square with squares and rectangles
- Trisecting a rectangle
Cited in
(3)
This page was built for publication: Dissecting a square into congruent polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386618)