Related papers: Involution factorizations of Ewens random permutat…
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…
In the first part of the paper, we study the inversion statistic of random permutations under the family $(\mathbb{P}_\theta^{(n)})_{\theta \ge 0}$ of Ewens sampling distributions on $S_n$. We obtain a rather simple exact formula for the…
The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…
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,…
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…
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…
In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…
In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…
Ewens sampling formula (ESF) is a one-parameter family of probability distributions with a number of intriguing combinatorial connections. This elegant closed-form formula first arose in biology as the stationary probability distribution of…
We explore the asymptotic distributions of sequences of integer-valued additive functions defined on the symmetric group endowed with the Ewens probability measure as the order of the group increases. Applying the method of factorial…
Smooth linear statistics of random permutation matrices, sampled under a general Ewens distribution, exhibit an interesting non-universality phenomenon. Though they have bounded variance, their fluctuations are asymptotically non-Gaussian…
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 compute the limiting distributions of the lengths of the longest monotone subsequences of random (signed) involutions with or without conditions on the number of fixed points (and negated points) as the sizes of the involutions tend to…
We study the limiting behavior of smooth linear statistics of the spectrum of random permutation matrices in the mesoscopic regime, when the permutation follows one of the Ewens measures on the symmetric group. If we apply a smooth enough…
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…
Let $\Gamma_{g}$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We develop a new method for integrating over the representation space $\mathbb{X}_{g,n}=\mathrm{Hom}(\Gamma_{g},S_{n})$ where $S_{n}$ is…
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…
The Ewens sampling formula with parameter $\alpha$ is the distribution on $S_n$ which gives each $\pi\in S_n$ weight proportional to $\alpha^{C(\pi)}$, where $C(\pi)$ is the number of cycles of $\pi$. We show that, for any fixed $\alpha$,…
We prove that permutations with few inversions exhibit a local-global dichotomy in the following sense. Suppose ${\boldsymbol\sigma}$ is a permutation chosen uniformly at random from the set of all permutations of $[n]$ with exactly…
We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…