The Open UniversitySkip to content

Trinity symmetry and kaleidoscopic regular maps

Archdeacon, Dan; Conder, Marston and Siran, Jozef (2014). Trinity symmetry and kaleidoscopic regular maps. Transactions of the American Mathematical Society, 366(8) pp. 4491–4512.

Full text available as:
PDF (Accepted Manuscript) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (421kB) | Preview
DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


A cellular embedding of a connected graph (also known as a map) on an orientable surface has trinity symmetry if it is isomorphic to both its dual and its Petrie dual. A map is regular if for any two incident vertex-edge pairs there is an automorphism of the map sending the first pair onto the second. Given a map M with all vertices of the same degree d, for any e relatively prime to d the power map Me is formed from M by replacing the cyclic rotation of edges at each vertex on the surface with the e th power of the rotation. A map is kaleidoscopic if all of its power maps are pairwise isomorphic. In this paper, we present a covering construction that gives infinite families of kaleidoscopic regular maps with trinity symmetry.

Item Type: Journal Item
Copyright Holders: 2013 American Mathematical Society
ISSN: 1088-6850
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Related URLs:
Item ID: 37407
Depositing User: Jozef Širáň
Date Deposited: 17 May 2013 08:40
Last Modified: 11 Jun 2020 17:15
Share this page:


Altmetrics from Altmetric

Citations from Dimensions

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU