相关论文: On a flow of operators associated to virtual permu…

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

We extend the notions of finite free convolution and finite free cumulants to the setting of formal power series by introducing their natural analogues, namely $t$-deformed convolution and $t$-deformed cumulants. In this framework, we…

In this article we introduced algebraic sieves, i.e. selection procedures on a given finite set to extract a particular subset. Such procedures are performed by finite groups acting on the set. They are called sieves because there are…

We introduce invariants, called shifting numbers, that measure the asymptotic amount by which an autoequivalence of a triangulated category translates inside the category. The invariants are analogous to Poincare translation numbers that…

Quantum ergodicity asserts that almost all infinite sequences of eigenstates of a quantized ergodic system are equidistributed in the phase space. On the other hand, there are might exist exceptional sequences which converge to different…

Let $\alpha$ and $\beta$ be uniformly random permutations of orders $2$ and $3$, respectively, in $S_{N}$, and consider, say, the permutation $\alpha\beta\alpha\beta^{-1}$. How many fixed points does this random permutation have on average?…

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

Let $S_n$ be the symmetric group of all permutations of $\{1, \cdots, n\}$ with two generators: the transposition switching $1$ with $2$ and the cyclic permutation sending $k$ to $k+1$ for $1\leq k\leq n-1$ and $n$ to $1$ (denoted by…

Spin foams arose as the covariant (path integral) formulation of quantum gravity depicting transition amplitudes between different quantum geometry states. As such, they provide a scheme to study the no boundary proposal, specifically the…

An extension of the Lorentz group to include generators $\Gamma^\mu$ carrying a space-time index is demonstrated to explicitly construct the Minkowski metric within the internal group space as a consequence of the non-vanishing commutation…

The goal of this paper is to analyse the asymptotic behavior of the cycle process and the total number of cycles of weighted and generalized weighted random permutations which are relevant models in physics and which extend the Ewens…

We develop a quenched thermodynamic formalism for open random dynamical systems generated by finitely branched, piecewise-monotone mappings of the interval. The openness refers to the presence of holes in the interval, which terminate…

In this paper, we review the representation theory of the infinite symmetric group, and we extend the works of Kerov and Vershik by proving that the irreducible characters of the infinite symmetric group always satisfy a central limit…

For $\alpha\geq 1$, let $g:\mathbb N\to\mathbb R_+$ be given by $g(0)=0$, $g(1)=1$, $g(k)=(k/k-1)^\alpha$, $k\geq 2$. Consider the symmetric nearest neighbour zero range process on the discrete torus $\mathbb T_L$ in which a particle jumps…

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…

We introduce and study a 2-parameter family of unitarily invariant probability measures on the space of infinite Hermitian matrices. We show that the decomposition of a measure from this family on ergodic components is described by a…

We prove a conjecture dating back to a 1978 paper of D.R.\ Musser~\cite{musserirred}, namely that four random permutations in the symmetric group $\mathcal{S}_n$ generate a transitive subgroup with probability $p_n > \epsilon$ for some…

We develop a synthesis of Turing's paradigm of computation and von Neumann's quantum logic to serve as a model for quantum computation with recursion, such that potentially non-terminating computation can take place, as in a quantum Turing…

Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation,…

We generalize Lyapunov's convexity theorem for classical (scalar-valued) measures to quantum (operator-valued) measures. In particular, we show that the range of a nonatomic quantum probability measure is a weak*-closed convex set of…