Related papers: Words, Hausdorff dimension and randomly free group…
In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…
Let $G$ be a finitely generated pro-$p$ group, equipped with the $p$-power series. The associated metric and Hausdorff dimension function give rise to the Hausdorff spectrum, which consists of the Hausdorff dimensions of closed subgroups of…
If $\G$ is a finitely generated group with generators $\{g_1,...,g_j\}$ then an infinite order element $f \in \G$ is a {\em distortion element} of $\G$ provided $\displaystyle{\liminf_{n \to \infty} |f^n|/n = 0,}$ where $|f^n|$ is the word…
The free product of an arbitrary pair of finite hyperfinite von Neumann algebras is examined, and the result is determined to be the direct sum of a finite dimensional algebra and an interpolated free group factor $L(\freeF_r)$. The finite…
We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…
We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…
Let $w=w(x_1,\ldots,x_r)$ be a lower central word or a derived word. We show that the word $w(u_1,\ldots,u_r)$ is concise whenever $u_1,\ldots,u_r$ are non-commutator words in disjoint sets of variables, thus proving a generalized version…
L\'evai and Pyber proposed the following as a conjecture: Let $G$ be a profinite group such that the set of solutions of the equation $x^n=1$ has positive Haar measure. Then $G$ has an open subgroup $H$ and an element $t$ such that all…
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.…
A group word $w$ is said to be strongly concise in a class $\mathscr C$ of profinite groups if, for any group $G$ in $\mathscr C$, either $w$ takes at least continuum values in $G$ or the verbal subgroup $w(G)$ is finite. It is conjectured…
In this note we prove that if $G$ is a finitely generated profinite group then the verbal subgroup $G^{q}$ is open. Equivalently in a $d$-generator finite group every product of $q$th powers is a product of $f(d,q)$ $q$th powers.
This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…
We deal with the following conjecture. If w is a group word and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w…
In this paper we show that there exists an uncountable family of finitely generated simple groups with the same positive theory as any non-abelian free group. In particular, these simple groups have infinite $w$-verbal width for all…
In this work we introduce a new succinct variant of the word problem in a finitely generated group $G$, which we call the power word problem: the input word may contain powers $p^x$, where $p$ is a finite word over generators of $G$ and $x$…
Given a self-similar set $\Lambda$ that is the attractor of an iterated function system (IFS) $\{f_1,\dots,f_N\}$, consider the following method for constructing a random subset of $\Lambda$: Let $\mathbf{p}=(p_1,\dots,p_N)$ be a…
The $k$-gonal models of random groups are defined as the quotients of free groups on $n$ generators by cyclically reduced words of length $k$. As $k$ tends to infinity, this model approaches the Gromov density model. In this paper we show…
We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…
Let $w\in\mathbf F_k$ be a non-trivial word and denote by $w(G)\subseteq G$ the image of the associated word map $w\colon G^k\to G$. Let $G$ be one of the finite groups ${\rm S}_n,{\rm GL}_n(q),{\rm Sp}_{2m}(q),{\rm GO}_{2m}^\pm(q),{\rm…
A conjecture of Rosenberger says that a group of the form $\langle x,y|x^p=y^q=W(x,y)^r=1\rangle$ (with $r>1$) is either virtually solvable or contains a non-abelian free subgroup. This note is an account of an attack on the conjecture in…