2017/07/19 by Daniele D’Angeli, D'Angeli, Daniele
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Geometric and Algebraic Topology #Mathematical Dynamics and Fractals #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1707.06030
openalex publication_date 2017/07/19 · openalex created_date 2017/07/31 · openalex updated_date 2026/07/28
We study an infinite set of graphs which are recursively constructed from an infinite word in a finite alphabet. These graphs are inspired by the construction of the Sierpiński gasket. We show that there are infinitely many non-isomorphic such graphs and we describe the horofunctions on the standard case.