Graduation Year
2012
Document Type
Open Access Senior Thesis
Degree Name
Bachelor of Science
Department
Mathematics
Reader 1
Nicholas Pippenger
Reader 2
Arthur T. Benjamin
Terms of Use & License Information
Rights Information
© John Choi
Abstract
An isohedral tiling is a tiling of congruent polygons that are also transitive, which is to say the configuration of degrees of vertices around each face is identical. Regular tessellations, or tilings of congruent regular polygons, are a special case of isohedral tilings. Viewing these tilings as graphs in planes, both Euclidean and non-Euclidean, it is possible to pose various problems of enumeration on the respective graphs. In this paper, we investigate some near-regular isohedral tilings of triangles and quadrilaterals in the hyperbolic plane. For these tilings we enumerate vertices as classified by number of edges in the shortest path to a given origin, by combinatorially deriving their respective generating functions.
Recommended Citation
Choi, John, "Counting Vertices in Isohedral Tilings" (2012). HMC Senior Theses. 28.
https://scholarship.claremont.edu/hmc_theses/28
