Related papers: On a flow of operators associated to virtual permu…

In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at random according to the Ewens measure of parameter $\theta>0$) by replacing the entries equal to one by…

Analogously to the space of virtual permutations, we define projective limits of isometries: these sequences of unitary operators are natural in the sense that they minimize the rank norm between successive matrices of increasing sizes. The…

We study the number of random permutations needed to invariably generate the symmetric group, $S_n$, when the distribution of cycle counts has the strong $\alpha$-logarithmic property. The canonical example is the Ewens sampling formula,…

There is a natural map from a symmetric group $S_n$ to a smaller symmetric group $S_{n-1}$, we write a decomposition of a permutation into a product of disjoint cycles and remove the element $n$ from this expression. For this reason there…

This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected…

An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…

The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…

An involution is a permutation that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathbf{N}_{n}(\sigma)$ denote the number of ways to write $\sigma$ as a product of two involutions of $[n].$ If we endow the symmetric…

We characterize the asymptotic performance of a class of positive operator valued measurements (POVMs) where the only task is to make measurements on independent and identically distributed quantum states on finite-dimensional systems. The…

Let the term $k$-representation refer to the permutation representations of the symmetric group $\mathfrak{S}_n$ on $k$-tuples and $k$-subsets as well as the $S^{(n-k,1^k)}$ irreducible representation of $\mathfrak{S}_n$. Endow…

Let $S(\infty)$ denote the infinite symmetric group formed by the finitary permutations of the set of natural numbers; this is a countable group. We introduce its virtual group algebra, a completion of the conventional group algebra…

Fix a word $w$ in a free group $F$ on $r$ generators. A $w$-random permutation in the symmetric group $S_N$ is obtained by sampling $r$ independent uniformly random permutations $\sigma_{1},\ldots,\sigma_{r}\in S_{N}$ and evaluating…

The classical theorem of Birkhoff states that the $T^N f(x) = (1/N)\sum_{k=0}^{N-1} f(\sigma^k x)$ converges almost everywhere for $x\in X$ and $f\in L^{1}(X)$, where $\sigma$ is a measure preserving transformation of a probability measure…

Based on the relationship of symmetric operators with Hermitian symmetric spaces, we introduce the notion of \emph{Weyl curve} for a symmetric operator $T$, which is the geometric abstraction and generalization of the well-known Weyl…

Let S be the group of finite permutations of the naturals 1,2,... The subject of the paper is harmonic analysis for the Gelfand pair (G,K), where G stands for the product of two copies of S while K is the diagonal subgroup in G. The…

Equip the symmetric group $\mathfrak{S}_n$ with the Ewens distribution. We study the eigenvalue point process of the permutation representation of $\mathfrak{S}_n$ on $k$-tuples of distinct integers chosen from the set $\{1,2,...,n\}$.…

Let $\{T_{k}\}_{k=1}^{\infty}$ be a family of *--free identically distributed operators in a finite von Neumann algebra. In this work we prove a multiplicative version of the free central limit Theorem. More precisely, let…

This paper studies Markov chains on the symmetric group $S_n$ where the transition probabilities are given by the Ewens distribution with parameter $\theta>1$. The eigenvalues are identified to be proportional to the content polynomials of…

We consider Gibbs distributions on the set of permutations of $\mathbb Z^d$ associated to the Hamiltonian $H(\sigma):=\sum_{x} V(\sigma(x)-x)$, where $\sigma$ is a permutation and $V:\mathbb Z^d\to\mathbb R$ is a strictly convex potential.…

We continue the investigation of algorithmically random functions and closed sets, and in particular the connection with the notion of capacity. We study notions of random continuous functions given in terms of a family of computable…