The minimal Euclidean function on the Gaussian integers

From MaRDI portal
Publication:2111255




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.









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)