Related papers: Elementary subgroups of virtually free groups

In this note we give a new proof of the fact that an elementary subgroup (in the sense of first-order theory) of a non abelian free group $\mathbb{F}$ must be a free factor. The proof is based on definability of orbits of elements of under…

We give a complete classification of finitely generated virtually free groups up to $\forall\exists$-elementary equivalence. As a corollary, we give an algorithm that takes as input two finite presentations of virtually free groups, and…

Elementarily free groups are the finitely generated groups with the same elementary theory as free groups. We prove that elementarily free groups are subgroup separable, answering a question of Zlil Sela.

We describe groups elementarily equivalent to a free metabelian group with n generators. We also explore an exponentiation that naturally occurs in metabelian groups.

We consider embeddings in a torsion-free hyperbolic group which are elementary in the sense of first-order logic. We give a description of these embeddings in terms of Sela's hyperbolic towers. We deduce as a corollary that subgroups…

We prove that two co-Hopfian finitely generated virtually free groups are elementarily equivalent if and only if they are isomorphic. We also prove that co-Hopfian finitely generated virtually free groups are homogeneous in the sense of…

We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…

We provide an elementary proof that subgroups of free groups are free via group actions.

We consider the subgroup of points of finite orbit through the action of an endomorphism of a virtually free group, with particular emphasis on the subgroup of eventually fixed points, EvFix($\varphi$): points whose orbit contains a fixed…

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of…

We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite…

We study finite subgroups of outer automorphisms of free products. We give upper bounds for the orders of these finite subgroups as well as bounds for the orders of individual torsion outer automorphisms under some (necessary) conditions…

In this paper we give a complete algebraic description of groups elementarily equivalent to a given free nilpotent group of finite rank.

Free groups are known to be homogeneous, meaning that finite tuples of elements which satisfy the same first-order properties are in the same orbit under the action of the automorphism group. We show that virtually free groups have a…

We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.

We study endomorphisms of a free group of finite rank by means of their action on specific sets of elements. In particular, we prove that every endomorphism of the free group of rank 2 which preserves an automorphic orbit (i.e., acts ``like…

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 prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…

Any virtually free group $H$ containing no non-trivial finite normal subgroup (e.g., the infinite dihedral group) is a retract of any finitely generated group containing $H$ as a verbally closed subgroup.

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…