Lattice walks in ${𝐙}^d$ and permutations with no long ascending subsequences.

Gessel, Ira, Weinstein, Jonathan, and Wilf, Herbert S.. "Lattice walks in and permutations with no long ascending subsequences.." The Electronic Journal of Combinatorics [electronic only] 5.1 (1998): Research paper R2, 11 p.-Research paper R2, 11 p.. <http://eudml.org/doc/119234>.

@article{Gessel1998,
author = {Gessel, Ira, Weinstein, Jonathan, Wilf, Herbert S.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {lattice walks; Toeplitz points; permutations; ascending subsequence; generating functions; Schensted algorithm},
language = {eng},
number = {1},
pages = {Research paper R2, 11 p.-Research paper R2, 11 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Lattice walks in and permutations with no long ascending subsequences.},
url = {http://eudml.org/doc/119234},
volume = {5},
year = {1998},
}

TY - JOUR
AU - Gessel, Ira
AU - Weinstein, Jonathan
AU - Wilf, Herbert S.
TI - Lattice walks in and permutations with no long ascending subsequences.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1998
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 5
IS - 1
SP - Research paper R2, 11 p.
EP - Research paper R2, 11 p.
LA - eng
KW - lattice walks; Toeplitz points; permutations; ascending subsequence; generating functions; Schensted algorithm
UR - http://eudml.org/doc/119234
ER -