A symmetric functions approach to Stockhausen's problem (Q1909974)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A symmetric functions approach to Stockhausen's problem |
scientific article; zbMATH DE number 861595
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A symmetric functions approach to Stockhausen's problem |
scientific article; zbMATH DE number 861595 |
Statements
A symmetric functions approach to Stockhausen's problem (English)
0 references
21 July 1996
0 references
Summary: 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.
0 references
sequence enumeration
0 references
symmetric functions
0 references
0.7968366146087646
0 references
0.7776376008987427
0 references
0.7399332523345947
0 references
0.7133594751358032
0 references
0.7079443335533142
0 references
