Horofunctions on Sierpi\'nski type triangles
Combinatorics
2017-07-20 v1
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.
Cite
@article{arxiv.1707.06030,
title = {Horofunctions on Sierpi\'nski type triangles},
author = {Daniele D'Angeli},
journal= {arXiv preprint arXiv:1707.06030},
year = {2017}
}
Comments
to appear in Utilitas Mathematica