Lattice walks in Z^ d and permutations with no long ascending subsequences
From MaRDI portal
Publication:1379124
Recommendations
Cited in
(11)- Avoidance of partitions of a three-element set
- Riordan matrices and higher-dimensional lattice walks
- Counting signed vexillary permutations
- Exact solution of some quarter plane walks with interacting boundaries
- On extremal permutations avoiding \(\omega_N=NN-1\dots 1\)
- Counting permutations with no long monotone subsequence via generating trees and the kernel method
- Stieltjes moment sequences for pattern-avoiding permutations
- Decreasing subsequences in permutations and Wilf equivalence for involutions
- Bijections for Weyl chamber walks ending on an axis, using arc diagrams and Schnyder woods
- On the distribution of the length of the longest increasing subsequence of random permutations
- Enumerating \(r\)c-invariant permutations with no long decreasing subsequences
This page was built for publication: Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379124)