From: Allan Wechsler <acwacw@gmail.com> So the current state of the art is that the minimum possible c is between 0.707... and 0.92... ? I wonder if a computer search on a reasonably-sized piece of Z^2 could give any insights.
--I'm back to not understanding Veit Elser's solution yielding c<0.92... The problem I have is: although the amazing TILE is 8-way rotationally symmetric, the TILING is not, it has only 4-way rotational symmetry, same symmetry as the grid Z^2=G1. In short the tiling "does not know about" G2. What would have established 0.92 is, each tile contains exactly one point in G1 and exactly one point in G2. I'm only seeing one of those claims. The state of my art is, c is logarithmically infinite or less, almost certainly less. If Elser's result is discarded we currently have no proof c is finitely bounded, but do have nonrigorous arguments, which perhaps can be rigorized, indicating it grows slowly at most, at most like (logN)^(3/4) or logstar(N), and perhaps is finite. Indeed in the Lp norm versions of the problem with p finite, I have given an argument c is finitely bounded, and sketched how to rigorize the argument (but have not carried thru the details, so caveat emptor). The proof of the O(logN) upper bound is rigorous but only works for rotation angles whose tangent is quadratic irrational. I think this is an excellent problem. Great rich depths are hidden inside it.