Related papers: A probabilistic Tits alternative and probabilistic…

We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…

We show that for any finitely generated group of matrices that is not virtually solvable, there is an integer m such that, given an arbitrary finite generating set for the group, one may find two elements a and b that are both products of…

Let k be a local field, and G a linear group over k. We prove that either G contains a relatively open solvable subgroup, or it contains a relatively dense free subgroup. This result has applications in dynamics, Riemannian foliations and…

Let $G=G_1\ast\dots\ast G_k\ast F$ be a countable group which splits as a free product, where all groups $G_i$ are freely indecomposable and not isomorphic to $\mathbb{Z}$, and $F$ is a finitely generated free group. If for all…

The Tits alternative states that a finitely generated matrix group either contains a nonabelian free subgroup $F_2$, or it is virtually solvable. This paper considers two decision problems in virtually solvable matrix groups: the Identity…

We prove a Tits alternative for topological full groups of minimal actions of finitely generated groups. On the one hand, we show that topological full groups of minimal actions of virtually cyclic groups are amenable. By doing so, we…

We prove a Tits alternative theorem for groups acting on CAT(0) cubical complexes. Namely, suppose that $G$ is a group for which there is a bound on the orders of its finite subgroups. We prove that if $G$ acts properly on a…

The famous Tits' alternative states that a linear group either contains a nonabelian free group or is soluble-by-(locally finite). We study in this paper similar alternatives in pseudofinite groups. We show for instance that an…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

A companion result of the the Tits alternative for $Out(F_n)$ is proved: Every solvable subgroup of $Out(F_n)$ is finitely generated and virtually abelian.

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.

We prove an analog of the Tits alternative for rational functions. In particular, we show that if $S$ is a finitely generated semigroup of rational functions over the complex numbers, then either $S$ has polynomially bounded growth or $S$…

We prove a dynamical variant of the Tits alternative for the group of almost automorphisms of a locally finite tree $\mathcal{T}$: a group of almost automorphisms of $\mathcal{T}$ either contains a nonabelian free group playing ping-pong on…

We prove the Tits alternative for an almost coherent $PD(3)$ group which is not virtually properly locally cyclic. In particular, we show that an almost coherent $PD(3)$ group which cannot be generated by fewer than four elements always…

Let $\Gamma$ be a finitely generated group acting properly discontinuously by isometries on a visibility CAT(0) space $X$ that satisfies the bounded packing property. We prove that $\Gamma$ satisfies the Tits alternative: it is either…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

We give a characterization of toral relatively hyperbolic virtually special groups in terms of the profinite completion. We also prove a Tits alternative for subgroups of the profinite completion $\hat G$ of a relatively hyperbolic…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

In this paper we present a new identity and some of its variants which can be used for finding solutions while solving fractional infinite and finite series. We introduce another simple identity which is capable of generating solutions for…

We discuss whether finiteness properties of a profinite group $G$ can be deduced from the probabilistic zeta function $P_G(s)$. In particular we prove that if $P_G(s)$ is rational and all but finitely many nonabelian composition factors of…