Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-10T14:54:46.585Z Has data issue: false hasContentIssue false

Exponents of orientable maps

Published online by Cambridge University Press:  01 July 1997

R Nedela
Affiliation:
Department of Mathematics, Faculty of Science, Matej Bel University, 975 49 Banská Bystrica, Slovakia. Email: nedela@bb.sanet.sk
M škoviera
Affiliation:
Department of Computer Science, Faculty of Mathematics and Physics, Comenius University, 842 15 Bratislava, Slovakia. Email: skoviera@fmph.uniba.sk
Get access

Abstract

We generalize the idea of reflexibility of a map on a surface by introducing certain integers as its ”exponents“. An exponent is any integer $e$ with the property that changing the cyclic permutation of edges around each vertex induced by the map to its $e$-th power gives rise to an isomorphic map. The exponents reduced modulo the least common multiple of the vertex valencies form an Abelian group, the exponent group $\mbox{Ex}\,(M)$ of the map $M$. Along with the automorphism group, the group in fact provides an additional measure of symmetry of ~$M$.

The paper is devoted to developing the fundamentals of the theory of exponent groups of maps. Motivation comes from the problem of classification of regular maps with a given underlying graph. To this end, we prove that the number of non-isomorphic regular maps (if any) with a given underlying graph and the same map automorphism group is $|{\Bbb Z}_n^*:\mbox{Ex}\,(M)|$, $n$ being the valency of $M$. We calculate the exponent groups for some interesting families of regular maps including complete maps. Special attention is paid to the problem of how the antipodality of a map is reflected by its exponent group. In the final section we discuss several open problems.

1991 Mathematics Subject Classification: 05C10, 05C25, 20F32.

Type
Research Article
Copyright
London Mathematical Society 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)