Lattice equable quadrilaterals I: Parallelograms
L’Enseignement Mathématique · 2021
DOI: 10.4171/lem/1013 ↗Kurz gefasst
Fachartikel in der Zeitschrift L’Enseignement Mathématique, 2021. Verfasst von Christian Aebi und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Zitieren
APA
Aebi, C., & Cairns, G. (2021). Lattice equable quadrilaterals I: Parallelograms. L’Enseignement Mathématique. https://doi.org/10.4171/lem/1013
Vancouver
Aebi C, Cairns G. Lattice equable quadrilaterals I: Parallelograms. L’Enseignement Mathématique. 2021. doi:10.4171/lem/1013
BibTeX
@article{Aebi2021,
author = {Aebi, Christian and Cairns, Grant},
title = {Lattice equable quadrilaterals I: Parallelograms},
journal = {L’Enseignement Mathématique},
year = {2021},
doi = {10.4171/lem/1013}
}
EUVIMED