Related papers: An elementary proof that subgroups of free groups …
We give a simple proof of the finite presentation of Sela's limit groups by using free actions on $\bbR^n$-trees. We first prove that Sela's limit groups do have a free action on an $\bbR^n$-tree. We then prove that a finitely generated…
We prove that, except for a few explicit roots of unity, the quantum image of any Johnson subgroup of the mapping class group contains an explicit free non-abelian subgroup.
We study free and compact group actions on unital C*-algebras. In particular, we provide a complete classification theory of these actions for compact Abelian groups and explain its relation to the classical classification theory of…
We prove that for arbitrary two finitely generated subgroups A and B having infinite index in a free group F, there is a subgroup H of finite index in B such that the subgroup generated by A and H has infinite index in F. The main corollary…
We construct the free products of arbitrary digroups, and thus we solve an open problem of Zhuchok.
We give a method for constructing dense and free subgroups in real Lie groups. In particular we show that any dense subgroup of a connected semisimple real Lie group G contains a free group on two generators which is still dense in G, and…
In this paper we give a complete algebraic description of groups elementarily equivalent to a given free nilpotent group of finite rank.
For a group acting on a hyperbolic space, we set up an algorithm in the group algebra showing that ideals generated by few elements are free, where few is a function of the minimal displacement of the action, and derive algebraic,…
We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in…
We study inert and compressed subgroups of free groups and provide a generalization of echelon subgroups.
It is shown that a nontrivial normal subgroup $N$ of a group $G$ is a free factor of the $N$'s normal closure in the $G$'s free product with arbitrary nontrivial groups.
We exhibit free-by-cyclic groups containing non-free locally-free subgroups, including some word hyperbolic examples. We also show that these groups are not subgroup separable. We use Bestvina-Brady Morse theory in our arguments.
The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.
We prove that the amalgamated free product of two free groups of rank two over a common cyclic subgroup, admits an amenable, faithful, transitive action on an infinite countable set. We also show that any finite index subgroup admits such…
We present a new approach to the proof of ergodic theorems for actions of free groups based on geometric covering and asymptotic invariance arguments. Our approach can be viewed as a direct generalization of the classical geometric covering…
This paper is devoted to the proof of the property of order separability for free product of free groups with maximal cyclic amalgamated subgroups.
We show that a free action $G \curvearrowright X$ is almost finite if its restriction to some infinite normal subgroup of $G$ is almost finite. Consider the class of groups which contains all infinite groups of locally subexponential growth…
A conjecture of Dicks and the author on rank of the intersection of factor-free subgroups in free products of groups is proved for the case of left ordered groups.
We study minimality for continuous actions of abelian semigroups on compact Hausdorff spaces with a free interval. First, we give a necessary and sufficient condition for such a space to admit a minimal action of a given abelian semigroup.…
In this paper we present a new characterization of free group actions (in classical differential geometry), involving dynamical systems and representations of the corresponding transformation groups. In fact, given a dynamical system, we…