Related papers: Some isomorphism results for Thompson like groups …

We aim to interpret important constructions in the theory of automorphisms of the shift dynamical system in terms of subgroups $\mathcal{L}_{n,r}$ of the outer-automorphism groups $\mathcal{O}_{n,r}$ of the Higman--Thompson group $G_{n,r}$,…

We show that Thompson's group F does not satisfy Cannon's almost convexity condition AC(n) for any integer n in the standard finite two generator presentation. To accomplish this, we construct a family of pairs of elements at distance n…

We study the bounded cohomology of certain groups acting on the Cantor set. More specifically, we consider the full group of homeomorphisms of the Cantor set as well as Thompson's group $V$. We prove that both of these groups are boundedly…

We prove that the Higman-Thompson groups $T_n$ and $V_n$ are non-inner amenable for all $n\ge 2$. This extends Haagerup and Olesen's result that Thompson's groups $T=T_2$ and $V=V_2$ are non-inner amenable. Their proof relied on machinery…

We consider the isomorphism problem for hypergraphs taking as input two hypergraphs over the same set of vertices $V$ and a permutation group $\Gamma$ over domain $V$, and asking whether there is a permutation $\gamma \in \Gamma$ that…

We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only…

The group of isometries W of a regular rooted tree, and many of its subgroups with branching structure, have groups of automorphisms induced by conjugation in W. This fact has stimulated the computation of the group of automorphisms of such…

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

We prove that if $G$ is a group of finite Morley rank which acts definably and generically sharply $n$-transitively on a connected abelian group $V$ of Morley rank $n$ with no involutions, then there is an algebraically closed field $F$ of…

We study subgroups of Thompson's group $F$ by means of an automaton associated with them. We prove that every maximal subgroup of $F$ of infinite index is closed, that is, it coincides with the subgroup of $F$ accepted by the automaton…

Given a countable group $G$ splitting as a free product $G=G_1\ast\dots\ast G_k\ast F_N$, we establish classification results for subgroups of the group $Out(G,\mathcal{F})$ of all outer automorphisms of $G$ that preserve the conjugacy…

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 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…

Suppose that R is an ordered ring, G_n(R) is a subsemigroup of $GL_n(R)$, consisting of all matrices with nonnegative elements. A.V. Mikhalev and M.A. Shatalova described all automorphisms of G_n(R), where R is a linearly ordered skewfield…

We prove that we have an isomorphism of type $A_{aut}(\mathbb C_\sigma[G])\simeq A_{aut}(\mathbb C[G])^\sigma$, for any finite group $G$, and any 2-cocycle $\sigma$ on $G$. In the particular case $G=\mathbb Z_n^2$, this leads to a…

Let $G$ be a connected graph on $n$ vertices and $1 \le k \le n-1$ an integer. The $k$-token graph of $G$ is the graph $F_k(G)$ whose vertices are all the $k$-subsets of vertices of $G$, two of which are adjacent whenever their symmetric…

We show that each of Thompson's groups F, T, and V have infinitely many ends relative to certain subgroups. We go on to show that T and V both have Serre's property FA, i.e., any action of T or V on a tree will have a fixed point. (The…

We consider diagram groups as defined by V. Guba and M. Sapir. A diagram group G acts on the associated cube complex K by isometries. It is known that if a cube complex L is of a finite dimension then every isometry g of L is semi-simple,…

In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…

Consider an infinite homogeneous tree $T_n$ of valence $n+1$, its group $Aut(T_n)$ of automorphisms, and the group $Hie(T_n)$ of its spheromorphisms (hierarchomorphisms), i.~e., the group of homeomorphisms of the boundary of $T_n$ that…