Horofunctions on sierpinski type triangles
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 Sierpinski gasket. We show that there are infinitely many non-isomorphic such graphs and we describe the horofunctions on the standard case. © 2017 Utilitas Mathematica Publishing Inc.. All rights reserved.











