Ayuda
Ir al contenido

Dialnet


Finite-rank Bratteli-Vershik diagrams are expansive: a new proof

    1. [1] Norwegian University of Science and Technology-NORWAY
  • Localización: Mathematica scandinavica, ISSN 0025-5521, Vol. 120, Nº 2, 2017, págs. 195-210
  • Idioma: inglés
  • Texto completo no disponible (Saber más ...)
  • Resumen
    • Downarowicz and Maass (Ergod. Th. and Dynam. Sys. 28 (2008), 739–747) proved that the Cantor minimal system associated to a properly ordered Bratteli diagram of finite rank is either an odometer system or an expansive system. We give a new proof of this truly remarkable result which we think is more transparent and easier to understand. We also address the question (Question 1) raised by Downarowicz and Maass and we find a better (i.e. lower) bound. In fact, we conjecture that the bound we have found is optimal.


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus

Opciones de compartir

Opciones de entorno