Euclid meets Popeye: the Euclidean algorithm for \(2\times 2\) matrices

DOI10.5802/crmath.451zbMath1526.11002arXiv2209.09529MaRDI QIDQ6117116

Roland Bacher

Publication date: 19 July 2023

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.09529

zbMATH Keywords

Euclids algorithm for matricessails of lattices

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Continued fractions and generalizations (11J70) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Matrices, determinants in number theory (11C20)

Cites Work

• Unnamed Item
• Higher dimensional continued fractions
• Alternative formulae for the number of sublattices
• Gaussian binomials and the number of sublattices
• A Quixotic Proof of Fermat’s Two Squares Theorem for Prime Numbers

This page was built for publication: Euclid meets Popeye: the Euclidean algorithm for \(2\times 2\) matrices