Related papers: On vertex stabilisers in symmetric quintic graphs

We study the Fibered Isomorphism conjecture of Farrell and Jones for groups acting on trees. We show that under certain conditions the conjecture is true for groups acting on trees when the stabilizers satisfy the conjecture. These…

We determine the groups of automorphisms and their orbits for nilpotent Lie algebras of class 2 and small dimension, over arbitrary fields (including the characteristic 2 case).

We prove that all finite graphs of groups with cyclic vertex and edge groups act freely and isometrically on a complete, nonpositively curved geodesic metric space.

Recently, the work on quantum automorphism groups of graphs has seen renewed progress, which we expand in this paper. Quantum symmetry is a richer notion of symmetry than the classical symmetries of a graph. In general, it is non-trivial to…

We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…

We prove that in dimensions not equal to 4, 5, or 7, the homology and homotopy groups of the classifying space of the topological group of diffeomorphisms of a disk fixing the boundary are finitely generated in each degree. The proof uses…

We consider the action of a finite group $G$ by locality preserving automorphisms (quantum cellular automata) on quantum spin chains. We refer to such group actions as ``symmetries''. The natural notion of equivalence for such symmetries is…

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…

We study the basic relation between skew-symmetric Lotka-Volterra systems and graphs, both at the level of objects and morphisms, and derive a classification from it of skew-symmetric Lotka-Volterra systems in terms of graphs as well as in…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Let $G$ be a permutation group on a set $\Omega$ and recall that a base for $G$ is a subset of $\Omega$ such that its pointwise stabiliser is trivial. In a recent paper, Burness and Giudici introduced the Saxl graph of $G$, denoted…

We show that a finite group which admits a faithful, smooth, orientation-preserving action on a homology 4-sphere, and in particular on the 4-sphere, is isomorphic to a subgroup of the orthogonal group SO(5), by explicitly determining the…

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…

The symmetric edge polytope ($\mathrm{SEP}$) of a finite simple graph $G$ is a centrally symmetric lattice polytope whose vertices are defined by the edges of the graph. Among the information encoded by these polytopes are the symmetries of…

We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…

We study connected components of the Morse boundary and their stabilisers. We introduce the notion of point-convergence and show that if the set of non-singleton connected components of the Morse boundary of a finitely generated group $G$…

We prove that, given a finite graph $\Sigma$ satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of $\Sigma$. Applying this result, we establish the existence of infinite families of…

Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…

We consider closed, Weyl-transitive groups of automorphisms of thick buildings. For each element of such a group, we derive a combinatorial formula for its scale and establish the existence of a tidy subgroup for it that equals the…

The automorphism group of the Petersen Graph is shown to be isomorphic to the symmetric group on 5 elements. The image represents the Petersen Graph with the ten 3-element subsets of $\{1, 2, 3, 4, 5\}$ as vertices. Two vertices are…