Thresholds for patterns in random permutations with a given number of inversions
From MaRDI portal
Publication:6635161
Recommendations
Cites work
- scientific article; zbMATH DE number 2123132 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 2000846 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- A Central Limit Theorem for Vincular Permutation Patterns
- A central limit theorem for descents of a Mallows permutation and its inverse
- A probabilistic approach to consecutive pattern avoiding in permutations
- A survey of consecutive patterns in permutations
- An asymptotic expansion for the number of permutations with a certain number of inversions
- Asymptotic enumeration of permutations avoiding generalized patterns
- Central and local limit theorems applied to asymptotic enumeration
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Combinatorics of permutations
- Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions
- Consecutive patterns in permutations
- Degree sequence of random permutation graphs
- Enumeration schemes for vincular patterns
- Generalized pattern avoidance
- Generalized permutation patterns and a classification of the Mahonian statistics
- Independence of permutation limits at infinitely many scales
- Introduction to Random Graphs
- Lengths of monotone subsequences in a Mallows permutation
- Limit theorems for longest monotone subsequences in random Mallows permutations
- Limits of Mallows trees
- NON-NULL RANKING MODELS. I
- On the asymptotic statistics of the number of occurrences of multiple permutation patterns
- On the connected components of a random permutation graph with a given number of edges
- On the distribution of the length of the longest increasing subsequence of random permutations
- Pattern avoidance for random permutations
- Patterns in permutations and words.
- Permutation classes
- Permutations avoiding a pattern of length three under Mallows distributions
- Permutations with fixed pattern densities
- Permutations with inversions
- Random Graphs
- Random graphs.
- The feasible region for consecutive patterns of permutations is a cycle polytope
- The length of the longest increasing subsequence of a random Mallows permutation
- The probability of avoiding consecutive patterns in the Mallows distribution
- The surprising mathematics of longest increasing subsequences
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)
