11 Jun
2003
11 Jun
'03
4:34 p.m.
asimovd@aol.com wrote:
...PUZZLE: Given a rhombus tiling of a 2n-gon (so that each polygon edge is a rhombus edge), show that the number of rhombi is determined by n.
The question of counting how many solutions there are, especially in the 3D case of filling a zonohedron with parallelepipeds, is an interesting open question. For a large model and some references, see: G. Hart, "A Color-Matching Dissection of the Rhombic Enneacontahedron", Symmetry: Culture and Science, vol. 11, 2000, pp. 183-199. online at: http://www.georgehart.com/private/hart-v1.doc George http://www.georgehart.com/