Related papers: Large Deviations for Permutations Avoiding Monoton…

The existence of large \nu_\mu-\nu_\tau mixing suggests the likelihood of large smuon-stau mixing in supersymmetric models, leading to \mu and \tau number violation. In addition to interesting signatures in slepton and neutralino production…

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…

Consider the random matrix $\Sigma = D^{1/2} X \widetilde D^{1/2}$ where $D$ and $\widetilde D$ are deterministic Hermitian nonnegative matrices with respective dimensions $N \times N$ and $n \times n$, and where $X$ is a random matrix with…

We consider matrices formed by a random $N\times N$ matrix drawn from the Gaussian Orthogonal Ensemble (or Gaussian Unitary Ensemble) plus a rank-one perturbation of strength $\theta$, and focus on the largest eigenvalue, $x$, and the…

We study two one-parameter families of point processes connected to random matrices: the Sine_beta and Sch_tau processes. The first one is the bulk point process limit for the Gaussian beta-ensemble. For beta=1, 2 and 4 it gives the limit…

In the big data era, the need to reevaluate traditional statistical methods is paramount due to the challenges posed by vast datasets. While larger samples theoretically enhance accuracy and hypothesis testing power without increasing false…

We study statistical properties of the random variables $X_{\sigma}(\pi)$, the number of occurrences of the pattern $\sigma$ in the permutation $\pi$. We present two contrasting approaches to this problem: traditional probability theory and…

We study the asymptotic behavior of the appropriately scaled and possibly perturbed spectral measure $\mu$ of large random real symmetric matrices with heavy tailed entries. Specifically, consider the N by N symmetric matrix $Y_N^\sigma$…

Let $A=(a_{ij})$ be an $n$-by-$n$ matrix. For any real number $\mu$, we define the polynomial $$P_\mu(A)=\sum_{\sigma\in S_n} a_{1\sigma(1)}\cdots a_{n\sigma(n)}\,\mu^{\ell(\sigma)}\; ,$$ as the $\mu$-permanent of $A$, where $\ell(\sigma)$…

We establish a large-deviations principle for the largest eigenvalue of a generalized sample covariance matrix, meaning a matrix proportional to $Z^T \Gamma Z$, where $Z$ has i.i.d. real or complex entries and $\Gamma$ is not necessarily…

The generalized $\mu$-$\tau$ interchange symmetry in the leptonic mixing matrix $U$ corresponds to the relations: $|U_{\mu i}|=|U_{\tau i}|$ with $i=1,2,3$. It predicts maximal atmospheric mixing and maximal Dirac CP violation given…

Define $S_n^k(T)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid all patterns in $T \subseteq S_m$. We enumerate $S_n^k(T)$, $T \subseteq S_3$, for all $|T| \geq 2$ and $0 \leq k \leq n$.

We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, $\tau=123$ and $n$ even, is a bijection that associates a Dyck prefix of…

Let $\Gamma$ be a countable group acting on a geodesic Gromov-hyperbolic metric space $X$ and $\mu$ a probability measure on $\Gamma$ whose support generates a non-elementary subsemigroup. Under the assumption that $\mu$ has a finite…

Permutation tests are a distribution free way of performing hypothesis tests. These tests rely on the condition that the observed data are exchangeable among the groups being tested under the null hypothesis. This assumption is easily…

A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at…

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…

We consider avoidance of permutation patterns with designated gap sizes between pairs of consecutive letters. We call the patterns having such constraints distant patterns (DPs) and we show their relation to other pattern notions…

We study $P(n,3)$, the size of the largest subset of the set of all permutations $S_n$ with minimum Kendall $\tau$-distance $3$. Using a combination of group theory and integer programming, we reduced the upper bound of $P(p,3)$ from…

We study scaling limits of random permutations ("permutons") constrained by having fixed densities of a finite number of patterns. We show that the limit shapes are determined by maximizing entropy over permutons with those constraints. In…