Pages that link to "Item:Q1922878"

The following pages link to Classification of forbidden subsequences of length 4 (Q1922878):

Displaying 22 items.

• Some results on the avoidance of vincular patterns by multisets (Q479044) (← links)
• Counting permutations by their rigid patterns (Q696917) (← links)
• Restricted Dumont permutations, Dyck paths, and noncrossing partitions (Q860451) (← links)
• Wilf classification of three and four letter signed patterns (Q932580) (← links)
• A new class of Wilf-equivalent permutations (Q1604771) (← links)
• Explicit enumeration of 321, hexagon-avoiding permutations (Q1827678) (← links)
• Sorting with two ordered stacks in series. (Q1853525) (← links)
• Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations (Q1865264) (← links)
• Generating trees and the Catalan and Schröder numbers (Q1903733) (← links)
• Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind (Q1972357) (← links)
• Reduced word manipulation: patterns and enumeration (Q2014259) (← links)
• Set-valued Rothe tableaux and Grothendieck polynomials (Q2035997) (← links)
• Permutation patterns and cell decompositions (Q2319453) (← links)
• Nine classes of permutations enumerated by binomial transform of Fine's sequence (Q2357779) (← links)
• Finitely labeled generating trees and restricted permutations (Q2457348) (← links)
• Counting occurrences of 231 in an involution (Q2488929) (← links)
• Decreasing subsequences in permutations and Wilf equivalence for involutions (Q2490390) (← links)
• Wilf-equivalence for singleton classes (Q2643864) (← links)
• (Q5121940) (← links)
• On the centrosymmetric permutations in a class (Q5197609) (← links)
• Restricted permutations (Q5906401) (← links)
• Permutations of a multiset avoiding permutations of length 3 (Q5952148) (← links)