Ordinal and disjoint sums of partially ordered patterns
From MaRDI portal
Cites work
- A new class of Wilf-equivalent permutations
- Classical length-5 pattern-avoiding permutations
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Forbidden subsequences
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generating trees and the Catalan and Schröder numbers
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1404324 (Why is no real title available?)
- On (shape-)Wilf-equivalence of certain sets of (partially ordered) patterns
- On a family of conjectures of Joel Lewis on alternating permutations
- On partially ordered patterns of length 4 and 5 in permutations
- On permutation patterns with constrained gap sizes
- Partially ordered generalized patterns
- Partially ordered generalized patterns and k-ary words
- Pattern avoidance by even permutations
- Patterns in permutations and words.
- Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- Prefix exchanging and pattern avoidance by involutions
- Segmental partially ordered generalized patterns
- Shape-Wilf-equivalences for vincular patterns
- The permutations 123p₄ p_m and 321p₄ p_m are Wilf-equivalent
- Wilf-equivalence for singleton classes
This page was built for publication: Ordinal and disjoint sums of partially ordered patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353675)
