Lattice equable quadrilaterals I: Parallelograms

  • Christian Aebi

    Collège Calvin, Genève, Switzerland
  • Grant Cairns

    La Trobe University, Melbourne, Australia
Lattice equable quadrilaterals I: Parallelograms cover

A subscription is required to access this article.


This paper studies equable parallelograms whose vertices lie on the integer lattice. Using Rosenberger’s Theorem on generalised Markov equations, we show that the g.c.d. of the side lengths of such parallelograms can only be 3, 4 or 5, and in each of these cases the set of parallelograms naturally forms an infinite tree all of whose vertices have degree 4, bar the root. The paper then focuses on what we call Pythagorean equable parallelograms. These are lattice equable parallelograms whose complement in a circumscribing rectangle consists of two Pythagorean triangles. We prove that for these parallelograms the shortest side can only be 3, 4, 5, 6 or 10, and there are five infinite families of such parallelograms, given by solutions to corresponding Pell-like equations.

Cite this article

Christian Aebi, Grant Cairns, Lattice equable quadrilaterals I: Parallelograms. Enseign. Math. 67 (2021), no. 3/4, pp. 369–401

DOI 10.4171/LEM/1013