Number systems over general orders (Q2330067): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Kálmán Győry / rank
Normal rank
 
Property / author
 
Property / author: Attila Pethoe / rank
Normal rank
 
Property / author
 
Property / author: Jörg M. Thuswaldner / rank
Normal rank
 
Property / author
 
Property / author: Kálmán Győry / rank
 
Normal rank
Property / author
 
Property / author: Attila Pethoe / rank
 
Normal rank
Property / author
 
Property / author: Jörg M. Thuswaldner / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2955850662 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1810.09710 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:11, 19 April 2024

scientific article
Language Label Description Also known as
English
Number systems over general orders
scientific article

    Statements

    Number systems over general orders (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2019
    0 references
    Let \(\mathcal{O}\) denote an order, that is a commutative ring with \(1\) whose additive group is free abelian of finite rank. A GNS (generalized number system) over \(\mathcal{O}\) is a pair \((p,\mathcal{D})\), where \(p\in\mathcal{O}[x]\) is a monic polynomial such that \(p(0)\) is not a zero divisor of \(\mathcal{O}\), and where \(\mathcal{D}\) is a (necessarily finite) complete residue system of \(\mathcal{O}\) modulo \(p(0)\) containing \(0\). \par If all \(a\in\mathcal{O}[x]\) are representable in \((p,\mathcal{D})\), then \((p,\mathcal{D})\) is called a GNS with the finiteness property. Consider GNS of the type \((p_\alpha,\mathcal{D}_{\mathcal{F},p(\alpha)})\) \((\alpha\in\mathcal{O})\), where \(p_\alpha(x):=p(x+\alpha)\) and \(\mathcal{D}_{\mathcal{F},\vartheta}:=\vartheta\mathcal{F}\cap\mathcal{O}\) for a non-zero element \(\vartheta\) of \(\mathcal{O}\). \textit{A. Pethő} and \textit{J. Thuswaldner} [Monatsh. Math. 187, No. 4, 681--704 (2018; Zbl 1437.11014)] proved that it is algorithmically decidable whether a given GNS \((p,\mathcal{D})\) over \(\mathcal{O}\) has the finiteness property. The purpose of this paper is to extend the results from GNS over orders of number fields to GNS over arbitrary orders. In particular, it is shown that the finiteness property of a given GNS \((p,\mathcal{D})\) over \(\mathcal{O}\) is effectively decidable by applying a result of \textit{A. Vince} on matrix number system [SIAM J. Discrete Math. 6, 501--521 (1993; Zbl 0826.52019)]. \par By defining the digit sets \(\mathcal{D}_{\mathcal{F},\vartheta}\) using fundamental domains \(\mathcal{F}\) of \(\mathcal{O}\otimes_{\mathbb{Z}}\mathbb{R}/\mathcal{O}\), a sufficient condition is proved for a GNS over \(\mathcal{O}\) to admit the finiteness property. If \(p\in\mathcal{O}[x]\) and the fundamental domain \(\mathcal{F}\) satisfies some mild condition then the pairs \((p_\alpha,\mathcal{D}_{\mathcal{F},p(\alpha)})\) are always GNS with the finiteness property provided that there is a large positive rational integer \(m\) such that \(m^{-1}\alpha\) is close to \(1\). \((p_{-m},\mathcal{D}_{\mathcal{F},p(-m)})\) does not have the finiteness property for all large enough positive rational integers \(m\). \par Using some general effective finiteness results of \textit{J.-H. Evertse} and \textit{K. Győry}, Discriminant equations in Diophantine number theory. Cambridge: Cambridge University Press (2017; Zbl 1361.11002)] on monogenic orders in étale algebras, important relations between power integral bases and number systems in étale orders are obtained, which can be interpreted as GNS over \(\mathbb{Z}\).
    0 references
    0 references
    0 references
    number system
    0 references
    order
    0 references
    tiling
    0 references
    0 references
    0 references