Related papers: Thompson's group F is 1-counter graph automatic

The braided Ptolemy-Thompson group $T^*$ is an extension of the Thompson group $T$ by the full braid group $B_{\infty}$ on infinitely many strands. This group is a simplified version of the acyclic extension considered by Greenberg and…

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…

Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting…

Let $G$ be a group. The intersection subgroup graph of $G$ (introduced by Anderson et al. \cite{anderson}) is the simple graph $\Gamma_{S}(G)$ whose vertices are those non-trivial subgroups say $H$ of $G$ with $H\cap K=\{e\}$ for some…

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…

We propose a new unifying framework for Thompson-like groups using a well-known device called operads and category theory as language. We discuss examples of operad groups which have appeared in the literature before. As a first…

In this short article, we prove that any automorphism of the R. Thompson's group $F$ has infinitely many twisted conjugacy classes. The result follows from the work of Matthew Brin, together with a standard facts on R. Thompson's group $F$,…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

For a centerless group G, we can define its automorphism tower. We define G^{alpha} : G^0=G, G^{alpha +1}=Aut(G^alpha) and for limit ordinals G^delta=bigcup_{alpha < delta}G^alpha . Let tau_G be the ordinal when the sequence stabilizes.…

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…

String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…

Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…

Let $(\Gamma,+,F)$ be a finitely generated $\mathbb Z[F]$-module where $F$ is an injective endomorphism of the abelian group $\Gamma$. We restrict ourselves to a finite automa presentable subclass, introduced by J. Bell and R. Moosa in…

We study topological full groups attached to groupoid models for left regular representations of Garside categories. Groups arising in this way include Thompson's group $V$ and many of its variations such as R\"over-Nekrashevych groups. Our…

We answer the question by Matt Brin on the structure of diagram groups over semigroup presentation ${\mathcal P}=\langle a,b,c\mid a=bc,b=ca,c=ab\rangle$. In the talk on Oberwolfach workshop, Brin conjectured that the diagram group over…

An automorphism of a graph $G$ with $n$ vertices is a bijective map $\phi$ from $V(G)$ to itself such that $\phi(v_i)\phi(v_j)\in E(G)$ $\Leftrightarrow$ $v_i v_j\in E(G)$ for any two vertices $v_i$ and $v_j$ of $G$. Denote by…

A subset $S$ of a group $G$ invariably generates $G$ if $G= \langle s^{g(s)} | s \in S\rangle$ for every choice of $g(s) \in G,s \in S$. We say that a group $G$ is invariably generated if such $S$ exists, or equivalently if $S=G$ invariably…

A monoid is said to be special if it admits a presentation in which all defining relations are of the form $w = 1$. Groups are familiar examples of special monoids. This article studies the geometric and structural properties of the Cayley…

We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).