To appear in Periodica Mathematica Hungarica MINIMAL EXPANSIONS IN REDUNDANT NUMBER SYSTEMS: FIBONACCI BASES AND GREEDY ALGORITHMS

Abstract

We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are… (More)

Topics

10 Figures and Tables

Slides referencing similar topics