Lattice walks in Z^ d and permutations with no long ascending subsequences
zbMATH Open0885.05010MaRDI QIDQ1379124FDOQ1379124
Authors: Ira M. Gessel, Jonathan Weinstein, Herbert S. Wilf
Publication date: 18 February 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119234
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
permutationsgenerating functionslattice walksascending subsequenceSchensted algorithmToeplitz points
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)