Related papers: Virtually free groups are stable in permutations

We examine Hilbert-Schmidt stability (HS-stability) of discrete amenable groups from several angles. We give a short, elementary proof that finitely generated nilpotent groups are HS-stable. We investigate the permanence of HS-stability…

We compute the rational stable homology of the automorphism groups of free nilpotent groups. These groups interpolate between the general linear groups over the ring of integers and the automorphism groups of free groups, and we employ…

We prove homological stability for both general linear groups of modules over a ring with finite stable rank and unitary groups of quadratic modules over a ring with finite unitary stable rank. In particular, we do not assume the modules…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

The groups QF, QT, and QV are groups of quasi-automorphisms of the infinite binary tree. Their names indicate a similarity with Thompson's well-known groups F, T, and V. We will use the theory of diagram groups over semigroup presentations…

We prove that a variety of algebras whose finitely generated members are free must be definitionally equivalent to the variety of sets, the variety of pointed sets, a variety of vector spaces over a division ring, or a variety of affine…

We prove that a permutation group in which different finite sets have different stabilizers cannot satisfy any group law. For locally compact topological groups with this property we show that almost all finite subsets of the group generate…

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. In 2014 Babai proved that the…

We show that any graph product of residually finite monoids is residually finite. As a special case we obtain that any free product of residually finite monoids is residually finite. The corresponding results for graph products of…

We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…

We present a strong connection between quantum information and quantum permutation groups. Specifically, we define a notion of quantum isomorphisms of graphs based on quantum automorphisms from the theory of quantum groups, and then show…

We associate with every locally expanding self-covering $f:M\to M$ of a compact path connected metric space a finitely presented group $V_f$. We prove that this group is a complete invariant of the dynamical system: two groups $V_{f_1}$ and…

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…

We consider a finite, connected and simple graph $\Gamma$ that admits a vertex-transitive group of automorphisms $G$. Under the assumption that, for all $x \in V(\Gamma)$, the local action $G_x^{\Gamma(x)}$ is the action of…

We prove that the tree almost automorphism groups admit exactly three commensurability classes of closed commensurated subgroups. Our proof utilizes an independently interesting characterization of subgroups of the tree almost automorphism…

The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…

A graph is edge-primitive if its automorphism group acts primitively on the edge set. In this short paper, we prove that a finite 2-arc-transitive edge-primitive graph has almost simple automorphism group if it is neither a cycle nor a…

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

For $N\geq 4$, we show that there exist automorphisms of the free group $F_N$ which have a parabolic orbit in $\partial F_N$. In fact, we exhibit a technology for producing infinitely many such examples.

Let K be an algebraically closed field of characteristic zero. We show that if the automorphisms group of a quasi-affine variety X is infinite, then X is uniruled.