Messaoudi, Ali [UNESP]Nogueira, ArnaldoSchweiger, Fritz2014-05-202014-05-202009-07-01Monatshefte Fur Mathematik. Wien: Springer Wien, v. 157, n. 3, p. 283-299, 2009.0026-9255http://hdl.handle.net/11449/22160We study the ergodic properties of a map called the Triangle Sequence. We prove that the algorithm is weakly convergent almost surely, and ergodic. As far as we know, it is the first example of a 2-dimensional algorithm where a surprising diophantine phenomenon happens: there are sequences of nested cells whose intersection is a segment, although no vertex is fixed. Examples of n-dimensional algorithms presenting this behavior were known for n >= 3.283-299engErgodic theoryInvariant measuresArtigo10.1007/s00605-008-0065-zWOS:000266830800007Acesso restrito2111365241513122