Related papers: On the isomorphism problem for cyclic JSJ decompos…
We give an example of two JSJ decompositions of a group that are not related by conjugation, conjugation of edge-inclusions, and slide moves. This answers the question of Rips and Sela stated in "Cyclic splittings of finitely presented…
We prove that an Artin group splits over infinite cyclic subgroups if and only if its defining graph has a separating vertex, and explicitly construct a JSJ decomposition over infinite cyclic subgroups for all Artin groups. We then use…
We demonstrate the quasi-isometry invariance of two important geometric structures for relatively hyperbolic groups: the coned space and the cusped space. As applications, we produce a JSJ-decomposition for relatively hyperbolic groups…
We prove that if two finite metacyclic groups have isomorphic rational group algebras, then they are isomorphic. This contributes to understand where is the line separating positive and negative solutions to the Isomorphism Problem for…
We show that all residually finite generalized Baumslag-Solitar groups of rank $n \geq 1$, defined on a finite and connected graph, are self-similar. Furthermore we prove that all residually finite fundamental groups of (finite, connected)…
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…
Building on work of Cai, F\"urer, and Immerman \cite{CFI92}, we show two hardness results for the Graph Isomorphism problem. First, we show that there are pairs of nonisomorphic $n$-vertex graphs $G$ and $H$ such that any sum-of-squares…
Two groups are virtually isomorphic if they can be obtained one from the other via a finite number of steps, where each step consists in taking a finite extension or a finite index subgroup (or viceversa). Virtually isomorphic groups are…
We study a notion of deformation for simplicial trees with group actions (G-trees). Here G is a fixed, arbitrary group. Two G-trees are related by a deformation if there is a finite sequence of collapse and expansion moves joining them. We…
This paper and its companion arXiv:0911.3173 have been replaced by arXiv:1602.05139. We define the compatibility JSJ tree of a group G over a class of subgroups. It exists whenever G is finitely presented and leads to a canonical tree (not…
In this paper, we study the behaviour of TF-isomorphisms, a natural generalisation of isomorphisms. TF-isomorphisms allow us to simplify the approach to seemingly unrelated problems. In particular, we mention the Neighbourhood…
We study the conjugacy problem in cyclic extensions of free groups. It is shown that the conjugacy problem is solvable in split extensions of finitely generated free groups by virtually inner automorphisms. An algorithm for construction of…
In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unambiguously display the order type of S. We introduce the concept of exit edges, which…
Let $G$ be a generalized Baumslag-Solitar group and $\mathcal{C}$ be a class of groups containing at least one non-unit group and closed under taking subgroups, extensions, and Cartesian products of the form $\prod_{y \in Y}X_{y}$, where…
We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…
The idea of "JSJ-decompositions" for 3-manifolds began with work of Waldhausen and was developed later through work of Jaco, Shalen and Johansen. It was shown that there is a finite collection of 2-sided, incompressible tori that separate a…
By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…
A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via…
In this paper we consider some results obtained for graphs using minimal vertex separators and generalized chordality and translate them to the context of Geometric Group Theory. Using these new tools, we are able to give two new…
This article proposes an effective criterion for lifting automorphisms along regular coverings of graphs, with the covering transformation group being any finite abelian group.