Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.20093 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916028589539328 |
|---|---|
| author | Biekietov, Bohdan Praton, Iwan Zeng, Weiran |
| author_facet | Biekietov, Bohdan Praton, Iwan Zeng, Weiran |
| contents | A polygon is equable if its area is equal to its perimeter. A pair of polygons is an amicable pair if the area of the first is equal to the perimeter of the second, and vice versa. A polygon is a lattice polygon if its vertices lie on the integer lattice. We show that amicable lattice rhombuses are actually equable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_20093 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Amicable Lattice Rhombuses are Amicable Biekietov, Bohdan Praton, Iwan Zeng, Weiran Metric Geometry A polygon is equable if its area is equal to its perimeter. A pair of polygons is an amicable pair if the area of the first is equal to the perimeter of the second, and vice versa. A polygon is a lattice polygon if its vertices lie on the integer lattice. We show that amicable lattice rhombuses are actually equable. |
| title | Amicable Lattice Rhombuses are Amicable |
| topic | Metric Geometry |
| url | https://arxiv.org/abs/2605.20093 |