Pages that link to "Item:Q536566"
From MaRDI portal
The following pages link to Counting permutations with no long monotone subsequence via generating trees and the kernel method (Q536566):
Displaying 5 items.
- An elementary solution of Gessel's walks in the quadrant (Q323719) (← links)
- A generating tree approach to \(k\)-nonnesting partitions and permutations (Q331488) (← links)
- An infinite family of inv-Wilf-equivalent permutation pairs (Q472398) (← links)
- Stieltjes moment sequences for pattern-avoiding permutations (Q2209890) (← links)
- On the number of walks in a triangular domain (Q2263779) (← links)
