The following pages link to Julian West (Q185059):
Displaying 26 items.
- The Dyck pattern poset (Q394536) (← links)
- Sorting twice through a stack (Q688711) (← links)
- Forbidden subsequences and Chebyshev polynomials (Q1300970) (← links)
- A Robinson-Schensted algorithm for a class of partial orders (Q1369676) (← links)
- Posets of matrices and permutations with forbidden subsequences (Q1400804) (← links)
- Avoiding 2-letter signed patterns (Q1423008) (← links)
- A new class of Wilf-equivalent permutations (Q1604771) (← links)
- Explicit enumeration of 321, hexagon-avoiding permutations (Q1827678) (← links)
- Generating trees and the Catalan and Schröder numbers (Q1903733) (← links)
- Permutations with forbidden subsequences and nonseparable planar maps (Q1917517) (← links)
- Generating trees and forbidden subsequences (Q1924376) (← links)
- Perfect matchings for the three-term Gale-Robinson sequences (Q2380289) (← links)
- Wilf-equivalence for singleton classes (Q2643864) (← links)
- (Q2960003) (← links)
- (Q3123649) (← links)
- (Q3123650) (← links)
- (Q3123673) (← links)
- (Q3176554) (← links)
- Construction of uniform Gray codes (Q3975295) (← links)
- (Q4502547) (← links)
- (Q4591353) (← links)
- Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions (Q5404260) (← links)
- (Q5746168) (← links)
- The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent (Q5935598) (← links)
- Enumeration of permutations with restricted subsequences (Q5947480) (← links)
- Complementary algorithms for tableaux (Q5952336) (← links)
