The following pages link to Alexander Burstein (Q640472):
Displaying 31 items.
- A short proof for the number of permutations containing pattern 321 exactly once (Q640473) (← links)
- The Möbius function of separable and decomposable permutations (Q640846) (← links)
- On the distribution of some Euler-Mahonian statistics (Q746826) (← links)
- Restricted Dumont permutations, Dyck paths, and noncrossing partitions (Q860451) (← links)
- Packing sets of patterns (Q1041198) (← links)
- Words restricted by 3-letter generalized multipermutation patterns (Q1400799) (← links)
- Packing patterns into words (Q1422121) (← links)
- A lattice path approach to counting partitions with minimum rank \(t\) (Q1598837) (← links)
- Words restricted by patterns with at most 2 distinct letters (Q1856065) (← links)
- Pattern statistics in faro words and permutations (Q2032888) (← links)
- Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization (Q2155548) (← links)
- Two examples of unbalanced Wilf-equivalence (Q2345766) (← links)
- On some properties of permutation tableaux (Q2427011) (← links)
- A geometric form for the extended patience sorting algorithm (Q2490023) (← links)
- Restricted Dumont permutations (Q2571018) (← links)
- Combinatorics of patience sorting piles (Q2654575) (← links)
- (Q2915604) (← links)
- Total occurrence statistics on restricted permutations (Q2937643) (← links)
- (Q3077340) (← links)
- (Q3077341) (← links)
- (Q3084743) (← links)
- (Q3084749) (← links)
- (Q4355048) (← links)
- (Q4483919) (← links)
- (Q4584073) (← links)
- (Q4591326) (← links)
- Enumeration of Dumont permutations avoiding certain four-letter patterns (Q5074772) (← links)
- Pseudo-involutions in the Riordan group (Q5080341) (← links)
- The solution of a recursive sequence arising from a combinatorial problem in botanical epidemiology (Q5301071) (← links)
- On Unavoidable Sets of Word Patterns (Q5470765) (← links)
- (Q5883636) (← links)
