Related papers: On Tarski's problem for virtually free groups

We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

It is proved that all finitely generated subgroups of generalized free product of two groups are finitely separable provided that free factors have this property and amalgamated subgroups are normal in corresponding factors and satisfy the…

We prove that the free product of two finitely presented locally tame groups is locally tame and describe many examples of tame subgroups of finitely presented groups. We also include some open problems related to tame subgroups.

In this paper we describe finitely generated groups $H$ universally equivalent (with constants from $G$ in the language) to a given torsion-free relatively hyperbolic group $G$ with free abelian parabolics. It turns out that, as in the free…

An account of two fundamental facts concerning finitely generated linear groups: Malcev's theorem on residual finiteness, and Selberg's lemma on virtual torsion-freeness.

We investigate the problem of elementary equivalence of the free group factors, that is, do all free group factors $L(\mathbb{F}_n)$ share a common first-order theory? We establish a trichotomy of possibilities for their common first-order…

We show that finitely generated mapping tori of free groups have a canonical collection of maximal sub-mapping tori of finitely generated free groups with respect to which they are relatively hyperbolic and locally relatively quasi-convex.…

The Profinite Isomorphism Problem for a class of groups \mathcal{C} asks for an algorithm that decides for any two groups in \mathcal{C} whether they have isomorphic profinite completions. We present the positive solution to this problem…

We provide a new condition for an absolutely almost simple algebraic group to have good reduction with respect to a discrete valuation of the base field which is formulated in terms of the existence of maximal tori with special properties.…

The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…

An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite,…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

We prove that finitely generated virtually free groups are stable in permutations. As an application, we show that almost-periodic almost-automorphisms of labelled graphs are close to periodic automorphisms.

For any finite group Q not of prime power order, we construct a group G that is virtually of type F, contains infinitely many conjugacy classes of subgroups isomorphic to Q, and contains only finitely many conjugacy classes of other finite…

Suppose a group $G$ is quasi-isometric to a free product of a finite set $S$ of finitely generated abelian groups; let $S'$ denote the set of ranks of the free abelian parts of the groups in $S$. Then $G$ is commensurable with the free…

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…

A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…

It is shown that there is $N$ such that there is no algorithm to decide for identities in at most $N$ variables validity in the class of finite modular lattices. This is based on Slobodskoi's result that the Restricted Word Problem is…