Related papers: Word Measures On Wreath Products I

Every word in a free group $F$ induces a probability measure on every finite group in a natural manner. It is an open problem whether two words that induce the same measure on every finite group, necessarily belong to the same orbit of…

In this paper we compute powers in the wreath product $G\wr S_n$, for any finite group $G$. For $r\geq 2$, a prime, consider $\omega_r: G\wr S_n\to G\wr S_n$ defined by $g \mapsto g^r$. Let $P_{r}(G\wr S_n)=\frac{|\omega_r(G\wr S_n)|}{|G|^n…

On unitary compact groups the decomposition of a generic element into product of reflections induces a decomposition of the characteristic polynomial into a product of factors. When the group is equipped with the Haar probability measure,…

Associated to a finite graph $X$ is its quantum automorphism group $G(X)$. We prove a formula of type $G(X*Y)=G(X)*_wG(Y)$, where $*_w$ is a free wreath product. Then we discuss representation theory of free wreath products, with the…

The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…

For any infinite word $w$ on a finite alphabet $A$, the complexity function $p_w$ of $w$ is the sequence counting, for each non-negative $n$, the number $p_w(n)$ of words of length $n$ on the alphabet $A$ that are factors of the infinite…

The degree of commutativity of a finite group is the probability that two uniformly and randomly chosen elements commute. This notion extends naturally to finitely generated groups $G$: the degree of commutativity $\text{dc}_S(G)$, with…

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…

Let $G$ be a compact Lie group. Suppose $g_1, \dots, g_k$ are chosen independently from the Haar measure on $G$. Let $\mathcal{A} = \cup_{i \in [k]} \mathcal{A}_i$, where, $\mathcal{A}_i := \{g_i\} \cup \{g_i^{-1}\}$. Let…

Given the large class of groups already known to be sofic, there is seemingly a shortfall in results concerning their permanence properties. We address this problem for wreath products, and in particular investigate the behaviour of more…

We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let $w$ be a nontrivial word in $d$ distinct variables and let $G$ be a finite group for which the word map…

Let $F$ be a free group. We present for arbitrary $g\in\mathbb{N}$ a LogSpace (and thus polynomial time) algorithm that determines whether a given $w\in F$ is a product of at most $g$ commutators; and more generally an algorithm that…

In this paper, we study the fibers of "automorphic word maps", a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite…

Waring's classical problem deals with expressing every natural number as a sum of g(k) k-th powers. Recently there has been considerable interest in similar questions for nonabelian groups, and simple groups in particular. Here the k-th…

A word $w$ in a free group is {\em achiral} if for every group $G,$ $G_w=G_{w^{-1}},$ where $G_w$ is the image of the word map $w$ on $G.$ We will give few classes of examples of achiral words. Cocke and Ho asked whether Engel words are…

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…

Given a morphism $\varphi : G \to A \wr B$ from a finitely presented group $G$ to a wreath product $A \wr B$, we show that, if the image of $\varphi$ is a sufficiently large subgroup, then $\mathrm{ker}(\varphi)$ contains a non-abelian free…

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…

The density of a rational language can be understood as the frequency of some "pattern" in the shift space, for example a pattern like "words with an even number of a given letter." We study the density of group languages, i.e. rational…

We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide…