A symmetric functions approach to Stockhausen's problem

MaRDI QIDQ1909974zbMATH OpenFDO

Authors Lily Yen

Publication date 21 July 1996

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/118928, http://www.emis.de/journals/EJC/Volume_3/volume3.html#R7

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

sequence enumerationsymmetric functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05)

Review text

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.

Recommendations

• A Combinatorial Proof for Stockhausen's Problem
• A note on the Stockhausen problem
• Symmetric functions and P-recursiveness
• Combinatorial problems in the theory of music
• Enumerative applications of symmetric functions

Cited in

(2)

• A note on the Stockhausen problem
• scientific article; zbMATH DE number 3942598 (Why is no real title available?)

This page was built for publication: A symmetric functions approach to Stockhausen's problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1909974)