Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences

zbMath0885.05010MaRDI QIDQ1379124

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

zbMATH Keywords

permutationsgenerating functionslattice walksascending subsequenceSchensted algorithmToeplitz points

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (11)

On the distribution of the length of the longest increasing subsequence of random permutations ⋮ Bijections for Weyl chamber walks ending on an axis, using arc diagrams and Schnyder woods ⋮ Stieltjes moment sequences for pattern-avoiding permutations ⋮ Counting signed vexillary permutations ⋮ Avoidance of partitions of a three-element set ⋮ On extremal permutations avoiding \(\omega_N=NN-1\dots 1\) ⋮ Enumerating \(r\)c-invariant permutations with no long decreasing subsequences ⋮ Counting permutations with no long monotone subsequence via generating trees and the kernel method ⋮ Riordan matrices and higher-dimensional lattice walks ⋮ Decreasing subsequences in permutations and Wilf equivalence for involutions ⋮ Exact solution of some quarter plane walks with interacting boundaries

This page was built for publication: Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences