Approximate embedding of large polygons into $Z^2$
Michael Boshernitzan

TL;DR
This paper demonstrates that large scaled polygons can be approximately embedded into the integer lattice $Z^2$ through a suitable rotation, with the approximation error arbitrarily small, extending prior results with a concise proof.
Contribution
The paper provides a short, self-contained proof that large scaled polygons can be rotated to approximate the integer lattice within any desired precision.
Findings
Existence of rotations aligning scaled polygons with $Z^2$ within $ ext{eps}$
Extension of Ziegler's 2006 result to broader settings
Simplified proof approach for approximate lattice embedding
Abstract
Let denote the standard lattice in the plane . We prove that given a finite subset and , then for all sufficiently large dilations there exists a rotation around the origin such that , for all . The result, in a larger generality, has been proved in 2006 by Tamar Ziegler (improving earlier results by Furstenberg, Katznelson, Weiss). The proof presented in the paper is short and self-contained.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Limits and Structures in Graph Theory · Mathematical Approximation and Integration
