A tiling of the sphere by triangles, squares, or hexagons is
convex if every vertex has at
most
,
, or
polygons adjacent to it, respectively. Assigning an appropriate weight to any
tiling, our main results are explicit formulas for the weighted number of
convex tilings with a given number of tiles. To prove these formulas, we
build on work of Thurston, who showed that the convex triangulations
correspond to orbits of vectors of positive norm in a Hermitian lattice
. First, we extend
this result to convex square and hexagon tilings. Then, we explicitly compute the relevant lattice
. Next, we integrate the
Siegel theta function for
to produce a modular form whose Fourier coefficients encode the weighted number of
tilings. Finally, we determine the formulas using finite-dimensionality of spaces of
modular forms.
PDF Access Denied
We have not been able to recognize your IP address
3.238.250.73
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.