Pages that link to "Item:Q418874"
From MaRDI portal
The following pages link to Enumeration schemes for vincular patterns (Q418874):
Displaying 16 items.
- Shape-Wilf-equivalences for vincular patterns (Q394755) (← links)
- Refining enumeration schemes to count according to permutation statistics (Q405263) (← links)
- New Wilf-equivalence results for vincular patterns (Q691587) (← links)
- Enumeration by stabilizer class of patterns with local restrictions (Q1379173) (← links)
- Using Noonan-Zeilberger functional equations to enumerate (in polynomial time!) generalized Wilf classes (Q1940420) (← links)
- Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes (Q2139103) (← links)
- Subregularity in infinitely labeled generating trees of restricted permutations (Q2155932) (← links)
- Inversion sequences avoiding consecutive patterns (Q2199820) (← links)
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers (Q2422019) (← links)
- Refining enumeration schemes to count according to the inversion number (Q2915602) (← links)
- Enumeration of strong dichotomy patterns (Q4559959) (← links)
- Consecutive patterns in inversion sequences II: avoiding patterns of relations (Q5241192) (← links)
- Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length 3 (Q5278240) (← links)
- Some Transformation Schemes Involving the Special (132)-Avoiding Permutation Patterns and a Binary Coding: An Algorithmic Approach (Q5894242) (← links)
- Some Transformation Schemes Involving the Special (132)-Avoiding Permutation Patterns and a Binary Coding: An Algorithmic Approach (Q5894410) (← links)
- Thresholds for patterns in random permutations with a given number of inversions (Q6635161) (← links)
