Related papers: Automorphism groups of edge-transitive maps
This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.
A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. For a prime p, we call a bi-Cayley graph over a metacyclic p-group a bi-p-metacirculant.…
We study the automorphisms of modular curves associated to Cartan subgroups of $\mathrm{GL}_2(\mathbb Z/n\mathbb Z)$ and certain subgroups of their normalizers. We prove that if $n$ is large enough, all the automorphisms are induced by the…
We compute the automorphism group of the intersection graph of many large-type Artin groups. This graph is an analogue of the curve graph of mapping class groups but in the context of Artin groups. As an application, we deduce a number of…
We show that the natural map from the mapping class groups of surfaces to the automorphism groups of free groups, induces an infinite loop map on the classifying spaces of the stable groups after plus construction. The proof uses…
We study the automorphism group of an idempotent evolution algebra, show that any finite group can be the automorphism group of an evolution algebra, and describe certain evolution algebras with given automorphism groups. In particular, we…
We show that the morphisms from the braid group with n strands in the mapping class group of a surface with a possible non empty boundary, assuming that its genus is smaller or equal to n/2 are either cyclic morphisms (their images are…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…
This is the first in a sequence of papers that will develop the theory of automorphisms of nonsolvable finite groups. The sequence will culminate in a new proof of McBride's Nonsolvable Signalizer Functor Theorem, which is one of the…
We show that any twisted Dijkgraaf-Witten representation of a mapping class group of an orientable, compact surface with boundary has finite image. This generalizes work of Etingof, Rowell and Witherspoon showing that the braid group images…
This paper is an exploration of the faithful transitive permutation representations of the orientation-preserving automorphisms groups of highly symmetric toroidal maps and hypermaps. The main theorems of this paper give a list of all…
A connected graph $\Gamma=(V,E)$ of valency at least $3$ is called a basic $2$-arc-transitive graph if its full automorphism group has a subgroup $G$ with the following properties: (i) $G$ acts transitively on the set of $2$-arcs of…
A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…
We say that an edge colouring $c$ of a graph preserves an automorphism $\varphi$ if $\varphi$ maps each edge to an edge of the same colour. Otherwise, we say that $c$ breaks $\varphi$. We call an automorphism of a graph small if it moves…
This thesis concerns the study of homogeneous factorisations of complete graphs with edge-transitive factors. A factorisation of a complete graph $K_n$ is a partition of its edges into disjoint classes. Each class of edges in a…
We give conceptual proofs of some results on the automorphism group of an Enriques surface X, for which only computational proofs have been available. Namely, there is an obvious upper bound on the image of Aut(X) in the isometry group of…
Barbieri recently showed that the finite graphs realising any given finite automorphism group have unbounded genus, answering a question of Cornwell et al. In this note we give a short proof of a stronger result: they have unbounded clique…
Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…