Related papers: Random groups are not n-cubulated

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if…

We record a folklore theorem that says a partial group embeds in a group if and only if each word has at most one possible multiplication, regardless of choice of parenthesization. We further investigate the partial groups which are…

We determine the class group of those generalized cluster algebras that are Krull domains. In particular, this provides a criterion for determining whether or not a generalized cluster algebra is a UFD. In fact, any finitely generated…

The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a…

We construct words with small image in a given finite alternating or unimodular group. This shows that word width in these groups is unbounded in general.

Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

Consider a group word w in n letters. For a compact group G, w induces a map G^n \rightarrow G$ and thus a pushforward measure {\mu}_w on G from the Haar measure on G^n. We associate to each word w a 2-dimensional cell complex X(w) and…

Any virtually free group $H$ containing no non-trivial finite normal subgroup (e.g., the infinite dihedral group) is a retract of any finitely generated group containing $H$ as a verbally closed subgroup.

Let G be a finite group. It has recently been proved that every nontrivial element of G is contained in a generating set of minimal size if and only if all proper quotients of G require fewer generators than G. It is natural to ask which…

If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…

For any finitely generated, non-elementary, torsion-free group $G$ that is hyperbolic relative to $\mathbb P$, we show that there exists a group $G^*$ containing $G$ such that $G^*$ is hyperbolic relative to $\mathbb P$ and $G$ is not…

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…

The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…

Let X be a proper CAT(0) cube complex admitting a proper cocompact action by a group G. We give three conditions on the action, any one of which ensures that X has a factor system in the sense of [BHS14]. We also prove that one of these…

We introduce a model for random groups in varieties of $n$-periodic groups as $n$-periodic quotients of triangular random groups. We show that for an explicit $d_{\mathrm{crit}}\in(1/3,1/2)$, for densities $d\in(1/3,d_{\mathrm{crit}})$ and…

It is a theorem of Artin, Tits et al. that a finite simple group is determined by its order, with the exception of the groups (A_3(2), A_2(4)) and (B_n(q), C_n(q)) for n > 2, q odd. We investigate the situation for finite semisimple groups…

Given a group-word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. The word $w$ is concise if $w(G)$ is finite for all groups $G$ in which $G_w$ is finite.…

In the recent paper by A. A. Klyachko, V. Yu. Miroshnichenko, and A. Yu. Olshanskii, it is proven that the center of any finite strongly verbally closed group is its direct factor. One of the results of the current paper is the…

We construct the first example of a finitely generated group which has Serre's property (FA) (i.e., whenever it acts on a simplicial tree it fixes a vertex), but admits a fixed point-free action on an $\mathbb{R}$-tree with finite arc…