Related papers: Word Measures on Unitary Groups

We consider random walks on finitely or countably generated free semigroups, and identify their Poisson boundaries for classes of measures which fail to meet the classical entropy criteria. In particular, we introduce the notion of…

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…

Elements of the commutator subgroup of a free group can be presented as values of canonical forms, called Wicks forms. We show that, starting from sufficiently high genus g, there is a sequence of words w(g) which can be presented by f(g)…

Dependency trees have proven to be a very successful model to represent the syntactic structure of sentences of human languages. In these structures, vertices are words and edges connect syntactically-dependent words. The tendency of these…

We analyze properties of non-hermitian matrices of size M constructed as square submatrices of unitary (orthogonal) random matrices of size N>M, distributed according to the Haar measure. In this way we define ensembles of random matrices…

Let $W^{(n)}$ be the $n$-letter word obtained by repeating a fixed word $W$, and let $R_n$ be a random $n$-letter word over the same alphabet. We show several results about the length of the longest common subsequence (LCS) between…

This paper addresses the uniform random generation of words from a context-free language (over an alphabet of size $k$), while constraining every letter to a targeted frequency of occurrence. Our approach consists in a multidimensional…

We consider words $G_{i_1} \cdots G_{i_m}$ involving i.i.d. complex Ginibre matrices, and study tracial expressions of their eigenvalues and singular values. We show that the limit distribution of the squared singular values of every word…

WWe define the notion of a random metric space and prove that with probability one such a space is isometricto the Urysohn universal metric space. The main technique is the study of universal and random distance matrices; we relate the…

This paper is concerned with certain connections between the ensemble of n x n unitary matrices -- specifically the characteristic function of the random variable tr(U) -- and combinatorics -- specifically Ulam's problem concerning the…

We study random torsion-free nilpotent groups generated by a pair of random words of length $\ell$ in the standard generating set of $U_n(\mathbb{Z})$. Specifically, we give asymptotic results about the step properties of the group when the…

Let m, n be positive integers, v a multilinear commutator word and w = v^m. Denote by v(G) and w(G) the verbal subgroups of a group G corresponding to v and w, respectively. We prove that the class of all groups G in which the w-values are…

In the infinite regular tree $\mathbb{T}_{q+1}$ with $q \in \mathbb{Z}_{\ge 2}$, we consider families $\{\mu_u^n\}$, indexed by vertices $u$ and nonnegative integers ("discrete time steps") $n$, of probability measures such that $\mu_u^n(v)…

Let $G$ be a connected graph, and let $\lambda_1$ and $\rho$ denote the spectral radius of $G$ and the universal cover of $G$, respectively. In \cite{Fri03}, Friedman has shown that almost every $n$-lift of $G$ has all of its new…

We introduce the task of out-of-order membership to a formal language L, where the letters of a word w are revealed one by one in an adversarial order. The length |w| is known in advance, but the content of w is streamed as pairs (i, w[i]),…

Let $\mu$ be a Gaussian measure on some measurable space $\{W=\{w\},{\mathcal{B}}(W)\}$ and let $\nu$ be a measure on the same space which is absolutely continuous with respect to $\nu$. The paper surveys results on the problem of…

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…

Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…

If $w=u\alpha$ for $\alpha\in \Sigma=\{1,2\}$ and $u\in \Sigma^*$, then $w$ is said to be a \textit{simple right extension}of $u$ and denoted by $u\prec w$. Let $k$ be a positive integer and $P^k(\epsilon)$ denote the set of all…

The deviation of the observed frequency of a word $w$ from its expected frequency in a given sequence $x$ is used to determine whether or not the word is avoided. This concept is particularly useful in DNA linguistic analysis. The value of…