Orbits of N-expansions with a finite set of digits

C.J. de Jonge*, Cor Kraaikamp, Hitoshi Nakada

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

3 Citations (Scopus)
26 Downloads (Pure)

Abstract

For N∈ N≥ 2 and α∈ R such that 0<α≤N-1, we define Iα: = [α, α+ 1] and Iα-:=[α,α+1) and investigate the continued fraction map Tα:Iα→Iα-, which is defined as Tα(x):=Nx-d(x), where d: Iα→ N is defined by d(x):=⌊Nx-α⌋. For N∈ N≥ 7, for certain values of α, open intervals (a, b) ⊂ Iα exist such that for almost every x∈ Iα there is an n∈ N for which Tαn(x)∉(a,b) for all n≥ n. These gaps (a, b) are investigated using the square Υα:=Iα×Iα-, where the orbitsTαk(x),k=0,1,2,… of numbers x∈ Iα are represented as cobwebs. The squares Υα are the union of fundamental regions, which are related to the cylinder sets of the map Tα, according to the finitely many values of d in Tα. In this paper some clear conditions are found under which Iα is gapless. If Iα consists of at least five cylinder sets, it is always gapless. In the case of four cylinder sets there are usually no gaps, except for the rare cases that there is one, very wide gap. Gaplessness in the case of two or three cylinder sets depends on the position of the endpoints of Iα with regard to the fixed points of Iα under Tα.

Original languageEnglish
Pages (from-to)79-119
Number of pages41
JournalMonatshefte fur Mathematik
Volume198
Issue number1
DOIs
Publication statusPublished - 2022

Keywords

  • Continued fractions
  • Dynamical systems
  • Gaps

Fingerprint

Dive into the research topics of 'Orbits of N-expansions with a finite set of digits'. Together they form a unique fingerprint.

Cite this