Lifting a prescribed group of automorphisms of graphs
Abstract
In this paper we are interested in lifting a prescribed group of automorphisms of a finite graph via regular covering projections. Here we describe with an example the problems we address and refer to the introductory section for the correct statements of our results. Let be the Petersen graph, say, and let be a regular covering projection. With the current covering machinery, it is straightforward to find with the property that every subgroup of lifts via . However, for constructing peculiar examples and in applications, this is usually not enough. Sometimes it is important, given a subgroup of , to find along which lifts but no further automorphism of does. For instance, in this concrete example, it is interesting to find a covering of the Petersen graph lifting the alternating group but not the whole symmetric group . (Recall that .) Some other time it is important, given a subgroup of , to find with the property that is the lift of . Typically, it is desirable to find satisfying both conditions. In a very broad sense, this might remind wallpaper patterns on surfaces: the group of symmetries of the dodecahedron is , and there is a nice colouring of the dodecahedron (found also by Escher) whose group of symmetries is just . In this paper, we address this problem in full generality.
Keywords
Cite
@article{arxiv.1801.02340,
title = {Lifting a prescribed group of automorphisms of graphs},
author = {Pablo Spiga and Primož Potočnik},
journal= {arXiv preprint arXiv:1801.02340},
year = {2018}
}
Comments
10 pages