A Combinatorial Problem in the Representation Theory of SL(n)
โ Scribed by Daniel Flath, Jacob Towber
- Book ID
- 113011384
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 105 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0218-0006
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper surveys some combinatorial problems that have arisen in Music Theory, or which have been suggested by musical topics. It includes a new look at the enumeration of tone-rows and the problem of finding the number of different ways of playing the piano work 'Klaviersttick, no. 11' (1956) by
We complete the solution of a combinatorial problem concerning multisets of equivalence relations on a finite set. 2000 Academic Press f o r r=4 108 for r=8.
We continue the investigation of a combinatorial problem concerning multisets of equivalence relations on a finite set. ## 1999 Academic Press We denote the least such d by $(r, n). It is easy to see [2] that $(r, 2)=2 r&2 when r is even, while $(r, 2) is undefined when r is odd. Some other values