Related papers: The structure of random automorphisms of the rando…
A general overview of the phenomenon of automatic continuity of homomorphisms between Polish groups is given. In particular, we study variants and improvements of the closed graph theorem, applying these to the problem of continuity of…
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
We estimate the number of graphical regular representations (GRRs) of a given group with large enough order. As a consequence, we show that almost all finite Cayley graphs have full automorphism groups 'as small as possible'. This confirms…
A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group…
We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…
We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary…
We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub-coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global…
We consider the graph whose vertex set is a conjugacy class ${\mathcal C}$ consisting of finite-rank self-adjoint operators on a complex Hilbert space $H$. The dimension of $H$ is assumed to be not less than $3$. In the case when operators…
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…
We show that the number of twisted conjugacy classes is infinite for any automorphism of non-elementary, Gromov hyperbolic group . An analog of Selberg theory for twisted conjugacy classes is proposed.
We show that every two-dimensional class of topological similarity, and hence every diagonal conjugacy class of pairs, is meager in the group of order preserving bijections of the rationals and in the group of automorphisms of the randomly…
We continue the study of the properties of graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to the ball of radius $r$ in some fixed vertex-transitive graph $F$, for various choices of $F$ and $r$. This is…
We study the action of the mapping class group on the real homology of finite covers of a topological surface. We use the homological representation of the mapping class to construct a faithful infinite-dimensional representation of the…
We show that every abstract homomorphism $\varphi$ from a locally compact group $L$ to a graph product $G_\Gamma$, endowed with the discrete topology, is either continuous or $\varphi(L)$ lies in a 'small' parabolic subgroup. In particular,…
Two distinct projections of finite rank $m$ are adjacent if their difference is an operator of rank two or, equivalently, the intersection of their images is $(m-1)$-dimensional. We extend this adjacency relation on other conjugacy classes…
We prove a compactness theorem for automorphisms of free groups. Namely, we show that the set of automorphisms keeping bounded the length of the uniform current is compact (up to conjugation.) This implies that the spectrum of the length of…
In this paper, we consider the probability that a randomly chosen automorphism of a finite group fixes a randomly chosen element of a subgroup of that group. We obtain several new results as well as generalizations and improvements of some…
The relative fixity of a permutation group is the maximum proportion of the points fixed by a non-trivial element of the group and the relative fixity of a graph is the relative fixity of its automorphism group, viewed as a permutation…
We give strengthened versions of the Herwig-Lascar and Hodkinson-Otto extension theorems for partial automorphisms of finite structures. Such strengthenings yield several combinatorial and group-theoretic consequences for homogeneous…