All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Number systems over general orders

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F19%3AA20023O8" target="_blank" >RIV/61988987:17310/19:A20023O8 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/article/10.1007%2Fs10474-019-00958-x" target="_blank" >https://link.springer.com/article/10.1007%2Fs10474-019-00958-x</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s10474-019-00958-x" target="_blank" >10.1007/s10474-019-00958-x</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Number systems over general orders

  • Original language description

    Let O be an order, that is a commutative ring with 1 whose additive structure is a free Z-module of finite rank. A generalized number system (GNS for short) over O is a pair (p, D) where p is an element of O[x] is monic with constant term p(0) not a zero divisor of O, and where D is a complete residue system modulo p(0) in O containing 0. We say that (p, D) is a GNS over O with the finiteness property if all elements of O[x]/(p) have a representative in D[x] (the polynomials with coefficients in D). Our purpose is to extend several of the results from a previous paper of Petho 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 O and GNS (p, D) over O, the pair (p, D) admits the finiteness property. This is closely related to work of Vince on matrix number systems. Let F be a fundamental domain for O circle times(Z) R/O and p is an element of O[X] a monic polynomial. For alpha is an element of O, define p(alpha)(x) := p(x+ alpha) and D-F, p(alpha) := p(alpha) F boolean AND O. Under mild conditions we show that the pairs (p(alpha), D-F, (p(alpha))) are GNS over O with finiteness property provided alpha is an element of O in some sense approximates a sufficiently large positive rational integer. In the opposite direction we prove under different conditions that (p(-m), D-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 ' etale orders and GNS over Z. Their proofs depend on some general effective finiteness results of Evertse and Gyory on monogenic etale orders.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

    <a href="/en/project/GA17-02804S" target="_blank" >GA17-02804S: Properties of number sequences and their applications</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2019

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    ACTA MATH HUNG

  • ISSN

    0236-5294

  • e-ISSN

    1588-2632

  • Volume of the periodical

    159

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    19

  • Pages from-to

    187-205

  • UT code for WoS article

    000486228800012

  • EID of the result in the Scopus database

    2-s2.0-85068158786