Asymptotics of the number of $k$-words with an $l$-descent.

Regev, Amitai. "Asymptotics of the number of -words with an -descent.." The Electronic Journal of Combinatorics [electronic only] 5.1 (1998): Research paper R15, 4 p.-Research paper R15, 4 p.. <http://eudml.org/doc/119509>.

@article{Regev1998,
author = {Regev, Amitai},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {words; -descent; Young tableau; Schensted-Knuth; -descent},
language = {eng},
number = {1},
pages = {Research paper R15, 4 p.-Research paper R15, 4 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Asymptotics of the number of -words with an -descent.},
url = {http://eudml.org/doc/119509},
volume = {5},
year = {1998},
}

TY - JOUR
AU - Regev, Amitai
TI - Asymptotics of the number of -words with an -descent.
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 R15, 4 p.
EP - Research paper R15, 4 p.
LA - eng
KW - words; -descent; Young tableau; Schensted-Knuth; -descent
UR - http://eudml.org/doc/119509
ER -