Rational matrix digit systems
Abstract
Let be a matrix with rational entries which has no eigenvalue of absolute value and let be the smallest nontrivial -invariant -module. We lay down a theoretical framework for the construction of digit systems , where finite, that admit finite expansions of the form for every element . We put special emphasis on the explicit computation of small digit sets that admit this property for a given matrix , 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.
Cite
@article{arxiv.2107.14168,
title = {Rational matrix digit systems},
author = {Jonas Jankauskas and Jörg M. Thuswaldner},
journal= {arXiv preprint arXiv:2107.14168},
year = {2021}
}
Comments
33 pages, 6 figures (11 illustrations), revised version v2.0, Def. 1 on p.4. reformulated, minor changes in text and corrected misprints