Related papers: Freeness of automata groups vs boundary dynamics
We are interested in the subgroup membership problem in groups acting on rooted $d$-regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from the root. These rays, which can also be viewed as infinite…
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…
We prove that the semigroup generated by a reversible Mealy automaton contains a free subsemigroup of rank two if and only if it contains an element of infinite order.
Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.
We give a survey on results regarding self-similar and automaton presentations of free groups and semigroups and related products. Furthermore, we discuss open problems and results with respect to algebraic decision problems in this area.
Given a countable group $G$, we develop a method to construct an overgroup $H$ that is finitely generated, highly transitive and mixed identity free. Our construction can be controlled to ensure that some fundamental group theoretic…
We consider free higher derivative theories of scalars and Dirac fermions in the presence of a boundary in general dimension. We establish a method for finding consistent conformal boundary conditions in these theories by removing certain…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…
Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…
We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few. We compare the obtained language families with those induced by deterministic…
It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable…
In this expository note we provide a proof of Artin's theorem which states that the commutator subgroup of a free group on two generators is not finitely generated. The proof employs the infinite grid as in two other proofs in the…
We show that if $G$ is a real semi-simple Lie group, and $\Gamma$ is a discrete subgroup of $G$ containing a subgroup $\Sigma$ acting ergodically (in a strong sense) on the Furstenberg boundary of $G$, then $\Gamma$ is not isomorphic to a…
Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…
Using the semigroup approach to abstract boundary control problems we characterize the space of all exactly reachable states. Moreover, we study the situation when the controls of the system are required to be positive. The abstract results…
Let $K$ be a field of characteristic zero, let $\sigma$ be an automorphism of $K$ and let $\delta$ be a $\sigma$-derivation of $K$. We show that the division ring $D=K(x;\sigma,\delta)$ either has the property that every finitely generated…
Let $A=A(x_{1},...,x_{n})$ be a free associative algebra in $\mathcal{A}$ freely generated over $K$ by a set $X=\{x_{1},...,x_{n}\}$, $End A$ be the semigroup of endomorphisms of $A$, and $Aut End A$ be the group of automorphisms of the…