Infinitely many hypermaps of a given type and genus.
Jones, Gareth A., Pinto, Daniel (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jones, Gareth A., Pinto, Daniel (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
David Singerman (1988)
Revista Matemática de la Universidad Complutense de Madrid
Similarity:
All maps of type (m,n) are covered by a universal map M(m,n) which lies on one of the three simply connected Riemann surfaces; in fact M(m,n) covers all maps of type (r,s) where r|m and s|n. In this paper we construct a tessellation M which is universal for all maps on all surfaces. We also consider the tessellation M(8,3) which covers all triangular maps. This coincides with the well-known Farey tessellation and we find many connections between M(8,3) and M.
Steve Wilson (1997)
Mathematica Slovaca
Similarity:
Antonio J. Breda d'Azevedo, Roman Nedela (2003)
Mathematica Slovaca
Similarity: