2008
DOI: 10.1007/s00605-008-0065-z
|View full text |Cite
|
Sign up to set email alerts
|

Ergodic properties of triangle partitions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
35
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 22 publications
(35 citation statements)
references
References 7 publications
0
35
0
Order By: Relevance
“…This algorithm is reminiscent of the Garrity triangle sequence (Assaf et al [1]; Messaoudi, Nogueira and Schweiger [3]). We find three branches on the triangle with vertices .1; 0/, .0; 1/ and .…”
Section: Another Ideamentioning
confidence: 99%
“…This algorithm is reminiscent of the Garrity triangle sequence (Assaf et al [1]; Messaoudi, Nogueira and Schweiger [3]). We find three branches on the triangle with vertices .1; 0/, .0; 1/ and .…”
Section: Another Ideamentioning
confidence: 99%
“…If not, what classes of cubic irrationals will have a periodic triangle sequence under various compositions of maps? As shown in [11] , the original triangle map is ergodic. It is well known that the Mönkemeyer map is ergodic [14].…”
Section: Proofmentioning
confidence: 99%
“…(This is in part the goal of the work of Lagarias in [10].) In this paper, we develop a language by generalizing the triangle map, which was introduced in [6] and further developed in [1], [15] and [11]. This generalization produces a family of 216 multidimensional continued fraction algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…We begin by describing the original triangle map, which is a multidimensional continued fraction algorithm, as defined in [10] and further developed in [1,17] . (The triangle map was shown to be 3 erogodic in [14].) We then introduce permutations into the definition of the triangle map, thereby generating a family of 216 multidimensional continued fractions.…”
Section: The Trip Algorithmsmentioning
confidence: 99%