Related papers: Large Deviations for Permutations Avoiding Monoton…

In a uniform random permutation \Pi of [n] := {1,2,...,n}, the set of elements k in [n-1] such that \Pi(k+1) = \Pi(k) + 1 has the same distribution as the set of fixed points of \Pi that lie in [n-1]. We give three different proofs of this…

For $0\le \alpha <1$ and $\beta>2$, we consider a linear mod 1 transformation on a unit interval; $x\mapsto\beta x+\alpha$ (${\rm mod}\ 1$), and prove that it satisfies the level-2 large deviation principle with the unique measure of…

We find that the lepton flavor mixing matrix $U$ should possess a partial $\mu$-$\tau$ permutation symmetry $|U^{}_{\mu 1}| = |U^{}_{\tau 1}|$, and the latter predicts a novel correlation between the Dirac CP-violating phase $\delta$ and…

Consider $N\times N$ Hermitian or symmetric random matrices $H$ where the distribution of the $(i,j)$ matrix element is given by a probability measure $\nu_{ij}$ with a subexponential decay. Let $\sigma_{ij}^2$ be the variance for the…

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

A permutation P on {1,..,N} is a_fast_forward_permutation_ if for each m the computational complexity of evaluating P^m(x)$ is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions.…

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

We give an improved algorithm for counting the number of $1324$-avoiding permutations, resulting in 5 further terms of the generating function. We analyse the known coefficients and find compelling evidence that unlike other classical…

We study i.i.d. sums $\tau_k$ of nonnegative variables with index $0$: this means $\mathbf{P}(\tau_1=n) = \varphi(n) n^{-1}$, with $\varphi(\cdot)$ slowly varying, so that $\mathbf{E}(\tau_1^\varepsilon)=\infty$ for all $\varepsilon>0$. We…

Suppose $\alpha, \beta$ are Lipschitz strongly concave functions from $[0, 1]$ to $\mathbb{R}$ and $\gamma$ is a concave function from $[0, 1]$ to $\mathbb{R}$, such that $\alpha(0) = \gamma(0) = 0$, and $\alpha(1) = \beta(0) = 0$ and…

We study the distribution function $P(\omega)$ of the random variable $\omega = \tau_1/(\tau_1 + ... + \tau_N)$, where $\tau_k$'s are the partial Wigner delay times for chaotic scattering in a disordered system with $N$ independent,…

Let $\xi_1, \xi_2,\ldots$ be a sequence of independent and identically distributed random variables with zero mean, finite second moment and regularly varying right distribution tail. Motivated by a stop-loss insurance model, we consider a…

$\mu$-$\tau$ symmetry imposed on the neutrino mass matrix in the flavour basis is known to be quite predictive. We integrate this very specific neutrino symmetry into a more general framework based on the supersymmetric SO(10) grand unified…

Let $S_n$ denote the set of permutations of $[n]$ and let $\sigma=\sigma_1\cdots\sigma_n\in S_n$. For a subsequence $\{\sigma_{i_j}\}_{j=1}^k$ of $\{\sigma_i\}_{i=1}^n$ of length $k\ge2$, construct the ``up/down'' sequence $V_1\cdots…

Evidence in favor of supersymmetric grand unification including that based on the observed family multiplet-structure, gauge coupling unification, neutrino oscillations, baryogenesis, and certain intriguing features of quark-lepton masses…

Any permutation statistic $f:\sym\to\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: $f= \Sigma_\tau\lambda_f(\tau)\tau$. To provide explicit expansions for certain…

One of the key assumptions of the Standard Model of fundamental particles is that the interactions of the charged leptons, namely electrons, muons, and taus, differ only because of their different masses. While precision tests have not…

In this article we consider Wigner matrices $X_N$ with variance profiles (also called Wigner-type matrices) which are of the form $X_N(i,j) = \sigma(i/N,j/N) a_{i,j} / \sqrt{N}$ where $\sigma$ is a symmetric real positive function of…

A descent $k$ of a permutation $\pi=\pi_{1}\pi_{2}\dots\pi_{n}$ is called a big descent if $\pi_{k}>\pi_{k+1}+1$; denote the number of big descents of $\pi$ by $\operatorname{bdes}(\pi)$. We study the distribution of the…

Let $n$, $s$ and $k$ be positive integers. For distinct $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a circle. So \[ ||i,j||_n=\min\{(i-j)\bmod…