Universality of random permutations

DOI10.1112/blms.12345zbMath1444.05004arXiv1911.12878OpenAlexW2989566892MaRDI QIDQ3300092

Xiaoyu He, Matthew Kwan

Publication date: 27 July 2020

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.12878

zbMATH Keywords

Alon's conjecture

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (2)

Universal arrays ⋮ Lower bounds for superpatterns and universal sequences

Cites Work

• Asymptotically optimal induced universal graphs
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Asymptotic bounds for permutations containing many different patterns
• A variational problem for random Young tableaux
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Combinatorics and probability. Abstracts from the workshop held April 17--23, 2016
• Hammersley's interacting particle process and longest increasing subsequences
• Dense packing of patterns in a permutation
• Classification of bijections between 321- and 132-avoiding permutations
• The Surprising Mathematics of Longest Increasing Subsequences
• Adjacency Labeling Schemes and Induced-Universal Graphs
• Better upper bounds on the Füredi-Hajnal limits of permutations
• Containing All Permutations
• On minimal n-universal graphs
• Universal graphs and universal functions
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: Universality of random permutations