Pages that link to "Item:Q1379124"
From MaRDI portal
The following pages link to Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences (Q1379124):
Displayed 6 items.
- Counting permutations with no long monotone subsequence via generating trees and the kernel method (Q536566) (← links)
- Avoidance of partitions of a three-element set (Q928779) (← links)
- Riordan matrices and higher-dimensional lattice walks (Q972838) (← links)
- On extremal permutations avoiding \(\omega_N=NN-1\dots 1\) (Q1970072) (← links)
- Decreasing subsequences in permutations and Wilf equivalence for involutions (Q2490390) (← links)
- On the distribution of the length of the longest increasing subsequence of random permutations (Q4257713) (← links)