Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns
From MaRDI portal
Publication:6611742
DOI10.1016/j.disc.2024.114199zbMATH Open1547.05012MaRDI QIDQ6611742
Publication date: 27 September 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- Pattern matching for permutations
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Clustering of consecutive numbers in permutations under Mallows distributions and super-clustering under general \(p\)-shifted distributions
- Problems from the discrete to the continuous. Probability, number theory, graph theory, and combinatorics
- Simple permutations and pattern restricted permutations
- Permutation classes
- On Three Different Notions of Monotone Subsequences
- Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations
- The Asymptotic Distribution of Runs of Consecutive Elements
- Note on Runs of Consecutive Elements
- Restricted permutations
- The infinite limit of separable permutations
This page was built for publication: Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns
