Number systems over general orders
Abstract
Let be an order, that is a commutative ring with whose additive structure is a free -module of finite rank. A generalized number system (GNS for short) over is a pair where is monic with constant term not a zero divisor of , and where is a complete residue system modulo in containing . We say that is a GNS over with the finiteness property if all elements of have a representative in (the polynomials with coefficients in ). Our purpose is to extend several of the results from a previous paper of Peth\H{o} and Thuswaldner, where GNS over orders of number fields were considered. We prove that it is algorithmically decidable whether or not for a given order and GNS over , the pair admits the finiteness property. This is closely related to work of Vince on matrix number systems. Let be a fundamental domain for and a monic polynomial. For , define and . Under mild conditions we show that the pairs are GNS over with finiteness property provided in some sense approximates a sufficiently large positive rational integer. In the opposite direction we prove under different conditions that does not have the finiteness property for each large enough positive rational integer .
Keywords
Cite
@article{arxiv.1810.09710,
title = {Number systems over general orders},
author = {Jan-Hendrik Evertse and Kálmán Győry and Attila Pethő and Jörg M. Thuswaldner},
journal= {arXiv preprint arXiv:1810.09710},
year = {2019}
}
Comments
16 pages