Rational matrix digit systems
Abstract
Let A be a d × d matrix with rational entries which has no eigenvalue λ ∈ C of absolute value |λ| < 1 and let Zd[A] be the smallest nontrivial A-invariant Z-module. We lay down a theoretical framework for the construction of digit systems (A, D), where D⊂ Zd[A] finite, that admit finite expansions of the form \[ x= d0 + A d1 + ·s + A-1d-1 (∈ N,\;d0,…,d-1 ∈ D) \] for every element x∈ Zd[A]. We put special emphasis on the explicit computation of small digit sets D that admit this property for a given matrix A, using techniques from matrix theory, convex geometry, and the Smith Normal Form. Moreover, we provide a new proof of general results on this finiteness property and recover analogous finiteness results for digit systems in number fields a unified way.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.