Related papers: Probabilistic Burnside groups

We consider the group $\mathfrak{X}(G)$ obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. Deceptively complicated finitely presented groups arise from…

We construct finitely generated groups with strong fixed point properties. Let $\mathcal{X}_{ac}$ be the class of Hausdorff spaces of finite covering dimension which are mod-$p$ acyclic for at least one prime $p$. We produce the first…

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

We show that free Burnside groups of sufficiently large odd exponent are non--amenable in a certain strong sense, more precisely, their left regular representations are isolated from the trivial representation uniformly on finite generating…

We give an example of a finitely presented simple group containing a finitely generated subgroup which is not finitely presented.

We prove that every finitely generated soluble group which is not virtually abelian has a subgroup of one of a small number of types.

One way of picking a "generic" element of a finitely generated group is to pick a random element with uniform probability in a large ball centered on $1$ in the Cayley graph. If the group acts on a $\delta$-hyperbolic space, with at least…

We show that, if $H$ is a random subgroup of a finitely generated free group $F_k$, only inner automorphisms of $F_k$ may leave $H$ invariant. A similar result holds for random subgroups of toral relatively hyperbolic groups, more generally…

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ invariably generates $G$ if $\{g_1^{x_1}, \ldots , g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected value of the random…

We give an easily checkable algebraic condition which implies that two elements of a finitely generated free group are members of distinct doubly-twisted conjugacy classes with respect to a pair of homomorphisms. We further show that this…

This paper is on the inverse parameterized differential Galois problem. We show that surprisingly many groups do not occur as parameterized differential Galois groups over K(x) even when K is algebraically closed. We then combine the method…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ invariably generates $G$ if $\{g_1^{x_1}, \ldots , g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected value of the random…

We construct an embedding of a free Burnside group $B(m,n)$ of odd $n > 2^{48}$ and rank $m >1$ in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented…

We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.

We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…

Motivated by expansion in Cayley graphs, we show that there exist infinitely many groups $G$ with a nontrivial irreducible unitary representation whose average over every set of $o(\log\log|G|)$ elements of $G$ has operator norm $1 - o(1)$.…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

We characterize the finitely generated groups that admit a Cayley graph whose only automorphisms are the translations, confirming a conjecture by Watkins from 1976. The proof relies on random walk techniques. As a consequence, every…