English
Related papers

Related papers: Six Permutation Patterns Force Quasirandomness

200 papers

We study the asymptotic behavior of short cycles of random permutations with cycle weights. More specifically, on a specially constructed metric space whose elements encode all possible cycles, we consider a point process containing all…

Probability · Mathematics 2025-02-11 Oleksii Galganov , Andrii Ilienko

Let $i(n,k)$ be the proportion of permutations $\pi\in\mathcal{S}_n$ having an invariant set of size $k$. In this note we adapt arguments of the second author to prove that $i(n,k) \asymp k^{-\delta} (1+\log k)^{-3/2}$ uniformly for $1\leq…

Combinatorics · Mathematics 2019-10-22 Sean Eberhard , Kevin Ford , Ben Green

We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called $\mu$-random permutations. We also introduce and study a new general class of…

Probability · Mathematics 2023-04-04 Jacopo Borga , Sayan Das , Sumit Mukherjee , Peter Winkler

Suppose $\pi$ and $\pi'$ are two random elements of $S_n$ with constrained cycle types such that $\pi$ has $x n^{1/2}$ fixed points and $yn/2$ two-cycles, and likewise $\pi'$ has $x' n^{1/2}$ fixed points and $y'n/2$ two-cycles. We show…

Group Theory · Mathematics 2022-05-17 Sean Eberhard , Daniele Garzoni

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…

Probability · Mathematics 2015-02-05 Romain Couillet , Walid Hachem

An alternating permutation of length $n$ is a permutation $\pi=\pi_1 \pi_2 ... \pi_n$ such that $\pi_1 < \pi_2 > \pi_3 < \pi_4 > ...$. Let $A_n$ denote set of alternating permutations of ${1,2,..., n}$, and let $A_n(\sigma)$ be set of…

Combinatorics · Mathematics 2012-12-13 Joanna N. Chen , William Y. C. Chen , Robin D. P. Zhou

We study systems of particles on a line which have a maximum, are locally finite and evolve with independent increments. ``Quasi-stationary states'' are defined as probability measures, on the \sigma-algebra generated by the gap variables,…

Probability · Mathematics 2007-05-23 Anastasia Ruzmaikina , Michael Aizenman

Cobham's theorem asserts that if a sequence is automatic with respect to two multiplicatively independent bases, then it is ultimately periodic. We prove a stronger density version of the result: if two sequences which are automatic with…

Number Theory · Mathematics 2017-11-02 Jakub Byszewski , Jakub Konieczny

We show that there is a non-empty class of finitely additive probabilities on $\mathbb N^2$ such that for each member of the class, each set with limiting relative frequency $p$ has probability $p$. Hence, in that context the probability…

Probability · Mathematics 2019-09-19 Jing Lei , Joseph B. Kadane

We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…

Combinatorics · Mathematics 2026-03-24 Michael Waite

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…

Combinatorics · Mathematics 2015-09-01 Richard Kenyon , Daniel Kral , Charles Radin , Peter Winkler

The circular peak set of a permutation $\sigma$ is the set $\{\sigma(i)\mid \sigma(i-1)<\sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $cp_n(S)$ denote the number of…

Combinatorics · Mathematics 2008-06-05 Pierre Bouchard , Hungyung Chang , Jun Ma , Jean Yeh

Two permutations $s$ and $t$ are $k$-similar if they can be decomposed into subpermutations $s^1, \ldots, s^k$ and $t^1, \ldots, t^k$ such that $s^i$ is order-isomorphic to $t^i$ for all $i$. Recently, Dudek, Grytczuk and Ruci\'nski posed…

Combinatorics · Mathematics 2023-01-24 Carla Groenland , Tom Johnston , Dániel Korándi , Alexander Roberts , Alex Scott , Jane Tan

We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…

Probability · Mathematics 2009-01-16 Florent Benaych-Georges

A famous conjecture of Parkin-Shanks predicts that $p(n)$ is odd with density $1/2$. Despite the remarkable amount of work of the last several decades, however, even showing this density is positive seems out of reach. In a 2018 paper with…

Combinatorics · Mathematics 2021-06-29 Fabrizio Zanello

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…

Number Theory · Mathematics 2007-05-23 Ernie Croot

Every quasigroup $(S,\cdot)$ belongs to a set of 6 quasigroups, called parastrophes denoted by $(S,\pi_i)$, $i\in \{1,2,3,4,5,6\}$. It is shown that isotopy-isomorphy is a necessary and sufficient condition for any two distinct quasigroups…

General Mathematics · Mathematics 2010-03-09 Temitope Gbolahan Jaiyeola

We say that a permutation $\pi$ is a Motzkin permutation if it avoids 132 and there do not exist $a<b$ such that $\pi_a<\pi_b<\pi_{b+1}$. We study the distribution of several statistics in Motzkin permutations, including the length of the…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde , Toufik Mansour

Let $P_n^1,\dots, P_n^d$ be $n\times n$ permutation matrices drawn independently and uniformly at random, and set $S_n^d:=\sum_{\ell=1}^d P_n^\ell$. We show that if $\log^{12}n/(\log \log n)^{4} \le d=O(n)$, then the empirical spectral…

Probability · Mathematics 2018-04-05 Anirban Basak , Nicholas Cook , Ofer Zeitouni

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