Skip to main content
Log in

Number systems over general orders

  • Published:
Acta Mathematica Hungarica Aims and scope Submit manuscript

Abstract

Let \(\mathcal{O}\) be an order, that is a commutative ring with 1 whose additive structure is a free \(\mathbb{Z}\)-module of finite rank. A generalized number system (GNS for short) over \(\mathcal{O}\) is a pair \((p, \mathcal{D})\) where \(p \in \mathcal{O}[x]\) is monic with constant term p(0) not a zero divisor of \(\mathcal{O}\), and where \(\mathcal{D}\) is a complete residue system modulo p(0) in \(\mathcal{O}\) containing 0. We say that \((p, \mathcal{D})\) is a GNS over \(\mathcal{O}\) with the finiteness property if all elements of \(\mathcal{O}[x]/(p)\) have a representative in \(\mathcal{D}[x]\) (the polynomials with coefficients in \(\mathcal{D}\)). Our purpose is to extend several of the results from a previous paper of Pethő 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 \(\mathcal{O}\) and GNS \((p, \mathcal{D})\) over \(\mathcal{O}\), the pair \((p, \mathcal{D})\) admits the finiteness property. This is closely related to work of Vince on matrix number systems.

Let \(\mathcal{F}\) be a fundamental domain for \(\mathcal{O}{\otimes}_\mathbb{Z} \mathbb{R}/\mathcal{O}\, {\rm and}\, p \in \mathcal{O}[X]\) a monic polynomial. For \(\alpha \in \mathcal{O}\), define \(p_{\alpha}(x) := p(x+\alpha) {\rm and} \mathcal{D}_{\mathcal{F},p(\alpha)} := p(\alpha)\mathcal{F} \bigcap \mathcal{O}\). Under mild conditions we show that the pairs \((p_{\alpha},\mathcal{D}_{\mathcal{F},p(\alpha)})\) are GNS over \(\mathcal{O}\) with finiteness property provided \(\alpha \in \mathcal{O}\) in some sense approximates a sufficiently large positive rational integer. In the opposite direction we prove under different conditions that \((p_{-m},\mathcal{D}_{\mathcal{F},p(-m)})\) does not have the finiteness property for each large enough positive rational integer m.

We obtain important relations between power integral bases of étale orders and GNS over \(\mathbb{Z}\). Their proofs depend on some general effective finiteness results of Evertse and Győry on monogenic étale orders.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. Akiyama, T. Borbély, H. Brunotte, A. Pethő, and J. M. Thuswaldner, Generalized radix representations and dynamical systems. I, Acta Math. Hungar., 108 (2005), 207–238

  2. Akiyama, S., Rao, H.: New criteria for canonical number systems. Acta Arith. 111, 5–25 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brunotte, H., Huszti, A., Pethő, A.: Bases of canonical number systems in quartic algebraic number fields. J. Théor. Nombres Bordeaux 18, 537–557 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. J.-H. Evertse and K. Győry, Discriminant Equations in Diophantine Number Theory, New Mathematical Monographs, Vol. 32, Cambridge University Press (Cambridge, 2017)

  5. V. Grünwald, Intorno all'aritmetica dei sistemi numerici a base negativa con particolare riguardo al sistema numerico a base negativo-decimale per lo studio delle sue analogie coll`aritmetica (decimale), Giornale di Matematiche di Battaglini, 23 (1885), 203–221; Errata, p. 367

  6. K. Győry, Sur les polynômes à coefficients entiers et de discriminant donné. III, Publ. Math. Debrecen, 23 (1976), 141–165

  7. K. Győry, On polynomials with integer coefficients and given discriminant. IV, Publ. Math. Debrecen, 25 (1978), 155–167

  8. Kovács, B.: Canonical number systems in algebraic number fields. Acta Math. Hungar. 37, 405–407 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kovács, B., Pethő, A.: Number systems in integral domains, especially in orders of algebraic number fields. Acta Sci. Math. (Szeged) 55, 286–299 (1991)

    MathSciNet  MATH  Google Scholar 

  10. A. Pethő, On a polynomial transformation and its application to the construction of a public key cryptosystem, in: Computational Number Theory (Debrecen, 1989), de Gruyter (Berlin, 1991), pp. 31–43

  11. Pethő, A., Thuswaldner, J.M.: Number systems over orders. Monatsh. Math. 187, 681–704 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  12. Scheicher, K., Thuswaldner, J.M.: On the characterization of canonical number systems. Osaka J. Math. 41, 327–351 (2004)

    MathSciNet  MATH  Google Scholar 

  13. Vince, A.: Replicating tesselations. SIAM J. Disc. Math. 6, 501–521 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. Győry.

Additional information

Research of K. Gy. was supported in part by the OTKA grant NK115479.

Research of A. P. was supported in part by the grant no. 17-02804S of the Czech Grant Agency.

Research of J. T. was supported by the FWF grants P27050 and P29910.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Evertse, JH., Győry, K., Pethő, A. et al. Number systems over general orders. Acta Math. Hungar. 159, 187–205 (2019). https://doi.org/10.1007/s10474-019-00958-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10474-019-00958-x

Key words and phrases

Mathematics Subject Classification

Navigation