Geodesic
A symmetric functions approach to Stockhausen's problem
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We consider problems in sequence enumeration suggested by Stockhausen's problem, and derive a generating series for the number of sequences of length $k$ on $n$ available symbols such that adjacent symbols are distinct, the terminal symbol occurs exactly $r$ times, and all other symbols occur at most $r-1$ times. The analysis makes extensive use of techniques from the theory of symmetric functions. Each algebraic step is examined to obtain information for formulating a direct combinatorial construction for such sequences.
DOI : 10.37236/1231
Classification : 05A15, 05E05
Mots-clés : sequence enumeration, symmetric functions 
@article{10_37236_1231,
     author = {Lily Yen},
     title = {A symmetric functions approach to {Stockhausen's} problem},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {1},
     doi = {10.37236/1231},
     zbl = {0852.05007},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1231/}
}
TY  - JOUR
AU  - Lily Yen
TI  - A symmetric functions approach to Stockhausen's problem
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1231/
DO  - 10.37236/1231
ID  - 10_37236_1231
ER  - 
%0 Journal Article
%A Lily Yen
%T A symmetric functions approach to Stockhausen's problem
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1231/
%R 10.37236/1231
%F 10_37236_1231
Lily Yen. A symmetric functions approach to Stockhausen's problem. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1231

Cité par Sources :