Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.20458 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912295168245760 |
|---|---|
| author | Praton, Iwan Zeng, Weiran |
| author_facet | Praton, Iwan Zeng, Weiran |
| contents | Two polygons are amicable if the perimeter of one is equal to the area of the other and vice versa. A polygon is a lattice polygon if its vertices are on the integer lattice $\Z^2$. We show that there is one pair of amicable lattice triangles and five pairs of amicable lattice rectangles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_20458 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Amicable Triangle and Rectangles on the Integer Lattice Praton, Iwan Zeng, Weiran Metric Geometry Combinatorics 51 Two polygons are amicable if the perimeter of one is equal to the area of the other and vice versa. A polygon is a lattice polygon if its vertices are on the integer lattice $\Z^2$. We show that there is one pair of amicable lattice triangles and five pairs of amicable lattice rectangles. |
| title | Amicable Triangle and Rectangles on the Integer Lattice |
| topic | Metric Geometry Combinatorics 51 |
| url | https://arxiv.org/abs/2503.20458 |