Related papers: Groups with Context-Free Co-Word Problem and Embed…

We investigate which free constructions (amalgamated products and HNN-extensions) over word hyperbolic groups produce groups that are again word hyperbolic. A complete answer is obtained for the case when the amalgamated subgroups are…

Thompson's group $V$ has a rich variety of subgroups, containing all finite groups, all finitely generated free groups and all finitely generated abelian groups, the finitary permutation group of a countable set, as well as many wreath…

We show that for any continuous monotonic fixed-point free automorphism $f$ on a $\sigma$-compact subgroup $G\subset \mathbb R$ there exists a binary operation $+_f$ such that $\langle G, +_f\rangle$ is a topological group topologically…

We find algebraic conditions on a group equivalent to the position of its Diophantine problem in the Chomsky Hierarchy. In particular, we prove that a finitely generated group has a context-free Diophantine problem if and only if it is…

We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…

Let $\mathcal G$ denote the space of finitely generated marked groups. We give equivalent characterizations of closed subspaces $\mathcal S\subseteq \mathcal G$ satisfying the following zero-one law: for any sentence $\sigma$ in the…

It can be shown that each permutation group $G \sqsubseteq S_n$ can be embedded, in a well defined sense, in a connected graph with $O(n+|G|)$ vertices. Some groups, however, require much fewer vertices. For instance, $S_n$ itself can be…

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…

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the…

For a prime number $p$ and a free pro-$p$ group $G$ on a totally ordered basis $X$, we consider closed normal subgroups $G^\Phi$ of $G$ which are generated by $p$-powers of iterated commutators associated with Lyndon words in the alphabet…

We show that Thompson's group F is the symmetry group of the "generic idempotent". That is, take the monoidal category freely generated by an object A and an isomorphism A \otimes A --> A; then F is the group of automorphisms of A.

Composing with the inclusion $\mathsf{Set}\to\mathsf{Cat} $, a graph $G$ internal to $\mathsf{Set} $ becomes a graph of discrete categories, the coinserter of which is the category freely generated by $G$. Introducing a suitable definition…

In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…

Given a finite alphabet X and an ordering on the letters, the map \sigma sends each monomial on X to the word that is the ordered product of the letter powers in the monomial. Motivated by a question on Groebner bases, we characterize…

We have developed polynomial-time algorithms to generate terms of the cogrowth series for groups $\mathbb{Z}\wr \mathbb{Z},$ the lamplighter group, $(\mathbb{Z}\wr \mathbb{Z})\wr \mathbb{Z}$ and the Navas-Brin group $B.$ We have also given…

We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…

In previous work, joint with Bux, Fluch, Marschler and Witzel, we proved that the braided Thompson groups are of type $\textrm{F}_\infty$. The proof utilized certain contractible cube complexes, which in this paper we prove are CAT(0). We…

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…

A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…