Related papers: Surface Words are Determined by Word Measures on G…

Based on the notions of conciseness and semiconciseness, we show that these properties are not equivalent by proving that a word originally presented by Ol'shanskii is semiconcise but not concise. We further establish that every…

Surface groups are determined among limit groups by their profinite completions. As a corollary, the set of surface words in a free group is closed in the profinite topology.

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…

Every element $w$ in the commutator subgroup of the free group $\mathbb{F}_2$ of rank 2 determines a closed curve in the grid $\mathbb{Z} \times \mathbb{R} \cup \mathbb{R} \times \mathbb{Z} \subseteq \mathbb{R}^2$. The winding numbers of…

We prove a conjecture due to Baumgaertel and Lledo according to which for every compact group G one has Z(G)^ \cong C(G), where the `chain group' C(G) is the free abelian group (written multiplicatively) generated by the set G^ of…

We show that, if $w_1, \ldots , w_6$ are words which are not an identity of any (non-abelian) finite simple group, then $w_1(G)w_2(G) \cdots w_6(G) = G$ for all (non-abelian) finite simple groups $G$. In particular, for every word $w$,…

We consider non-elementary representations of two generator free groups in $PSL(2,\mathbb{C})$, not necessarily discrete or free, $G = < A, B >$. A word in $A$ and $B$, $W(A,B)$, is a palindrome if it reads the same forwards and backwards.…

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. In particular, Olshanskii gave an example of such…

If $K$ is a closed subgroup of a compact group $G$, the probability that randomly chosen pair of elements from $K$ and $G$ commute is denoted by $Pr(K,G)$. Say that a subgroup $K\leq G$ is $\epsilon$-central in $G$ if $Pr(\langle g…

Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…

Let $G$ be a locally compact group with the left Haar measure $m_{G}$. A probability measure ${\mu}$ on $G$ is said to be strictly aperiodic if the support of ${\mu}$ is not contained in a proper closed left coset of $G$. In this paper, we…

A group $G$ has $FW_n$ if every action on a $n$-dimensional $\mathrm{CAT}(0)$ cube complex has a global fixed point. This provides a natural stratification between Serre's $FA$ and Kazhdan's $(T)$. For every $n$, we show that random groups…

In this article, we show the surjectivity of word maps w from SU(2)* SU(2) to SU(2) induced by several families of words in the free group of rank 2. Also, we prove the surjectivity of certain word maps on SL(2,C).

A monoid is called special if it admits a presentation in which all defining relations are of the form $w = 1$. Every group is special, but not every monoid is special. In this article, we describe the language-theoretic properties of the…

For a group G and a positive integer n write B_n(G) = {x \in G : |x^G | \le n}. If s is a positive integer and w is a group word, say that G satisfies the (n,s)-covering condition with respect to the word w if there exists a subset S of G…

Let $G$ be a hyperbolic group that splits as a graph of free groups with cyclic edge groups. We prove that, unless $G$ is isomorphic to a free product of free and surface groups, every finite abelian group $M$ appears as a direct summand in…

Let $P(G)$ denotes the set of sizes of fibers of non-trivial commutators of the commutator word map. Here, we prove that $|P(G)|=1$, for any finite group $G$ of nilpotency class $3$ with exactlly two conjugacy class sizes. We also show that…

We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo sampling. The algorithm samples from a stretched Boltzmann…

Let $w$ be a word in $k$ variables. For a finite nilpotent group $G$, a conjecture of Amit states that $N_w(1) \ge |G|^{k-1}$, where $N_w(1)$ is the number of $k$-tuples $(g_1,...,g_k)\in G^{(k)}$ such that $w(g_1,...,g_k)=1$. Currently,…

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…