English
Related papers

Related papers: Limits of permutation sequences through permutatio…

200 papers

We study the number of occurrences of any fixed vincular permutation pattern. We show that this statistics on uniform random permutations is asymptotically normal and describe the speed of convergence. To prove this central limit theorem,…

Combinatorics · Mathematics 2023-06-22 Lisa Hofer

For a measure preserving transformation $T$ of a probability space $(X,\mathcal F,\mu)$ we investigate almost sure and distributional convergence of random variables of the form $$x \to \frac{1}{C_n} \sum_{i_1<n,...,i_d<n}…

Dynamical Systems · Mathematics 2014-12-03 Manfred Denker , Mikhail Gordin

We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…

Combinatorics · Mathematics 2013-08-20 Hamed Hatami , Pooya Hatami , James Hirst

We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{\lambda(\sigma)/2}$ where…

Probability · Mathematics 2016-05-25 Svante Janson

A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…

Probability · Mathematics 2023-12-08 Jonas Sjöstrand

Let $f(z)=\sum_{n=1}^\infty a(n)q^n\in S^{\text{new}}_ k (\Gamma_0(N))$ be a newform with squarefree level $N$ that does not have complex multiplication. For a prime $p$, define $\theta_p\in[0,\pi]$ to be the angle for which $a(p)=2p^{( k…

Number Theory · Mathematics 2020-04-13 Jeremy Rouse , Jesse Thorner

Let $s: [1, \infty) \to \C$ be a locally integrable function in Lebesgue's sense on the infinite interval $[1, \infty)$. We say that $s$ is summable $(L, 1)$ if there exists some $A\in \C$ such that $$\lim_{t\to \infty} \tau(t) = A, \quad…

Classical Analysis and ODEs · Mathematics 2012-06-28 Ferenc Moricz

Given a positive integer $n$, consider a random permutation $\tau$ of the set $\{1,2,\ldots, n\}$. In $\tau$, we look for sequences of consecutive integers that appear in adjacent positions: a maximal such a sequence is called a block. Each…

Probability · Mathematics 2023-09-20 Shane Chern , Lin Jiu , Italo Simonelli

Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the…

Combinatorics · Mathematics 2024-05-13 Alexander Diaz-Lopez , Kathryn Haymaker , Colin McGarry , Dylan McMahon

We utilize Gaussian measure preserving systems to prove the existence and genericity of Lebesgue measure preserving transformations $T:[0,1]\rightarrow [0,1]$ which exhibit both mixing and rigidity behavior along families of asymptotically…

Dynamical Systems · Mathematics 2022-07-26 Rigoberto Zelada

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 consider a sequence of random variables $(R_n)$ defined by the recurrence $R_n=Q_n+M_nR_{n-1}$, $n\ge1$, where $R_0$ is arbitrary and $(Q_n,M_n)$, $n\ge1$, are i.i.d. copies of a two-dimensional random vector $(Q,M)$, and $(Q_n,M_n)$ is…

Statistics Theory · Mathematics 2011-07-15 Paweł Hitczenko , Jacek Wesołowski

We consider a random permutation drawn from the set of permutations of length $n$ that avoid some given set of patterns of length 3. We show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after suitable…

Probability · Mathematics 2018-04-18 Svante Janson

A permutation $\sigma\in S_n$ is said to be $k$-universal or a $k$-superpattern if for every $\pi\in S_k$, there is a subsequence of $\sigma$ that is order-isomorphic to $\pi$. A simple counting argument shows that $\sigma$ can be a…

Combinatorics · Mathematics 2021-02-03 Zachary Chroman , Matthew Kwan , Mihir Singhal

For a permuton $\mu$ let $H_n(\mu)$ denote the Shannon entropy of the sampling distribution of $\mu$ on $n$ points. We investigate the asymptotic growth of $H_n(\mu)$ for a wide class of permutons. We prove that if $\mu$ has a non-vanishing…

Probability · Mathematics 2025-03-25 Balázs Maga

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…

Combinatorics · Mathematics 2009-09-17 Michael Lugo

A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…

Probability · Mathematics 2023-03-07 Jonas Sjöstrand

The main goal of this note is to prove the following theorem. If $A_n$ is a sequence of measurable sets in a $\sigma$-finite measure space $(X, \mathcal{A}, \mu)$ that covers $\mu$-a.e. $x \in X$ infinitely many times, then there exists a…

Logic · Mathematics 2011-09-23 Márton Elekes

Let $S_n$ be the symmetric group on the set $\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a peak at index $i$ if $\sigma_{i-1}<\sigma_i>\sigma_{i+1}$. Let $\text{Peak}(\sigma)$ be…

Combinatorics · Mathematics 2024-01-22 Alexander Diaz-Lopez , Kathryn Haymaker , Kathryn Keough , Jeongbin Park , Edward White

An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…

Combinatorics · Mathematics 2025-08-22 Charles Burnette