A census of vertices by generations in regular tessellations of the plane

From MaRDI portal
(Redirected from Publication:540084)



Abstract: We consider regular tessellations of the plane as infinite graphs in which q edges and q faces meet at each vertex, and in which p edges and p vertices surround each face. For 1/p+1/q=1/2, these are tilings of the Euclidean plane; for 1/p+1/q<1/2, 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 pge3 and qge3 with 1/p+1/qle1/2, we determine the rational generating function giving the number of vertices in each generation.


Summary: We consider regular tessellations of the plane as infinite graphs in which \(q\) edges and \(q\) faces meet at each vertex, and in which \(p\) edges and p vertices surround each face. For \(1/p + 1/q = 1/2\), these are tilings of the Euclidean plane; for \(1/p + 1/q < 1/2\), 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 \(p \geq 3\) and \(q \geq 3\) with \(1/p + 1/q \leq 1/2\), we give simple combinatorial derivations of the rational generating functions for the number of vertices in each generation.











This page was built for publication: A census of vertices by generations in regular tessellations of the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540084)