English
Related papers

Related papers: Six Permutation Patterns Force Quasirandomness

200 papers

Arithmetic quasi-densities are a large family of real-valued set functions partially defined on the power set of $\mathbb{N}$, including the asymptotic density, the Banach density, the analytic density, etc. Let $B \subseteq \mathbb{N}$ be…

Number Theory · Mathematics 2024-05-22 Paolo Leonetti , Salvatore Tringali

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…

Probability · Mathematics 2014-04-29 Persi Diaconis , Steven N. Evans , Ron Graham

For a class of random matrix ensembles with correlated matrix elements, it is shown that the density of states is given by the Wigner semi-circle law. This is applied to effective Hamiltonians related to the Anderson model in dimensions…

Mathematical Physics · Physics 2007-05-23 Jeffrey H. Schenker , Hermann Schulz-Baldes

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\{ F_i \}_{i = 1}^{\infty}$. A set $S \subset \mathbb{Z}$ is said to satisfy Benford's law if the density…

Be d_{m,n} a generic element in the infinite matrix D, with d_{1, n} defined as the n-th prime number and, for any m>1, d_{m, n} = | d_{m-1, n} - d_{m-1, n+1} | When n>1, after the first few terms the columns in the matrix appear to be…

Number Theory · Mathematics 2016-07-20 Raffaele Salvia

Fix $\varepsilon > 0$. We say that a finite group $G$ is $\varepsilon$-quasirandom if every nontrivial irreducible complex representation of $G$ has degree at least $|G|^\varepsilon$. In this paper, we give a structure theorem for large…

Group Theory · Mathematics 2025-10-02 Marco Barbieri , Luca Sabatini

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…

Combinatorics · Mathematics 2023-08-08 Édouard Bonnet , Romain Bourneuf , Colin Geniet , Stéphan Thomassé

In the first part of the paper, we study the inversion statistic of random permutations under the family $(\mathbb{P}_\theta^{(n)})_{\theta \ge 0}$ of Ewens sampling distributions on $S_n$. We obtain a rather simple exact formula for the…

Probability · Mathematics 2025-11-18 Ross G. Pinsky , Dominic T. Schickentanz

For a set of permutations $S\subseteq S_n$, consider the quasisymmetric generating function $$Q(S): = \sum_{w\in S}F_{n, \mathrm{Des}(w)},$$ where $\mathrm{Des}(w) := \{i\mid w(i)> w(i+1)\}$ is the descent set of $w$ and $F_{n,…

Combinatorics · Mathematics 2026-01-14 Tuong Le

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

Number Theory · Mathematics 2021-02-12 Ron Brown

Partial rigidity is a quantitative notion of recurrence and provides a global obstruction which prevents the system from being strongly mixing. A dynamical system $(X, \mathcal{X}, \mu, T)$ is partially rigid if there is a constant $\delta…

Dynamical Systems · Mathematics 2024-12-13 Tristán Radić

A permutation $\pi$ is said to avoid a chain $(\sigma:\tau)$ of patterns if $\pi$ avoids $\sigma$ and $\pi^2$ avoids $\tau.$ In this paper, we define a notion of pattern avoidance for compositions of positive integers and use that idea to…

Combinatorics · Mathematics 2026-05-27 Kassie Archer , Noel Bourne

Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…

Combinatorics · Mathematics 2015-08-18 Sergey Bereg , Alexander E. Holroyd , Lev Nachmanson , Sergey Pupyrev

Given a permutation $\sigma$, the Robinson-Schensted correspondence determines a certain partition called the shape of $\sigma$. Famously, the shape measures the longest unions of increasing and decreasing subsequences, thus giving global…

Combinatorics · Mathematics 2026-05-12 William Q. Erickson

The wrapped normal distribution arises when a the density of a one-dimensional normal distribution is wrapped around the circle infinitely many times. At first look, evaluation of its probability density function appears tedious as an…

Computation · Statistics 2018-01-01 Gerhard Kurz , Igor Gilitschenski , Uwe D. Hanebeck

We define a new family of overlaps $C_{N,m}$ for the XXZ Hamiltonian on a periodic chain of length $N$. These are equal to the linear sums of the groundstate components, in the canonical basis, wherein $m$ consecutive spins are fixed to the…

Mathematical Physics · Physics 2020-07-31 Alexi Morin-Duchesne , Christian Hagendorf , Luigi Cantini

A subset $S$ of the alternating group on $n$ points is {\it intersecting} if for any pair of permutations $\pi,\sigma$ in $S$, there is an element $i\in \{1,\dots,n\}$ such that $\pi(i)=\sigma(i)$. We prove that if $S$ is intersecting, then…

Combinatorics · Mathematics 2013-03-01 Bahman Ahmadi , Karen Meagher

We identify a surprising inequality satisfied by elementary symmetric polynomials under the action of the fixed point measure of a random permutation. Concretely, for any collection of $n$ non-negative real numbers $a_1, \dots, a_n \in…

Combinatorics · Mathematics 2025-05-20 Ayush Khaitan , Ishan Mata , Bhargav Narayanan

The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemer\'edi theorem which says that any subset of a pseudorandom set of…

Number Theory · Mathematics 2015-10-26 David Conlon , Jacob Fox , Yufei Zhao

We establish a new mixing theorem for quasirandom groups (finite groups with no low-dimensional unitary representations) $G$ which, informally speaking, asserts that if $g, x$ are drawn uniformly at random from $G$, then the quadruple…

Dynamical Systems · Mathematics 2013-08-05 Vitaly Bergelson , Terence Tao