It's true, but the question was stated in geometric terms, so the answer should also include identification of letters with cycles. You can't have this for free: if your map is that simple, the expressions for cycles must be a bit more involved then mine :)

@norondion, please don't take the closure personally. If the linked answer is not sufficient for some reason (e.g. it only deals with curves), you should just provide more background in the question body.

I vote to close as duplicate. I also changed the title of the question linked to by David to make it reflect the question/answer more accurately.

@Ben, I retitled your question to reflect more general second question; it includes the first one as well. Feel free to revert!

They discuss the "plus/minus problem" as well: We prove polylogarithmic (C(log n)d) upper and lower bounds for the number of hypercubes needed to tile a hypercuboid in either of the above senses. In more than two dimensions this is a huge improvement on anything previously known. It was not even known whether an n × 1 × 1 cuboid could be tiled with fewer than n cubes in the plus/minus sense. (page 3)

Your answer is very informative: I returned to change formatting and expand it a bit; feel free to revert!

You're entitled to your opinion and generally have great control over the posts you make; sorry if my editing offended you. I'll move on. The site is a collaborative effort, however, so somebody else could still edit the post.