Related papers: On Tarski's problem for virtually free groups
We prove that all definable pre-orders are atomic, in a finitely generated free algebra of a discriminator variety of finite similarity type which is generated by its finite members.
We show that if a group is not virtually cyclic and is hyperbolic relative to a family of proper subgroups, then it has a hyperbolically embedded subgroup which contains a finitely generated non-abelian free group as a finite index…
We obtain a homological characterisation of virtually free-by-cyclic groups among groups that are hyperbolic and virtually compact special. As a consequence, we show that many groups known to be coherent actually possess the stronger…
This arXived paper has two independant parts, that are improved and corrected versions of different parts of a single paper once named "On equations in relatively hyperbolic groups". The first part is entitled "Existential questions in…
We show that every finitely generated residually finite torsion group $G$ embeds in a finitely generated torsion group $\Gamma$ that is residually finite simple. In particular we show the existence of finitely generated infinite torsion…
We prove that, for a finitely generated group hyperbolic relative to virtually abelian subgroups, the generalised word problem for a parabolic subgroup is the language of a real-time Turing machine. Then, for a hyperbolic group, we show…
Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…
The main result of this article is a refinement of the well-known subgroup separability results of Hall and Scott for free and surface groups. We show that for any finitely generated subgroup, there is a finite dimensional representation of…
We prove that the stable image of an endomorphism of a virtually free group is computable. For an endomorphism $\varphi$, an element $x\in G$ and a subset $K\subseteq G$, we say that the relative $\varphi$-order of $g$ in $K$,…
Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.
In this paper we consider the problem of classification of the nilpotent class 2 finitely generated torsion free groups up to the geometric equivalence. By a very easy technique it is proved that this problem is equivalent to the problem of…
We prove that every virtually free group $G$ has property (LR) of Long and Reid: each finitely generated subgroup of $G$ is a retract of a finite index subgroup. The main ingredient in the proof is a new embedding result stating that every…
In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
We show that given a finitely generated LERF group $G$ with positive rank gradient, and finitely generated subgroups $A,B \leq G$ of infinite index, one can find a finite index subgroup $B_0$ of $B$ such that $[G : \langle A \cup B_0…
The word problem of a finitely generated group is the formal language of words over the generators which are equal to the identity in the group. If this language happens to be context-free, then the group is called context-free. Finitely…
In this note, we investigate how different fundamental groups of presentations of a fixed algebra $A$ can be. For finitely many finitely presented groups $G_i$, we construct an algebra $A$ such that all $G_i$ appear as fundamental groups of…