English

Rational matrix digit systems

Number Theory 2021-12-10 v2 Commutative Algebra

Abstract

Let AA be a d×dd \times d matrix with rational entries which has no eigenvalue λC\lambda \in \mathbb{C} of absolute value λ<1|\lambda| < 1 and let Zd[A]\mathbb{Z}^d[A] be the smallest nontrivial AA-invariant Z\mathbb{Z}-module. We lay down a theoretical framework for the construction of digit systems (A,D)(A, \mathcal{D}), where DZd[A]\mathcal{D}\subset \mathbb{Z}^d[A] finite, that admit finite expansions of the form x=d0+Ad1++A1d1(N,  d0,,d1D) \mathbf{x}= \mathbf{d}_0 + A \mathbf{d}_1 + \cdots + A^{\ell-1}\mathbf{d}_{\ell-1} \qquad(\ell\in \mathbb{N},\;\mathbf{d}_0,\ldots,\mathbf{d}_{\ell-1} \in \mathcal{D}) for every element xZd[A]\mathbf{x}\in \mathbb{Z}^d[A]. We put special emphasis on the explicit computation of small digit sets D\mathcal{D} that admit this property for a given matrix AA, 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.

Keywords

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

R2 v1 2026-06-24T04:39:37.533Z