Related papers: Linearly Mismatched Free-by-Cyclic Groups are Asyn…

Most slowly synchronizing automata over binary alphabets are circular, i.e., containing a letter permuting the states in a single cycle, and their set of synchronizing words has maximal state complexity, which also implies complete…

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…

We show that certain orderable groups admit no isolated left orders. The groups we consider are cyclic amalgamations of a free group with a general orderable group, the HNN extensions of free groups over cyclic subgroups, and a particular…

Let T be a tree with an action of a finitely generated group G. Given a suitable equivalence relation on the set of edge stabilizers of T (such as commensurability, co-elementarity in a relatively hyperbolic group, or commutation in a…

Recently, I. J. Leary and A. Minasyan studied the class of groups $G(A,L)$ defined as commensurating HNN-extensions of $\mathbb{Z}^n$. This class, containing the class of Baumslag-Solitar groups, also includes other groups with curious…

Define an augmented LD-system, or ALD-system, to be a set equipped with two binary operations, one satisfying the left self-distributivity law $x * (y * z) = (x * y) * (x * z)$ and the other satisfying the mixed laws $(x o y) * z = x * (y *…

In 1993, Muzychuk \cite{muzychuk} showed that the rational Schur rings over a cyclic group $Z_n$ are in one-to-one correspondence with sublattices of the divisor lattice of $n$, or equivalently, with sublattices of the lattice of subgroups…

We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…

The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…

We find and discuss an unexpected (to us) order $n$ cyclic group of automorphisms of the Lie algebra $I\mathfrak{u}_n := \mathfrak{u}_n\ltimes\mathfrak{u}_n^\ast$, where $\mathfrak{u}_n$ is the Lie algebra of upper triangular $n\times n$…

A finitely generated group G is termed parafree if it is residually nilpotent and it has the same isomorphism types of nilpotent quotients as some free group. The two main results of this MSc. Thesis characterise the parafreeness of two…

A palindrome is a word that reads the same left-to-right as right-to-left. We show that every simple group has a finite generating set $X$, such that every element of it can be written as a palindrome in the letters of $X$. Moreover, every…

We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…

Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of…

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

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

A regular left-order on finitely generated group $G$ is a total, left-multiplication invariant order on $G$ whose corresponding positive cone is the image of a regular language over the generating set of the group under the evaluation map.…

We show that the set $SA(G)$ of equivalence classes of synchronously automatic structures on a geometrically finite hyperbolic group $G$ is dense in the product of the sets $SA(P)$ over all maximal parabolic subgroups $P$. The set $BSA(G)$…

We give a geometric proof of a well known theorem that describes splittings of a free group as an amalgamated product or HNN extension over the integers. The argument generalizes to give a similar description of splittings of a virtually…

We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann.…