3 problems

Let $G$ be a finitely generated group that is not virtually nilpotent, and let its growth function count the elements representable by words of length at most $n$. Subexponential g…

A cellular automata group is a group of reversible cellular automata, and an f.g.-universal group is a finitely generated group that contains every finitely generated group as a su…

Let $\mathcal{G}_n$ be the space of marked $n$-generated groups, and let $S_n\subseteq\mathcal{G}_n$ be the set of simple groups, meaning groups in which the normal closure of ever…