In 1949, Motzkin proved that every Euclidean domain $R$ has a minimal Euclidean function, $\phi_R$. He showed that when $R = \mathbb{ Z}$, the minimal function is $\phi_{ \mathbb{ Z}}(x) = \lfloor \log_2 |x| \rfloor$. For over seventy years, $\phi_{ \mathbb{ Z}}$ 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, $\phi_{ \mathbb{ Z}[i]}$, which computes the length of the shortest possible $(1+i)$-ary expansion of any Gaussian integer. We also present an algorithm that uses $\phi_{ \mathbb{ Z}[i]}$ to compute minimal $(1+i)$-ary expansions of Gaussian integers. We solve these problems using only elementary methods.
Categories: math.NT