Related papers: Probabilistic Burnside groups

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…

We will give an example of a branch group $G$ that has exponential growth but does not contain any non-abelian free subgroups. This answers question 16 from \cite{Bartholdi} positively. The proof demonstrates how to construct a non-trivial…

In this paper, we assume that $G$ is a finitely generated torsion free non-elementary Kleinian group with $\Omega(G)$ nonempty. We show that the maximal number of elements of $G$ that can be pinched is precisely the maximal number of rank 1…

We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph…

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…

We construct a finitely generated group $G$ without the Liouville property such that the return probability of a random walk satisfies $p_{2n}(e,e) \gtrsim e^{-n^{1/2 + o(1)}}$. Recent results suggest that $1/2$ is indeed the smallest…

We construct finitely generated groups of small period growth, i.e. groups where the maximum order of an element of word length $n$ grows very slowly in $n$. This answers a question of Bradford related to the lawlessness growth of groups…

The existence of $1$-factorizations of an infinite complete equipartite graph $K_m[n]$ (with $m$ parts of size $n$) admitting a vertex-regular automorphism group $G$ is known only when $n=1$ and $m$ is countable (that is, for countable…

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{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…

If $G$ is a finitely generated group and $X$ is a Cayley graph of $G$, denote by $\mathcal{C}_1^X(G)$ the subgroup of all automorphisms of $X$ commensurating $G$ and fixing the vertex corresponding to the identity. Building on the work of…

Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality…

We present a solution to the Burnside Problem for 2 generator groups of prime-power exponent that does not rely on induced maps as in [2]. As before, we construct a surjective map of a rank 2 free group to a solvable group G and finish by…

A finite group $G$ is called $C$-quasirandom (by Gowers) if all non-trivial irreducible complex representations of $G$ have dimension at least $C$. For any unit $\ell^{2}$ function on a finite group we associate the quantum probability…

In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled by elements which generate a group G. Two are drawn at random…

We carry out a study of groups $G$ in which the index of any infinite subgroup is finite. We call them restricted-finite groups and characterize finitely generated not torsion restricted-finite groups. We show that every infinite…

We investigate some properties of the $p$-elements of a profinite group $G$. We prove that if $p$ is odd and the probability that a randomly chosen element of $G$ is a $p$-element is positive, then $G$ contains an open prosolvable subgroup.…

We show that, for a finitely generated residually finite group $\Gamma$, the word $[x_1, \ldots, x_k]$ is a probabilistic identity of $\Gamma$ if and only if $\Gamma$ is virtually nilpotent of class less than $k$. Related results,…

We show that Cayley graphs of finitely generated Abelian groups are rather rigid. As a consequence we obtain that two finitely generated Abelian groups admit isomorphic Cayley graphs if and only if they have the same rank and their torsion…

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…