Related papers: HNN extensions and stackable groups

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…

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…

Let $G$ be a group and $H\leqslant G$ a subgroup. The free extension of an $H$-subshift $X$ to $G$ is the $G$-subshift $\widetilde{X}$ whose configurations are those for which the restriction to every coset of $H$ is a configuration from…

Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…

We deal with first-order definability in the substructure ordering $(\mathcal{D}; \sqsubseteq)$ of finite directed graphs. In two papers, the author has already investigated the first-order language of the embeddability ordering $(…

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…

Semigroup actions and their invertible extensions are discussed. First, we develop a theory of natural extensions for continuous actions of countable, embeddable semigroups. Second, we demonstrate that not every surjective such action of a…

A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific…

It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form…

This note shows there are infinitely many finite groups G, such that every connected Cayley graph on G has a hamiltonian cycle, and G is not solvable. Specifically, for every prime p that is congruent to 1, modulo 30, we show there is a…

We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.

A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed…

We characterize charmenability among arithmetic groups and deduce dichotomy statements pertaining normal subgroups, characters, dynamics, representations and associated operator algebras. We do this by studying the stationary dynamics on…

A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected…

We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…

Let $\mathbb{E}$ be the HNN-extension of a group $B$ with subgroups $H$ and $K$ associated according to an isomorphism $\varphi\colon H \to K$. Suppose that $H$ and $K$ are normal in $B$ and $(H \cap K)\varphi = H \cap K$. Under these…

In recent work, Stokes and Vermant considered graph-of-groups realisations of hypergraphs as a new description of rigidity-theoretic problems. In this paper, we show that the infinitesimal aspects of graph-of-groups realisations can be…

We prove groups acting cocompactly on locally finite trees with hyperbolic vertex stabilisers are asynchronously automatic. Combining this with previous work of the authors, we obtain an example of a group satisfying several non-positive…

We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…

A group presentation is said to have rational growth if the generating series associated to its growth function represents a rational function. A long-standing open question asks whether the Heisenberg group has rational growth for all…