主 题: The universal tilers
报告人: 王国亮 博士 (北京国际数学研究中心)
时 间: 2011-06-27 9:30-10:30
地 点: 理科一号楼1418
A well-known open problem in the field of discrete geometry is to find the complete list of polygonal tilers. In this talk, we discuss one of its variations, the problem of finding the complete list of convex polyhedra whose every cross-section tiles the plane. We call such polyhedra universal tilers. We obtain that a polyhedron is a universal tiler only if it is a tetrahedron or a pentahedron.
