Nit-picking: "each tile to a tile" perhaps? Unclear what deformations are implied by "adjust"! Finally, (why) must such a minimum exist? WFL On 8/9/20, Dan Asimov <dasimov@earthlink.net> wrote:
Suppose we tessellate the plane by the unit squares with vertices at the integer points. We'd now like to adjust this tessellation so that
1) The boundary of each tile is a simple closed polygon;
2) The set of translations that carry each tile to another tile is exactly the integer vectors (K,L) ∊ Z^2.
Puzzle: Which tile shape satisfying 1) and 2) is such that each tile's boundary polygon has the shortest possible length?
—Dan
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun