Ergodic properties of triangle partitions
Nenhuma Miniatura disponível
Data
2009-07-01
Autores
Messaoudi, Ali [UNESP]
Nogueira, Arnaldo
Schweiger, Fritz
Título da Revista
ISSN da Revista
Título de Volume
Editor
Springer Wien
Resumo
We 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.
Descrição
Palavras-chave
Ergodic theory, Invariant measures
Como citar
Monatshefte Fur Mathematik. Wien: Springer Wien, v. 157, n. 3, p. 283-299, 2009.