paper

An Elementary Proof of the Minimal Euclidean Function on the Gaussian Integers

arXiv:2205.14043

Abstract

Every Euclidean domain has a minimal Euclidean function, . A companion paper \cite{Graves} introduced a formula to compute . It is the first formula for a minimal Euclidean function for the ring of integers of a non-trivial number field. It did so by studying the geometry of the set and then applied Lenstra's result that to provide a short proof of . Lenstra's proof requires s substantial algebra background. This paper uses the new geometry of the sets to prove the formula for without using Lenstra's result. The new geometric method lets us prove Lenstra's theorem using only elementary methods. We then apply the new formula to answer Pierre Samuel's open question: what is the size of ?. Appendices provide a table of answers and the associated SAGE code.

29 pages, 3 figures, 1 table, 1 appendix with code

An Elementary Proof of the Minimal Euclidean Function on the Gaussian Integers · wovepaper