English
Related papers

Related papers: Large Deviations for Permutations Avoiding Monoton…

200 papers

We study the full distribution $P_{N}\left(A\right)$ of sums $A = \sum_{i=1}^N$ where $x_1, \dots, x_N$ are $N \gg 1$ independent and identically distributed random variables each sampled from a given distribution $p(x)$ with a…

Statistical Mechanics · Physics 2025-07-09 Naftali R. Smith

In this article we establish a large deviation principle for the family {\nu_{\epsilon}:\epsilon \in (0,1)} of distributions of the scaled stochastic processes {P_{-\log\sqrt{\epsilon}}Z_t}_{t\leq 1}, where (Z_t)_{t\in \lbrack 0,1]} is a…

Probability · Mathematics 2009-04-06 Z. Qian , C. Xu

In this note we establish a uniform bound for the distribution of a sum $S_n=X_1+\cdots+X_n$ of independent non-homogeneous Bernoulli trials. Specifically, we prove that $\sigma_n \mathbb{P}(S_n\!=\!j)\leq\eta$ where $\sigma_n$ denotes the…

Probability · Mathematics 2019-02-20 Jean-Bernard Baillon , Roberto Cominetti , José Vaisman

Comtet introduced the notion of indecomposable permutations in 1972. A permutation is indecomposable if and only if it has no proper prefix which is itself a permutation. Indecomposable permutations were studied in the literature in various…

Combinatorics · Mathematics 2016-05-24 Alice L. L. Gao , Sergey Kitaev , Philip B. Zhang

The aim of this paper is to improve the large deviation principle for the number of descents in a random permutation by establishing a sharp large deviation principle of any order. We shall also prove a sharp large deviation principle of…

Probability · Mathematics 2024-07-09 Bernard Bercu , Michel Bonnefont , Luis Fredes , Adrien Richou

An open conjecture in pattern avoidance theory is that the distribution of the major index among 321-avoiding permutations is distributed unimodally. We construct a formula for this distribution, and in the case of 2 descents prove…

Combinatorics · Mathematics 2017-07-14 William J. Keith

Let ${X}_{k}=(x_{k1}, \cdots, x_{kp})', k=1,\cdots,n$, be a random sample of size $n$ coming from a $p$-dimensional population. For a fixed integer $m\geq 2$, consider a hypercubic random tensor $\mathbf{{T}}$ of $m$-th order and rank $n$…

Probability · Mathematics 2019-10-29 Tiefeng Jiang , Junshan Xie

A permutation $\pi \in S_n$ is said to {\it avoid} a permutation $\sigma \in S_k$ whenever $\pi$ contains no subsequence with all of the same pairwise comparisons as $\sigma$. For any set $R$ of permutations, we write $S_n(R)$ to denote the…

Combinatorics · Mathematics 2007-05-23 Eric S. Egge , Toufik Mansour

We present in a full analytic form the partial widths for the lepton flavour violating decays $\mu^\pm \to e^\pm e^+ e^-$ and $\tau^\pm \to \ell^\pm \ell'^{+} \ell'^{-}$, with $\ell,\ell'=\mu,e$, mediated by neutrino oscillations in the…

High Energy Physics - Phenomenology · Physics 2020-07-15 Patrick Blackstone , Matteo Fael , Emilie Passemar

Fermion mass matrices generally rotate in generation space under scale changes, which can lead to fermions of different generations transmuting into one another. The effect is examined in detail and its cross-section calculated for $\gamma…

High Energy Physics - Phenomenology · Physics 2007-05-23 S. T. Tsou

Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal code sizes (for said metric) ala Delsarte's approach. For…

Information Theory · Computer Science 2012-06-07 Fabian Lim , Manabu Hagiwara

Given a set $I \subseteq \mathbb{N}$, consider the sequences $\{d_n(I)\},\{p_n(I)\}$ where for any $n$, $d_n(I)$ and $p_n(I)$ respectively count the number of permutations in the symmetric group $\mathfrak{S}_n$ whose descent set…

Combinatorics · Mathematics 2025-09-23 Mohamed Omar , Justin M. Troyka

We derive new constraints on the quantities delta_{XY}^{ij}, X,Y=L,R, which parametrise the flavour-off-diagonal terms of the charged slepton mass matrix in the MSSM. Considering mass and anomalous magnetic moment of the electron we obtain…

High Energy Physics - Phenomenology · Physics 2015-03-13 Jennifer Girrbach , Susanne Mertens , Ulrich Nierste , Soren Wiesenfeldt

We present general links between statistics of non-Hermitian random matrices and the distribution of the number of cycles of some specific random permutations. In particular, we derive explicit formulas for the generating functions of the…

Probability · Mathematics 2021-11-12 Guillaume Dubach

Motivated by metastability in the zero-range process, we consider i.i.d.\ random variables with values in $\N_0$ and Weibull-like (stretched exponential) law $\mathbb P(X_i =k) = c \exp( - k^\alpha)$, $\alpha \in (0,1)$. We condition on…

Probability · Mathematics 2024-05-28 Sabine Jansen

We introduce and study a new random permutation model that generalizes the $k$-card minimum model defined by Travers and the Mallows model. We calculate the permuton limit of such a sequence of random permutations. As a corollary, we deduce…

Probability · Mathematics 2025-02-26 Joanna Jasińska , Balázs Ráth

We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\sigma$ is a pair of consecutive elements $\sigma(i), \sigma(i+1)$ such that $\sigma(i) >…

Probability · Mathematics 2023-12-19 Paul Thévenin , Stephan Wagner

The original \bnum -(or $\bar{\nu}_{\tau}$-) energy spectrum from the gravitational collapse of a star has a larger average energy than the spectrum for \bnue since the opacity of \bnue exeeds that of \bnum (or $\nu_{\tau}$). Flavor…

High Energy Physics - Phenomenology · Physics 2009-10-22 Alexei Yu. Smirnov , David N. Spergel , John N. Bahcall

Let the random variable $Z_{n,k}$ denote the number of increasing subsequences of length $k$ in a random permutation from $S_n$, the symmetric group of permutations of $\{1,...,n\}$. We show that $Var(Z_{n,k_n})=o((EZ_{n,k_n})^2)$ as $…

Probability · Mathematics 2007-05-23 Ross Pinsky

We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation $\tau$ on k letters, or containing $\tau$ exactly once. In several interesting cases the generating function depends only on…

Combinatorics · Mathematics 2007-05-23 T. Mansour , A. Vainshtein