The minimal Euclidean function on the Gaussian integers

From MaRDI portal
Publication:2111255

DOI10.1016/J.INDAG.2022.09.005zbMATH Open1504.13021arXiv2110.13112OpenAlexW2788155848MaRDI QIDQ2111255FDOQ2111255


Authors: Hester Graves Edit this on Wikidata


Publication date: 28 December 2022

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Abstract: In 1949, Motzkin proved that every Euclidean domain R has a minimal Euclidean function, phiR. He showed that when R=mathbbZ, the minimal function is phimathbbZ(x)=lfloorlog2|x|floor. For over seventy years, phimathbbZ has been the only example of an explictly-computed minimal function in a number field. We give the first explicitly-computed minimal function in a non-trivial number field, phimathbbZ[i], which computes the length of the shortest possible (1+i)-ary expansion of any Gaussian integer. We also present an algorithm that uses phimathbbZ[i] to compute minimal (1+i)-ary expansions of Gaussian integers. We solve these problems using only elementary methods.


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




Recommendations




Cites Work


Cited In (4)





This page was built for publication: The minimal Euclidean function on the Gaussian integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111255)