Dissections of regular polygons into triangles of equal areas (Q1122147): Difference between revisions

The following theorem is proved: Let \(n\geq 5\) be an integer. Then a regular n-gon is dissectable into m triangles of equal areas iff m is a multiple of n. For the proof the author uses Sperner's lemma, non- Archimedean valuations and dissectability-techniques.

0 references

zbMATH Keywords

dissections

0 references

convex polygons

0 references

tilings

0 references

reviewed by

Jörg M. Wills

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Dissection of the Hypercube into Simplexes

0 references

On Dividing a Square Into Triangles

0 references

A Dissection Problem

0 references

Identifiers

zbMATH Open document ID

0675.52005

0 references

DOI

10.1007/BF02187738

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1122147

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5587233
@@ Property / cites work: Q5587233 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3856844
@@ Property / cites work: Q3856844 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3939864
@@ Property / cites work: Q3939864 / rank @@
+Normal rank
@@ Property / cites work @@
+Dissection of the Hypercube into Simplexes
@@ Property / cites work: Dissection of the Hypercube into Simplexes / rank @@
+Normal rank
@@ Property / cites work @@
+On Dividing a Square Into Triangles
@@ Property / cites work: On Dividing a Square Into Triangles / rank @@
+Normal rank
@@ Property / cites work @@
+A Dissection Problem
@@ Property / cites work: A Dissection Problem / rank @@
+Normal rank