Document Type

Article

Publication Date

8-19-1997

First Advisor

S. Allen Broughton

Abstract

A tiling is a covering by polygons, without gaps or overlapping, of a compact, orientable surface. We are particularly interested in tilings by triangles that generate a large symmetry group of the surface. An oval of the tiling is a simple, closed curve that is a union of edges of the tiling. We investigate the number of points of intersection of two ovals. We have found that the number of intersections is bounded when the subgroup of orientation preserving symmetries is abelian. However, there is no upper bound on the number of intersections in the non-abelian case.

Comments

MSTR 97-03

Download

Share

COinS