Thresholds for patterns in random permutations with a given number of inversions

DOI10.37236/12601MaRDI QIDQ6635161FDOQ6635161

Authors: David Bevan, Dan Threlfall 

Publication date: 9 November 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• Patterns in random permutations avoiding some sets of multiple patterns
• The shape of random pattern-avoiding permutations
• Patterns in random permutations avoiding the pattern 321
• Permutations with inversions
• Patterns in random permutations avoiding some other patterns

zbMATH Keywords

patterns in random compositionuniform random permutation

Mathematics Subject Classification ID

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

Cites Work

• NON-NULL RANKING MODELS. I
• Title not available (Why is that?)
• Random Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the distribution of the length of the longest increasing subsequence of random permutations
• Title not available (Why is that?)
• Random graphs.
• Central and local limit theorems applied to asymptotic enumeration
• Combinatorics of permutations
• Generalized permutation patterns and a classification of the Mahonian statistics
• Patterns in permutations and words.
• Consecutive patterns in permutations
• Generalized pattern avoidance
• The surprising mathematics of longest increasing subsequences
• Permutation classes
• Introduction to Random Graphs
• The length of the longest increasing subsequence of a random Mallows permutation
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• An asymptotic expansion for the number of permutations with a certain number of inversions
• Clusters, generating functions and asymptotics for consecutive patterns in permutations
• Asymptotic enumeration of permutations avoiding generalized patterns
• Permutations with inversions
• A probabilistic approach to consecutive pattern avoiding in permutations
• On the connected components of a random permutation graph with a given number of edges
• Title not available (Why is that?)
• Enumeration schemes for vincular patterns
• Title not available (Why is that?)
• The feasible region for consecutive patterns of permutations is a cycle polytope
• A survey of consecutive patterns in permutations
• Permutations with fixed pattern densities
• Degree sequence of random permutation graphs
• Pattern avoidance for random permutations
• Limit theorems for longest monotone subsequences in random Mallows permutations
• A Central Limit Theorem for Vincular Permutation Patterns
• On the asymptotic statistics of the number of occurrences of multiple permutation patterns
• Lengths of monotone subsequences in a Mallows permutation
• The probability of avoiding consecutive patterns in the Mallows distribution
• A central limit theorem for descents of a Mallows permutation and its inverse
• Independence of permutation limits at infinitely many scales
• Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions
• Permutations avoiding a pattern of length three under Mallows distributions
• Limits of Mallows trees

This page was built for publication: Thresholds for patterns in random permutations with a given number of inversions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635161)