Horofunctions on Sierpi\'nski type triangles
classification
🧮 math.CO
keywords
graphshorofunctionsinfinitenskisierpialphabetcaseconstructed
read the original abstract
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\'nski gasket. We show that there are infinitely many non-isomorphic such graphs and we describe the horofunctions on the standard case.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.