Abstract
Abstract We define a notion of substitution on colored binary trees that we call substreetution. We show that a point fixed by a substreetution may (or not) be almost periodic, and thus the closure of the orbit under the $\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 measures on their orbit. We use our construction to get quasi-periodic colored tilings of the hyperbolic disk.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
