English
Related papers

Related papers: Six Permutation Patterns Force Quasirandomness

200 papers

Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…

Logic in Computer Science · Computer Science 2018-11-06 Alejandro Díaz-Caro , Guido Martínez

Let S_n be the nth symmetric group. Given a set of permutations Pi we denote by S_n(Pi) the set of permutations in S_n which avoid Pi in the sense of pattern avoidance. Consider the generating function Q_n(Pi) = sum_pi F_{Des pi} where the…

Combinatorics · Mathematics 2018-12-31 Jonathan Bloom , Bruce Sagan

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

Number Theory · Mathematics 2007-09-23 Ben Green , Terence Tao

We prove a conjecture by Garbe et al. [arXiv:2010.07854] by showing that a Latin square is quasirandom if and only if the density of every 2x3 pattern is 1/720+o(1). This result is the best possible in the sense that 2x3 cannot be replaced…

Combinatorics · Mathematics 2021-08-27 Jacob W. Cooper , Daniel Kral , Ander Lamaison , Samuel Mohr

A sample of n generic points in the xy-plane defines a permutation that relates their ranks along the two axes. Every subset of k points similarly defines a pattern, which occurs in that permutation. The number of occurrences of small…

Data Structures and Algorithms · Computer Science 2021-09-14 Chaim Even-Zohar , Calvin Leng

In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is…

Cryptography and Security · Computer Science 2019-07-12 Claude Gravel , Daniel Panario , David Thomson

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…

Probability · Mathematics 2011-11-10 Omer Angel , Alexander E. Holroyd , Dan Romik , Balint Virag

We determine the maximal pseudovarieties of finite semigroups that satisfy an identity of the form $x_1 \dots x_n \approx \rho(x_1, \dots, x_n)$. Applying this classification, we further show that a pseudovariety of permutative semigroups…

Rings and Algebras · Mathematics 2025-09-24 Alexander Thumm

Let X be randomly chosen from {-1,1}^n, and let Y be randomly chosen from the standard spherical Gaussian on R^n. For any (possibly unbounded) polytope P formed by the intersection of k halfspaces, we prove that |Pr [X belongs to P] - Pr [Y…

Computational Complexity · Computer Science 2013-02-05 Prahladh Harsha , Adam Klivans , Raghu Meka

The anti-concentration phenomenon in probability theory has been intensively studied in recent years, with applications across many areas of mathematics. In most existing works, the ambient probability space is a product space generated by…

Combinatorics · Mathematics 2026-03-23 Viet H. Do , Hoi H. Nguyen , Kiet H. Phan , Tuan Tran , Van H. Vu

We obtain some theoretic and experimental results concerning various properties (the number of fixed points, image distribution, cycle lengths) of the dynamical system naturally associated with Fermat quotients acting on the set $\{0, ...,…

Number Theory · Mathematics 2010-01-25 Alina Ostafe , Igor E. Shparlinski

For uniform random permutations conditioned to have no long cycles, we prove that the total number of cycles satisfies a central limit theorem. Under additional assumptions on the asymptotic behavior of the set of allowed cycle lengths, we…

Probability · Mathematics 2016-08-31 Volker Betz , Helge Schäfer

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

Functional Analysis · Mathematics 2025-04-04 Michael Anshelevich , Anh Nguyen

A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…

Combinatorics · Mathematics 2023-06-30 Gal Beniamini , Nir Lavee , Nati Linial

Density matrices are the most general descriptions of quantum states, covering both pure and mixed states. Positive semidefiniteness is a physical requirement of density matrices, imposing nonnegative probabilities of measuring physical…

Quantum Physics · Physics 2024-09-11 Colm Kelleher

A homemorphism between domains in $\mathbb R^n$, $n\ge 2$ is quasiconformal, with its intricate analytic and geometric consequences, if the (pointwise) linear dilatation -- a purely metric quantity -- is uniformly bounded. Gehring proved…

Functional Analysis · Mathematics 2026-04-01 Behnam Esmayli , Pekka Koskela , Khanh Nguyen

We study the probabilistic evolution of a birth and death continuous time measure-valued process with mutations and ecological interactions. The individuals are characterized by (phenotypic) traits that take values in a compact metric…

Probability · Mathematics 2009-04-23 Pierre Collet , Servet Martinez , Sylvie Méléard , Jaime San Martin

For a class of sparse random matrices of the form $A_n =(\xi_{i,j}\delta_{i,j})_{i,j=1}^n$, where $\{\xi_{i,j}\}$ are i.i.d.~centered sub-Gaussian random variables of unit variance, and $\{\delta_{i,j}\}$ are i.i.d.~Bernoulli random…

Probability · Mathematics 2018-06-13 Anirban Basak , Mark Rudelson

A polynomial ensemble is a probability density function for the position of $n$ real particles of the form $\frac{1}{Z_n} \, \prod_{j<k} (x_k-x_j) \, \det \left[ f_k (x_j) \right]_{j,k=1}^n$, for certain functions $f_1, \ldots, f_n$. Such…

Probability · Mathematics 2019-03-22 Arno B. J. Kuijlaars

The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…

Probability · Mathematics 2015-05-19 Julia Storm , Dirk Zeindler
‹ Prev 1 8 9 10 Next ›