2016
DOI: 10.1016/j.jmaa.2016.06.046
|View full text |Cite|
|
Sign up to set email alerts
|

Dependence with complete connections and the Gauss–Kuzmin theorem for N-continued fractions

Abstract: We consider a family {T N : N ≥ 1} of interval maps as generalizations of the Gauss transformation. For the continued fraction expansion arising from T N , we solve its Gauss-Kuzmin-type problem by applying the theory of random systems with complete connections by Iosifescu. Mathematics Subject Classifications (2010). 11J70, 11K50

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 24 publications
0
7
0
Order By: Relevance
“…Our study is a continuation of the papers [11] and [12], where the second author discussed some metric properties of N -continued fraction expansions. Moreover, he investigated the associated Perron-Frobenius operator and proved a Gauss-Kuzmin theorem for N -continued fractions by applying the method of random systems with complete connections (RSCC) by Iosifescu [8].…”
Section: Introductionmentioning
confidence: 92%
See 2 more Smart Citations
“…Our study is a continuation of the papers [11] and [12], where the second author discussed some metric properties of N -continued fraction expansions. Moreover, he investigated the associated Perron-Frobenius operator and proved a Gauss-Kuzmin theorem for N -continued fractions by applying the method of random systems with complete connections (RSCC) by Iosifescu [8].…”
Section: Introductionmentioning
confidence: 92%
“…, a 2 , a 1 + t] N , n ≥ 2, while s 1,t = N/(a 1 + t), t ∈ I. These facts lead us to the random system with complete connections [11] {(I, B I ), (Λ, P(Λ)), u, V }, where P(Λ) is the power set of Λ,…”
Section: )mentioning
confidence: 99%
See 1 more Smart Citation
“…This method is based on a Gauss-Kuzmin-Lévy theorem. For greedy N -expansions this theorem is proved by Dan Lascu in [13]. The method yields smoother results than by simulating in the classical way (looking at the histogram of the orbit of a typical point as described in Choe's book [14], and used in his papers [12,15]).…”
Section: Introductionmentioning
confidence: 99%
“…where {x} is the fractional part of x. Such transformations were first introduced in [3] (the associated continued fractions had appeared in [2]) and also studied in [7][8] [11]. For every p, T p has a unique absolutely continuous ergodic invariant measure dµ p (x) = 1 ln(p + 1) − ln p…”
mentioning
confidence: 99%