The minimal Euclidean function on the Gaussian integers
From MaRDI portal
Publication:2111255
Abstract: In 1949, Motzkin proved that every Euclidean domain has a minimal Euclidean function, . He showed that when , the minimal function is . For over seventy years, 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, , which computes the length of the shortest possible -ary expansion of any Gaussian integer. We also present an algorithm that uses to compute minimal -ary expansions of Gaussian integers. We solve these problems using only elementary methods.
Recommendations
- On the number of divisions of the Euclidean algorithm applied to Gaussian integers
- Bounds for the Euclidean minima of function fields
- Euclidean rings of algebraic numbers and functions
- Euclidean functions of computable Euclidean domains
- Computation of the Euclidean minimum of algebraic number fields
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)