Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Pattern Avoidance fo ...
Article

Pattern Avoidance for Random Permutations

Harry Crane, Stephen DeSalvo
Download article
Open on arXiv
Submitted on
March 22, 2017
Accepted on
August 3, 2018
Published on
December 4, 2018
Last modified on
March 31, 2025
Special issue 19
vol. 19:2, Permutation Patterns 2016
Permutation Patterns
DOI
10.23638/DMTCS-19-2-13
License
arXiv.org - Non-exclusive license to distribute
National Science Foundation
1554092
CAREER: Probabilistic Foundations, Statistical Inference, and Invariance Principles for Evolving Combinatorial Structures
Indicators
975
Views
671
Downloads

Pattern Avoidance for Random Permutations

Harry Crane, Stephen DeSalvo
Abstract
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences and a corresponding joint distribution of independent Bernoulli random variables, which as a corollary yields a Poisson approximation for the distribution of the number of occurrences of any pattern. We also investigate occurrences of consecutive patterns in random Mallows permutations, of which uniform random permutations are a special case. These bounds allow us to estimate the probability that a pattern occurs any number of times and, in particular, the probability that a random permutation avoids a given pattern. Comment: 24 pages, 2 Figures, 4 Tables
Keywords
  • Mathematics - Combinatorics
  • Mathematics - Probability
  • 05A05, 05A15, 05A16, 60C05
Preview
Loading PDF preview...