Consecutive patterns in permutations
From MaRDI portal
Publication:1398289
DOI10.1016/S0196-8858(02)00527-4zbMath1016.05002OpenAlexW2143133001MaRDI QIDQ1398289
Publication date: 29 July 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-8858(02)00527-4
Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)
Related Items
Pattern avoidance in poset permutations, The number of cycles with a given descent set, Wilf equivalence relations for consecutive patterns, The \(q\)-exponential generating function for permutations by consecutive patterns and inversions, Consecutive patterns in inversion sequences II: avoiding patterns of relations, A context-free grammar for peaks and double descents of permutations, Permutations and words counted by consecutive patterns, Wilf equivalences between vincular patterns in inversion sequences, String Periods in the Order-Preserving Model, Consecutive pattern avoidances in non-crossing trees, Introduction to partially ordered patterns, Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem, A probabilistic approach to consecutive pattern avoiding in permutations, Shape-Wilf-equivalences for vincular patterns, A linear time algorithm for consecutive permutation pattern matching, 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, Exact and asymptotic enumeration of cyclic permutations according to descent set, Consecutive patterns in Catalan words and the descent distribution, Forbidden patterns and shift systems, Enumeration schemes for vincular patterns, Moments of permutation statistics and central limit theorems, Refined consecutive pattern enumeration via a generalized cluster method, An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem, Inversion sequences avoiding consecutive patterns, Unnamed Item, Unnamed Item, Generating functions for permutations avoiding a consecutive pattern, A \(q\)-analogue of generalized Eulerian polynomials with applications, Counting descent pairs with prescribed tops and bottoms, A necessary condition for c-Wilf equivalence, On uniquely \(k\)-determined permutations, Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics, Asymptotics of the extremal excedance set statistic, Clusters, generating functions and asymptotics for consecutive patterns in permutations, Descent pattern avoidance, Asymptotic enumeration of permutations avoiding generalized patterns, The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2, Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials, On basic forbidden patterns of functions, Avoiding consecutive patterns in permutations, An asymptotic distribution theory for Eulerian recurrences with applications, Counting and generating permutations in regular classes, Where the monotone pattern (mostly) rules, On pattern avoiding indecomposable permutations, String periods in the order-preserving model, Unnamed Item, On the generating function for consecutively weighted permutations, Joint distributions of permutation statistics and the parabolic cylinder functions, On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees, The sets of flattened partitions with forbidden patterns, Increasing consecutive patterns in words, Homomorphisms on noncommutative symmetric functions and permutation enumeration, Ascending runs in permutations and valued Dyck paths, Cyclic pattern containment and avoidance, Permutations, Moments, Measures, Noncrossing Arc Diagrams and Canonical Join Representations, Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials, Classical and consecutive pattern avoidance in rooted forests, Inversion polynomials for permutations avoiding consecutive patterns, A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra, Segmental partially ordered generalized patterns
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analytic combinatorics of non-crossing configurations
- Generalized permutation patterns and a classification of the Mahonian statistics
- Multi-avoidance of generalised patterns
- Limit laws for local counters in random binary search trees
- Enumeration of permutations by rises, falls, rising maxima and falling maxima
- Restricted permutations
- Generalized pattern avoidance
