Digit expansions in rational and algebraic basis
Abstract
Consider α ∈ (i) satisfying |α| >1. Let = \0,1,…,|a0|-1\, where a0 is the independent coefficient of the minimal primitive polynomial of α. We introduce a way of expanding complex numbers in base α with digits in that we call α-expansions, which generalize rational base number systems introduced by Akiyama, Frougny and Sakarovitch, and are related to rational self-affine tiles introduced by Steiner and Thuswaldner. We define an algorithm to obtain the expansions for certain Gaussian integers and show results on the language. We then extend the expansions to all x ∈ (or x ∈ when α = ∈ , the rational case will be our starting point) and show that they are unique almost everywhere. We relate them to tilings of the complex plane. We characterize α-expansions in terms of p-adic completions of (i) with respect to Gaussian primes.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.