A survey of consecutive patterns in permutations
From MaRDI portal
Abstract: A consecutive pattern in a permutation is another permutation determined by the relative order of a subsequence of contiguous entries of . Traditional notions such as descents, runs and peaks can be viewed as particular examples of consecutive patterns in permutations, but the systematic study of these patterns has flourished in the last 15 years, during which a variety of different techniques have been used. We survey some interesting developments in the subject, focusing on exact and asymptotic enumeration results, the classification of consecutive patterns into equivalence classes, and their applications to the study of one-dimensional dynamical systems.
Recommendations
Cited in
(38)- Consecutive patterns in permutations
- Wilf equivalence relations for consecutive patterns
- On super-strong Wilf equivalence classes of permutations
- Counting consecutive pattern matches in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\)
- A necessary condition for c-Wilf equivalence
- Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics
- Stack-sorting with consecutive-pattern-avoiding stacks
- Cyclic pattern containment and avoidance
- The feasible regions for consecutive patterns of pattern-avoiding permutations
- A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
- A central limit theorem for descents of a Mallows permutation and its inverse
- Stieltjes moment sequences for pattern-avoiding permutations
- Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
- Homomorphisms on noncommutative symmetric functions and permutation enumeration
- Permutations with small maximal \(k\)-consecutive sums
- Exact and asymptotic enumeration of cyclic permutations according to descent set
- The number of cycles with a given descent set
- Wilf equivalences between vincular patterns in inversion sequences
- scientific article; zbMATH DE number 5870282 (Why is no real title available?)
- Some remarks on the permutability of regular sequences
- A spectral approach to consecutive pattern-avoiding permutations
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- scientific article; zbMATH DE number 7058688 (Why is no real title available?)
- Some properties of roller coaster permutations
- Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
- Consecutive patterns in Coxeter groups
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
- Wilf equivalences for patterns in rooted labeled forests
- Stanley-Wilf limits for patterns in rooted labeled forests
- Thresholds for patterns in random permutations with a given number of inversions
- Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings
- Consecutive pattern containment and c-Wilf equivalence
- Periodic points of consecutive-pattern-avoiding stack-sorting maps
- Asymptotics of self-overlapping permutations
- Box-ball systems and RSK recording tableaux
- Penney's game for permutations
- Well quasi-order and atomicity for combinatorial structures under consecutive orders
- Consecutive patterns: from permutations to column-convex polyominoes and back
This page was built for publication: A survey of consecutive patterns in permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957196)
