Pages that link to "Item:Q867909"
From MaRDI portal
The following pages link to Permutations and words counted by consecutive patterns (Q867909):
Displaying 18 items.
- A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern (Q394208) (← links)
- Consecutive up-down patterns in up-down permutations (Q405276) (← links)
- Consecutive pattern avoidances in non-crossing trees (Q607683) (← links)
- Generating functions for permutations avoiding a consecutive pattern (Q659579) (← links)
- The \(q\)-exponential generating function for permutations by consecutive patterns and inversions (Q857426) (← links)
- Introduction to partially ordered patterns (Q881572) (← links)
- The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 (Q976157) (← links)
- Wilf equivalence relations for consecutive patterns (Q1637600) (← links)
- Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics (Q1755656) (← links)
- Clusters, generating functions and asymptotics for consecutive patterns in permutations (Q1761477) (← links)
- Generalized pattern-matching conditions for \(C_k \wr S_n\) (Q1952724) (← links)
- Generalized pattern avoidance condition for the wreath product of cyclic groups with symmetric groups (Q1952733) (← links)
- Cyclic pattern containment and avoidance (Q2078930) (← links)
- Increasing consecutive patterns in words (Q2304195) (← links)
- Counting pattern avoiding permutations by number of movable letters (Q3390785) (← links)
- Visibility in pattern-restricted permutations (Q4991426) (← links)
- The combinatorics of Jeff Remmel (Q5056195) (← links)
- Consecutive patterns in Catalan words and the descent distribution (Q6133614) (← links)