2000 character limit reached
Horofunctions of infinite Sierpinski polygon graphs
Published 31 Jul 2025 in math.CO and math.MG | (2507.23681v1)
Abstract: Generalizing works of D'Angeli and Donno, we describe, starting from an infinite sequence over $r$ letters with $r \neq 4i$ and $i \in \mathbb{N}$, a sequence of pointed finite graphs. We study the pointed Gromov-Hausdorff limit graphs giving a description of isomorphim classes in terms of dihedral groups and providing insights on the horofunction boundaries in terms of Busemann and non-Busemann points.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.