Related papers: Context-Free Groups and Bass-Serre Theory
A survey article that presents some recent algebraic and model-theoretic results on the automorphism groups of relatively free groups of infinite rank. The topics include topological aspects, generating sets, descripition of automorpisms…
We construct words with small image in a given finite alternating or unimodular group. This shows that word width in these groups is unbounded in general.
In this paper, we study the density of subsets of nonabelian free groups using relative densities of languages. We start by proving some basic properties about the density of a language $L_1$ relative to another language $L_2$ containing…
It is shown that there exist finitely generated infinite simple groups of infinite commutator width and infinite square width on which there exists no stably unbounded conjugation-invariant norm, and in particular stable commutator length…
Let $\Sigma = X\cup X^{-1} = \{ x_1 ,x_2 ,..., x_m ,x_1^{-1} ,x_2^{-1} ,..., x_m^{-1} \}$ and let $G$ be a group with set of generators $\Sigma$. Let $\mathfrak{L} (G) =\left\{ \left. \omega \in \Sigma^* \; \right\vert \;\omega \equiv e \;…
For any context-free grammar, we build a transition diagram, that is, a finite directed graph with labeled arcs, which describes the work of the grammar. This approach is new, and it is different from previously known graph models. We…
We prove that the word problem for the infinite cyclic group is not EDT0L, and obtain as a corollary that a finitely generated group with EDT0L word problem must be torsion. In addition, we show that the property of having an EDT0L word…
Automatic groups admitting prefix closed automatic structures with uniqueness are characterized as the quotients of free groups by normal subgroups possessing sets of free generators satisfying certain language-theoretic conditions.
In this paper, we study the topological structure of a universal construction related to quasitopological groups: the free quasitopological group $F_q(X)$ on a space $X$. We show that free quasitopological groups may be constructed directly…
It is shown that the big free group (the set of countably-long words over a countable alphabet) is almost free, in the sense that any function from the alphabet to a compact topological group factors through a homomorphism. This statement…
We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…
Several methods are discussed that construct a finite automaton given a context-free grammar, including both methods that lead to subsets and those that lead to supersets of the original context-free language. Some of these methods of…
We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…
The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…
We study the space of ends of groups. For a finitely generated group, this is a Cantor space as soon as it is infinite. In contrast, we show that for infinitely generated countable groups, it exhibits several behaviors. For instance, we…
We establish combinatorial characterizations of virtually torsion-free and virtually free groups using the canonical graph decomposition theory in \cite{DJKK22}. Our main results show that a finitely presented, residually finite group…
A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…
We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…
In 1985, Dunwoody showed that finitely presentable groups are accessible. Dunwoody's result was used to show that context-free groups, groups quasi-isometric to trees or finitely presentable groups of asymptotic dimension 1 are virtually…
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…