Horofunctions on sierpinski type triangles

Authors

  • D'Angeli, Daniele

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.

Published

2017-11-09

How to Cite

D'Angeli, Daniele. (2017). Horofunctions on sierpinski type triangles. Utilitas Mathematica, 105. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1174

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.