查看 最近的 文章
通过不动点定理、六边形定理及其等价性理解连接在六边形中的不可能性。
Understanding the Impossibility of a Tie in Hex via Fixed Point Theorems, the Hex Theorem, and Their Equivalence.
自K. Reinhardt在1918年的论文以来,人们已经知道存在恰好三种凸六边形可以铺砌平面。 然而,这一事实的证明远未完整。 我们在一个比凸性弱得多的假设下证明了这一事实。
Since the thesis of K. Reinhardt in 1918, it is well known that there are exactly three types of convex hexagons that can tile the plane. However, the proof of the fact is far from being complete. We prove this fact, under an assumption much weaker than the convexity.