Related papers: Word Measures on Unitary Groups

We study upgraded free independence phenomena for unitary elements $u_1$, $u_2$, \dots representing the large-$n$ limit of Haar random unitaries, showing that free independence extends to several larger algebras containing $u_j$ in the…

We show how to enumerate words in $1^{m_1} \dots n^{m_n}$ that avoid the increasing consecutive pattern $12 \dots r$ for any $r \geq 2$. Our approach yields an $O(n^{s+1})$ algorithm to enumerate words in $1^s \dots n^s$, avoiding the…

A word on $q$ symbols is a sequence of letters from a fixed alphabet of size $q$. For an integer $k\ge 1$, we say that a word $w$ is $k$-universal if, given an arbitrary word of length $k$, one can obtain it by removing entries from $w$. It…

An arbitrary homomorphism between groups is nonincreasing for stable commutator length, and there are infinitely many (injective) homomorphisms between free groups which strictly decrease the stable commutator length of some elements.…

Construct recursively a long string of words w1. .. wn, such that at each step k, w k+1 is a new word with a fixed probability p $\in$ (0, 1), and repeats some preceding word with complementary probability 1 -- p. More precisely, given a…

We show that the monotonicity conjecture of Merriss and Watkins is true in average when taking the set of matrices of given non negative spectra as probability space with respect to the Haar measure of the unitarian group .

Let $G$ be a finitely generated group equipped with a symmetric generating $% k $-tuple $S$. Let $|\cdot|$ and $V$ be the associated word length and volume growth function. Let $\nu$ be a probability measure such that $% \nu(g)\simeq…

Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word $w$ as the minimal number of palindromes whose concatenation is equal to $w$. For an infinite word $u$ we study $PL_{u}$, that is, the function that assigns…

For a random sample of points in $\mathbb{R}$, we consider the number of pairs whose members are nearest neighbors (NN) to each other and the number of pairs sharing a common NN. The first type of pairs are called reflexive NNs whereas…

We study the computational complexity of the Word Problem (WP) in free solvable groups $S_{r,d}$, where $r \geq 2$ is the rank and $d \geq 2$ is the solvability class of the group. It is known that the Magnus embedding of $S_{r,d}$ into…

Generalizing a recent result of Mann, we show that there is an explicit function $f:\left(0,1\right]\rightarrow\left(0,1\right]$ such that for every reduced word $w$, say in $d$ variables, there is an explicit reduced word $v$ in at most…

A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…

Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…

Let w be a group-word. Suppose that the set of all w-values in a profinite group G is contained in a union of countably many cosets of subgroups. We are concerned with the question to what extent the structure of the verbal subgroup w(G)…

The problems that we consider in this paper are as follows. Let A and B be 2x2 matrices (over reals). Let w(A, B) be a word of length n. After evaluating w(A, B) as a product of matrices, we get a 2x2 matrix, call it W. What is the largest…

We address the question of the asymptotic description of random tensors that are local-unitary invariant, that is, invariant by conjugation by tensor products of independent unitary matrices. We consider both the mixed case of a tensor with…

We show that an element w of a free group F on n generators defines a surjective word map of PSL(2,C)^n onto PSL(2,C) unless w belongs to the second derived subgroup of F. We also describe certain words maps that are surjective on SL(2,C) x…

Let $m,n$ be positive integers and $w$ a multilinear commutator word. Assume that $G$ is a finite group having subgroups $G_1,\ldots,G_m$ whose union contains all $w$-values in $G$. Assume further that all elements of the subgroups…

For any positive integers m and n, the word map (x,y) -> x^m y^n is almost measure preserving on large finite simple groups G.

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…