Generalized pattern avoidance
From MaRDI portal
Publication:5949033
DOI10.1006/eujc.2001.0515zbMath0994.05004arXivmath/0011235OpenAlexW2071829066WikidataQ56157591 ScholiaQ56157591MaRDI QIDQ5949033
Publication date: 2 October 2002
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0011235
permutationsinvolutionsMotzkin pathspermutation statisticsset partitionsBell numbersDyck pathsBessel numbersCatalan numbersmonotone partitionsMotzkin numbersnon-overlapping partitionspattern avoidance
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05)
Related Items
Continued fractions and generalized patterns, Bell numbers, their relatives, and algebraic differential equations, Noncommutative Bell polynomials and the dual immaculate basis, Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions, Odd diagrams, Bruhat order, and pattern avoidance, Set partitions and integrable hierarchies, Word-Representable Graphs: a Survey, EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model, Permutation tableaux and permutation patterns, Wilf equivalences between vincular patterns in inversion sequences, Introduction to partially ordered patterns, Wilf-classification of mesh patterns of short length, \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon, Unnamed Item, Refining enumeration schemes to count according to permutation statistics, Consecutive patterns in permutations, The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group, Equidistributions of Mahonian statistics over pattern avoiding permutations, Degenerations and multiplicity-free formulas for products of \(\psi\) and \(\omega\) classes on \(\overline{M}_{0,n} \), Top-degree components of Grothendieck and Lascoux polynomials, Enumeration schemes for vincular patterns, Vincular pattern avoidance on cyclic permutations, Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations, Catalan pairs: a relational-theoretic approach to Catalan numbers, Passing through a stack k times, On \(\underline{12} 0\)-avoiding inversion and ascent sequences, Some results on the avoidance of vincular patterns by multisets, Set partition asymptotics and a conjecture of Gould and Quaintance, Applying the cluster method to count occurrences of generalized permutation patterns, Descent pattern avoidance, Logarithmic behavior of some combinatorial sequences, The area above the Dyck path of a permutation, Generalized statistics on \(S_{n}\) and pattern avoidance, Asymptotic enumeration of permutations avoiding generalized patterns, The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2, A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations, Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials, Unnamed Item, Vincular patterns in inversion sequences, On pattern avoiding indecomposable permutations, Bijections for permutation tableaux, Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations, The sets of flattened partitions with forbidden patterns, New permutation statistics: Variation and a variant, Passing through a stack \(k\) times with reversals, From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns, Partially ordered generalized patterns, Permutations, Moments, Measures, Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials, Inversion polynomials for permutations avoiding consecutive patterns, Transport of patterns by Burge transpose, Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations, Segmental partially ordered generalized patterns
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-overlapping partitions, continued fractions, Bessel functions and a divergent series
- Dyck path enumeration
- Generalized permutation patterns and a classification of the Mahonian statistics
- Generating trees and the Catalan and Schröder numbers
- Restricted permutations