Related papers: Automorphisms of geometric structures associated t…

We investigate the general structure of the automorphism group and the Lie algebra of derivations of a finitely generated vertex operator algebra. The automorphism group is isomorphic to an algebraic group. Under natural assumptions, the…

We determine the automorphism groups of Koras-Russell threefolds of the second kind. In particular we show that these groups are semi-direct products of two subgroups, one given by the multiplicative group and the other isomorphic to a…

A Coxeter group acts properly and cocompactly by isometries on the Davis complex for the group; we call the quotient of the Davis complex under this action the Davis orbicomplex for the group. We prove the set of finite covers of the Davis…

We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…

In this paper, we consider regular automorphism groups of graphs in the RT$2$ family and the Davis-Xiang family and amorphic abelian Cayley schemes from these graphs. We derive general results on the existence of non-abelian regular…

In this paper, we investigate automorphisms of compact K\"ahler manifolds with different levels of topological triviality. In particular, we provide several examples of smooth complex projective surfaces X whose groups of…

We generalise the result of Tent and Ziegler to homogeneous structures that have a stationary independence relation without the symmetry axiom. We apply our result to prove simplicity of the automorphism group of some asymmetric examples…

We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…

In this paper we introduce the galaxy of Coxeter groups -- an infinite dimensional, locally finite, ranked simplicial complex which captures isomorphisms between Coxeter systems. In doing so, we would like to suggest a new framework to…

We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…

We give a complete characterization of the graph products of cyclic groups admitting a Polish group topology, and show that they are all realizable as the group of automorphisms of a countable structure. In particular, we characterize the…

A characterization is given of finite groups $H$ that have skew-morphisms of order coprime to the order $|H|$, and their skew-morphisms. A complete classification is then given of the automorphism groups and the underlying graphs of…

Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

We consider the Cayley graph ${\rm C}(W,S)$ of a Coxeter system $(W,S)$ and describe all maximal $2$-cliques in this graph, i.e. maximal subsets in the vertex set such that the distance between any two distinct elements is equal to $2$. As…

We construct for every connected locally finite graph $\Pi$ the quantum automorphism group $\text{QAut}\ \Pi$ as a locally compact quantum group. When $\Pi$ is vertex transitive, we associate to $\Pi$ a new unitary tensor category…

We compute Aut(W) for any even Coxeter group whose Coxeter diagram is connected, contains no edges labeled 2, and cannot be separated into more than 2 connected components by removing a single vertex. The description is given explicitly in…

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

Let $(W,S)$ be a Coxeter system and $\Gamma$ be a group of automorphisms of $W$ such that $\gamma(S)=S$ for all $\gamma \in \Gamma$. Then it is known that the group of fixed points $W^\Gamma$ is again a Coxeter group with a canonically…