Geodesic
Asymptotics of the number of \(k\)-words with an \(l\)-descent
The electronic journal of combinatorics, Tome 5 (1998)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The number of words $w = w_1\cdots w_n$, $1 \leq w_i \leq k$, for which there are $1 \leq i_1 < \cdots < i_{\ell} \leq n$ and $w_{i_1} > \cdots > w_{i_{\ell}}$, is given, by the Schensted-Knuth correspondence, in terms of standard and semi-standard Young tableaux. When $n \to \infty$, the asymptotics of the number of such words is calculated.
DOI : 10.37236/1353
Classification : 05E10, 05A16
Mots-clés : words, \(l\)-descent, Young tableau, Schensted-Knuth 
@article{10_37236_1353,
     author = {Amitai Regev},
     title = {Asymptotics of the number of \(k\)-words with an \(l\)-descent},
     journal = {The electronic journal of combinatorics},
     year = {1998},
     volume = {5},
     doi = {10.37236/1353},
     zbl = {0892.05051},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1353/}
}
TY  - JOUR
AU  - Amitai Regev
TI  - Asymptotics of the number of \(k\)-words with an \(l\)-descent
JO  - The electronic journal of combinatorics
PY  - 1998
VL  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1353/
DO  - 10.37236/1353
ID  - 10_37236_1353
ER  - 
%0 Journal Article
%A Amitai Regev
%T Asymptotics of the number of \(k\)-words with an \(l\)-descent
%J The electronic journal of combinatorics
%D 1998
%V 5
%U http://geodesic.mathdoc.fr/articles/10.37236/1353/
%R 10.37236/1353
%F 10_37236_1353
Amitai Regev. Asymptotics of the number of \(k\)-words with an \(l\)-descent. The electronic journal of combinatorics, Tome 5 (1998). doi: 10.37236/1353

Cité par Sources :