Related papers: On isomorphisms to a free group and beyond
This thesis studies the graph alignment problem, the noisy version of the graph isomorphism problem, which aims to find a matching between the nodes of two graphs which preserves most of the edges. Focusing on the planted version where the…
In this article we study domino snake problems on finitely generated groups. We provide general properties of these problems and introduce new tools for their study. The first is the use of symbolic dynamics to understand the set of all…
This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…
We consider the isomorphism problem for hypergraphs taking as input two hypergraphs over the same set of vertices $V$ and a permutation group $\Gamma$ over domain $V$, and asking whether there is a permutation $\gamma \in \Gamma$ that…
We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invariance of hyperfiniteness of graphings under local isomorphism…
We study equalizers and fixed points of monomorphisms of free groups at infinity. We show that the action of the equalizer of two monomorphisms on the regular points of the equalizer at infinity has finitely many orbits, showing that the…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…
This paper is a follow-up to our joint paper with I. Agol, P. Storm and K. Whyte "Finiteness of arithmetic hyperbolic reflection groups". The main purpose is to investigate the effective side of the method developed there and its possible…
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…
We give a topological framework for the study of Sela's limit groups: limit groups are limits of free groups in a compact space of marked groups. Many results get a natural interpretation in this setting. The class of limit groups is known…
We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…
A group is SimpHAtic if it acts geometrically on a simply connected simplicially hereditarily aspherical (SimpHAtic) complex. We show that finitely presented normal subgroups of the SimpHAtic groups are either: finite, or of finite index,…
Firstly, we give a partial solution to the isomorphism problem for uniserial modules of finite length with the help of the morphisms between these modules over an arbitrary ring. Later, under suitable assumptions on the lattice of the…
In this survey, we describe recent progress on asymptotic properties of various automorphic orbits in free groups. In particular, we address the problem of counting potentially positive elements of a given length. We also discuss complexity…
The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…
We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are…
We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…
For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…
We describe an algorithm which determines whether or not a group which is hyperbolic relative to abelian groups admits a nontrivial splitting over a finite group.