Substreetutions and more on trees

arXiv2112.05242MaRDI QIDQ6385262FDOQ6385262

Authors: A. T. Baraviera, Renaud Leplaideur 

Publication date: 9 December 2021

Abstract: We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $mathbb{F}_2^{+}$-action may (or not) be minimal. We study one special example: we show that it belongs to the minimal case and that the number of preimages in the minimal set increases just exponentially fast, whereas it could be expected a super-exponential growth. We also give examples of periodic trees without invariant measure on their orbit. We use our construction to get quasi-periodic colored tilings of the hyperbolic disk.

This page was built for publication: Substreetutions and more on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6385262)