A Census of Vertices by Generations in Regular Tessellations of the Plane
Combinatorics
2010-06-23 v1
Abstract
We consider regular tessellations of the plane as infinite graphs in which edges and faces meet at each vertex, and in which edges and vertices surround each face. For , these are tilings of the Euclidean plane; for , they are tilings of the hyperbolic plane. We choose a vertex as the origin, and classify vertices into generations according to their distance (as measured by the number of edges in a shortest path) from the origin. For all and with , we determine the rational generating function giving the number of vertices in each generation.
Keywords
Cite
@article{arxiv.1006.4356,
title = {A Census of Vertices by Generations in Regular Tessellations of the Plane},
author = {Alice Paul and Nicholas Pippenger},
journal= {arXiv preprint arXiv:1006.4356},
year = {2010}
}