paper

Characterization of rational matrices that admit finite digit representations

arXiv:1801.01839

Abstract

Let be an matrix with rational entries and let \[ \mathbb{Z}^n[A] := \bigcup_{k=1}^{\infty} \left( \mathbb{Z}^n + A\mathbb{Z}^n + \dots + A^{k-1}\mathbb{Z}^n\right) \] be the minimal -invariant -module containing the lattice . If is a finite set we call the pair a digit system. We say that has the finiteness property if each can be written in the form \[ \mathbf{z} = \mathbf{d}_0 + A\mathbf{d}_1 + \dots + A^k\mathbf{d}_k, \] with and digits for . We prove that for a given matrix there is a finite set such that has the finiteness property if and only if has no eigenvalue of absolute value . This result is the matrix analogue of the height reducing property of algebraic numbers. In proving this result we also characterize integer polynomials that admit digit systems having the finiteness property in the quotient ring .

arXiv commentRevised version, accepted for publication by Linear Algebra and its Applications, 8 pages. Corrections of 3 misprints and a light changes in text of first paragraph on page 2