Amicable Triangle and Rectangles on the Integer Lattice

2025/03/26 by Praton, Iwan, Zeng, Weiran · 1 citation
#51 #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)

paper · doi:10.48550/arxiv.2503.20458

Abstract

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². We show that there is one pair of amicable lattice triangles and five pairs of amicable lattice rectangles.

Cited by

• Amicable Heronian Parallelograms

Related

• Amicable Heronian Parallelograms
• Amicable Heron triangles
• Integer Area Dissections of Lattice Polygons via a Non-Abelian Sperner's Lemma
• A Closer Look at Lattice Points in Rational Simplices
• Is there a smooth lattice polytope which does not have the integer decomposition property?