a symmetric functions approach to stockhausen's problem
TRANSCRIPT
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
1/15
A SYMMETRIC FUNCTIONS APPROACH
TO STOCKHAUSENS PROBLEM
Lily Yen
Department of Combinatorics and Optimization, Universityof Waterloo, Waterloo, Ontario, N2L 3G1, Canada
Submitted July 9, 1995. Accepted February 5, 1996.
We consider problems in sequence enumeration suggested by Stockhausens prob-
lem, and derive a generating series for the number of sequences of length k on n availablesymbols 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 tech-niques from the theory of symmetric functions. Each algebraic step is examined to obtaininformation for formulating a direct combinatorial construction for such sequences.
1. Introduction
The score of the piano work nr. 7 Klavierstuck XI by Karlheinz Stockhausen (1957) [S]consists of 19 fragments of music. The performer is instructed to choose at random one
of these fragments, and play it; then to choose another, different, fragment and play that,and so on. If a fragment is chosen that has already been played twice, the performanceends. We can state a more general problem as follows: Denote each fragment of music bya symbol. Then an r-Stockhausen sequence on n symbols is a sequence such that
(1) adjacent symbols are distinct,(2) the terminal symbol occurs exactly r times,(3) no symbol occurs more than r times,(4) exactly one symbol occurs r times,(5) the symbol alphabet is Nn = {1, 2, . . . , n}.
The original problem posed by Stockhausen is then the case when r = 3 and n = 19. We
shall refer to 3-Stockhausen sequences simply as Stockhausen sequences. We let cr(n, k)be the number of r-Stockhausen sequences of length k on n symbols, and
sr(n) :=
(r1)n+1k=2r1
cr(n, k),
The research for this paper was supported by the Natural Sciences and Engineering Research Councilof Canada under a postdoctoral fellowship.
Typeset by AMS-TEX
1
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
2/15
2
for the minimum (resp. maximum) length of an r-Stockhausen sequence is 2r 1 (resp.(r 1)n + 1). The expected length of a performance under the assumption that eachfragment is equally likely is given in [RY].
The method of generating series is a major technique in enumeration. In this case, thedetermination of the exact number of Stockhausen sequences on n symbols is an enumera-
tive question that can be approached using the theory of symmetric functions for coefficientextraction in the generating series approach. A generalization of the problem leads to acombinatorial construction for the Stockhausen sequences. Although only known tech-niques [G] are used, these are sophisticated, and the problem serves as a useful study ofthese techniques, and the algebraic analysis gives partial information about the formulationof a bijective proof.
The paper is organized as follows. In Section 2, we define a few classical symmetricfunctions, and state some properties they satisfy. Section 3 contains the derivation of thegenerating series for the number of Stockhausen sequences. In Section 4 we generalizethe method given in Section 3 and give an analogous derivation for the generating seriesfor the number of r-Stockhausen sequences. By examining the generating series for r-Stockhausen sequences, we give in Section 5 a series of combinatorial constructions thatleads to r-Stockhausen sequences.
2. Symmetric Functions
We review some classical symmetric functions, and recall some properties of the ring ofsymmetric functions. The reader is directed to [M] for a fuller account.
A function f(x1, x2, . . . ) in infinitely many indeterminates is a symmetric function if fis invariant under any permutation of any finite number of the variables. We shall considersuch symmetric functions over the rationals. The following symmetric functions are usedin the derivation of the generating series for cr(n, k).
The complete symmetric function hn is defined by
hn(x1, x2, . . . ) =
i1i2in
xi1xi2 xin .
Moreover, h0 = 1. If = (1, 2, . . . , k) is a partition, i. e. a non-increasing sequence ofpositive integers, we let h denote h1h2 hk . The weight of is || :=
i i.
The monomial symmetric function m is the sum of all distinct monomials of the formx1i1 x
kik
, where i1, . . . , ik are distinct.The power sum symmetric function pn is defined by
pn(x1, x2, . . . ) =i
xni .
Similar to h, p is defined to be p1p2 pk .It is known that [M] each of the sets {h}, {m}, and {p}, where ranges over all
partitions of n, is a basis of the vector space over of symmetric functions homogeneousof degree n.
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
3/15
3
Let mj() denote the number ofjs in the partition . The complete symmetric functionhn can be expressed in terms of the power sum symmetric functions as follows:
hn =n
z1()p,
wherez() =
j1
jmj()mj()!
and n indicates that is a partition ofn. For instance, h1 = p1, h2 = (p21 +p2)/2, andh3 = (p
31 + 3p2p1 + 2p3)/6.
There is [M] an inner product , defined on the vector space of symmetric functionssuch that m, h = ,, so p, p = z(), for any two partitions and , where, is 1 if = and zero otherwise. It follows that if f and g are symmetric functions,
then pnf, g = f, ngpn
, so the action adjoint to multiplication by pn is npn
.
For any partition , let l() denote the number of parts of . Then the number ofmonomials on n ( l()) symbols of the form x1i1 xl()il()
, where i1, . . . , il() are distinct,
is(2.1)
n!
(n l())! m1()! m2()! m1()!= m(1, . . . , 1
n 1s
, 0, . . . ) =(n)l()
m1()! m2()! m1()!,
where (n)j = n(n 1) (n j + 1) denotes the jth falling factorial.The following proposition is needed and can be regarded as the adjoint form of Taylors
Theorem on the ring of symmetric functions.
Proposition 2.1. Letf and g be symmetric functions and u a real number, and supposethat f = f(p1, p2, . . . ). Then
f(p1, p2, . . . ), eupjg = f(p1, p2, . . . , pj1, pj +ju, pj+1, pj+2, . . . ), g.
Proof. We use the adjoint action to multiplication by pj ,
f(p1, p2, . . . ), eupj g =
k0
uk
k!
jk
k
pkjf(p1, p2, . . . ), g
= k0
(uj)k
k!k
pkjf(p1, p2, . . . ), g
=
exp
ju
pj
f(p1, p2, . . . ), g
= f(p1, p2, . . . , pj +ju, . . . ), g
using the formal version of Taylors Theorem.
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
4/15
4
3. A solution for the original problem
We derive a generating series for the number c3(n, k) of Stockhausen sequences on nsymbols of length k. To reach this goal, we begin with the generating series for sequencessatisfying condition (1) for Stockhausen sequences (Lemma 3.1), then we derive the gener-ating series of sequences satisfying conditions (1) and (2) for r = 3 (Proposition 3.2); andfinally we address the generating series for Stockhausen sequences by imposing appropriaterestrictions in order to satisfy conditions (3) and (4).
Lemma 3.1. The generating series for all strings on n symbols such that adjacent symbolsare different is
D(z, x1, . . . , xn) =1
1 ni=1zxi
1+zxi
,
where z is an ordinary marker for the length of the string and xi marks the occurrence ofsymbol i.
See [RY,2] for a proof.
Proposition 3.2. Let Dn(z, x1, . . . , xn) be the generating series of sequences on the sym-bols {1, 2, . . . , n} (marked by x1, . . . , xn) of length k (marked by z) such that the terminalsymbol occurs exactly three times (non-terminal symbols occur arbitrarily many times) andadjacent symbols are distinct. Then
Dn(z, x1, . . . , xn) = z3
nj=1
x3j
ni=1i=j
zxi1+zxi
2
1 ni=1i=j
zxi1+zxi
3 .
Proof. Consider such a sequence which terminates with the symbol j. The sequence de-composes into AjBjBj, where A, B, and B are strings on the symbols {1, 2, . . . , n} \ {j}with distinct adjacent elements, A possibly empty but B and B non-empty. By Lemma3.1, the generating series for all such sequences is
z3x3jLw1
1 wni=1i=j
zxi1+zxi
,
where Lw is the linear transform defined by
Lwf(w) =1
2!
2f
w2 w=1 .
Although we introduce Lw here to simplify the expression for the generating series, it willbe seen later that it has combinatorial significance. To get the sequences described in thestatement, we take the union over j, and so, summing the above generating series over jwe obtain
Dn = z3nj=1
x3jLw1
1 wni=1i=j
zxi1+zxi
.
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
5/15
5
We remark that a very easy direct proof is possible, but Lw is introduced in order to
illustrate how its counterpart, L(r)w , will be used in Section 4, where for r > 3, this linear
transform helps in carrying out the calculations with symmetric functions.To restrict the frequency of occurrence of symbols, we let P3 be the set of all partitions
with exactly one 3 as the largest part. For in P3, let x denote x11 x22 and let [x
]f
denote the coefficient of x in f; then
[x]Dn = [x]z3p3Lw
1
1 w(zp1 z2p2)
for the power sums p1, p2, p3 in x1, x2, . . . , xn.Let
(3.1) G(z, x1, . . . , xn) = z3p3Lw
1
1 w(zp1 z2p2),
where p1, p2, and p3 are power sum symmetric functions in infinitely many indeterminates.
Then[x]Dn = [x
]G(z, x1, x2, . . . , xn, 0, 0, . . . ).
Therefore the generating series for the set of all Stockhausen sequences on n symbols is
Fn(z, x1, . . . , xn) =P3
[x]G(z, x1, x2, . . . , xn, 0, 0, . . . ),
where the inner sum is over all distinct permutations of .The sequences defined in the statement of Proposition 3.2 satisfy conditions (1) and
(2). Conditions (3) and (4) are imposed by the restriction that all partitions are in P3.
The last condition is imposed by evaluating G with xn+1 = xn+2 = = 0 to excluden + 1, n + 2, . . . from the alphabet, and by the sum over so that each element of thealphabet Nn is permitted to occur.
Since G is a symmetric function in the xis, we may expand it in terms of the monomialsymmetric functions:
G =P3
m(x1, x2, . . . )az||,
where the as are scalars.Then another way of expressing Fn is
Fn = P3
m(1, 1, . . . , 1 n
, 0, 0, . . . )[m]G = P3
(n)l()
m1()! m2()! az||
,
because from (2.1) m(1, 1, . . . , 1 n
, 0, 0, . . . ) is the number of terms in the monomial symmet-
ric function m on x1, x2, . . . , xn, which is equal to the number of sequences over {0, 1, 2, 3}of length n with n l() occurrences of 0, m1() occurrences of 1, m2() occurrences of2 and one occurrence of 3 (as specified by P3).
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
6/15
6
We use the property m, h = , of the inner product to extract the coefficient ofm in G. In order to have m1()! and m2()! in the denominator and one part of size 3in , we consider
uh3eu(h1+h2) =
P3h
ul()
m1()! m2()!.
Clearly, G,uh3e
u(h1+h2)
=P3
ul()
m1()! m2()!az
||.
With the help of the mapping n : uj (n)j , for j = 0, 1, 2, . . . , extended linearly to the
power series ring in u, we obtain
Fn =k0
c3(n, k)zk = n
G, uh3e
u(h1+h2)
.
We are now in a position to work on 3(z, u) :=n Fn(z)u
n/n!, our goal for thissection.
Lemma 3.3. Let c be independent of u. Then neucuk = (n)k(1 + c)nk. If, moreover,g(u) = 1 + g1u + g2u
2 + is a power series in u, then neucg(u) =
un
n!
eu(1+c)g(u).
Proof. The first statement follows from direct computation. Now
neucg(u) = n
k0
eucgkuk =
k0
gk (n)k(1 + c)nk =
nk=0
gkn!
(nk)! (1 + c)nk,
and the second statement follows. Note that (n)k = 0 if n < k .
It now follows that the generating series for c3(n, k) is
Corollary 3.4.
3(z, u) :=k,n0
c3(n, k)zk un
n! = euG,uh3e
u(h1+h2).
Proof. We know that
k0
c3(n, k)zk = G, nuh3e
u(h1+h2) = G,
un
n!
euuh3e
u(h1+h2)
by Lemma 3.3. Since G is independent of u, the last expression isun
n!
G, euuh3e
u(h1+h2) =
un
n!
euG,uh3e
u(h1+h2).
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
7/15
7
It follows that
3(z, u) = euG,uh3e
u(h1+h2).
To evaluate the inner product, we expand G and uh3eu(h1+h2) in terms of the power
sums, and use the property p, p = z(), of the inner product, the adjoint action tomultiplication by pj , and Taylors Theorem on the ring of symmetric functions. We knowthat upon substitution of G using (3.1)
3(z, u) = eu
Lw
z3p31 w(zp1 z2p2)
,u
6(p31 + 3p2p1 + 2p3)e
u(p1+(p21+p2)/2)
by linearity of , and ignoring terms in the second argument that are independent of p3,we get
= Lweu
z3p3
1 w(zp1 z2p2),
u
3p3eu(p1+(p
21+p2)/2)
by adjoint action of p3, we have
= Lweu
z3
1 w(zp1 z2p2), ueu(p1+(p
21+p2)/2)
using Proposition 2.1 we obtain
= Lweu
z3
1 w(z(p1 + u) z2(p2 + u)), ueup
21/2
again by the property of the inner product we ignore terms in the first argument indepen-dent of p1 and reach
= Lweu z3
1 wzu + wz2u wzp1 , ueup2
1/2 .
Since
1
1 wzu + wz2u wzp1=j0
(wzp1)j
(1 wzu + wz2u)j+1,
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
8/15
8
we have that
3(z, u) = z3ueuLw
j0
(wz)j
(1 wzu + wz2u)j+1
pj1, eup21/2
= z3
ueu
Lwj0
(wz)2j
(1 wzu + wz2u)2j+1p2j1 , eup21/2
= z3ueuLwj0
(wz)2j
(1 wzu + wz2u)2j+1
p2j1 , uj p
2j1
2jj!
= z3ueuLwj0
uj(wz)2j
(1 wzu + wz2u)2j+1(2j)!
2jj!.
We summarize the result in the following.
Proposition 3.5. LetL(r)w (f(w)) =
1
r!
rf
wr w=1, then
3(z, u) = z3ueuLw
j0
uj(wz)2j
(1 wzu + wz2u)2j+1(2j)!
2jj!.
We remark that the original Stockhausen number s3(n) isun
n!
3(1, u) =
un
n!
12 ueuj0
(2j)(2j 1)(2j)!
2jj!uj ,
so
s3(n) = nn1j=0
n 1j
2j2
(2j)!2j
.
A direct combinatorial proof of this expression is given in [RY].
4. A generating series for r-Stockhausen sequences
We use the method suggested by the previous section to derive a generating series forr-Stockhausen sequences.
Theorem 4.1. Let
r(z, u) := n,k0 cr(n, k)zkun
n!
be the generating series for the number cr(n, k) of sequences of length k on n symbols suchthat adjacent symbols are distinct, the terminal symbol occurs exactly r times, and all othersymbols occur at most r 1 times. Then
r(z, u) = uzrL(r1)w w exp
u[tr1]
ewzt/(1+zt)
1 t
,
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
9/15
9
where z is the ordinary marker for the length of the sequence, u is the exponential marker
for the number of available symbols, L(r)w (f(w)) =
1r!rfwr
w=1
and w is the inverse
Laplace transform w : wj j! wj.
We may take advantage of the analysis of the original problem (when r = 3).
Proof. Let
Fn,r := zrpr
j1(1)
j1zjpjr1
1
j1(1)
j1zjpjr .
Thencr(n, k) = [z
k]n
Fn,r, uhreu(h1+h2++hr1)
.
Now
Fn,r = zrL(r1)w pr
1 w
j1
(1)j1zjpj1
,
andk0
cr(n, k)zk = nz
rL(r1)w
pr
1 w
j1
(1)j1zjpj1
, uhreu(h1+h2++hr1)
=
un
n!
zrL(r1)w
pr
1 wj1
(1)j1zjpj1
, uhreu(1+h1+h2++hr1)
=
un
n!
r(z, u),
by definition. So
(4.1) r(z, u) = uzrL(r1)w
pr
1 wj1
(1)j1zjpj1
, hreu(1+h1+h2++hr1)
.
In order to extract the coefficients from (4.1), we perform some technical maneuvers usingthe properties of symmetric functions stated in Section 2.
It is convenient for expository purposes to isolate these into a series of steps.Step 1. Apply the adjoint action to multiplication by pj to remove pj from the first
argument of the inner product.Since hr =
Pz
1()p, where z() = 1m1()m1()! 2
m2()m2()! , it follows
that hrpr =1r . Also, e
u(1+h1++hr1) expanded in terms of the power sums using the
formula above is independent of pr, so
r = uzrL(r1)w
1 wj1
(1)j1zjpj
1 , eu(1+h1++hr1)
= uzrL(r1)w
1,
1 w
j1
(1)j1zjj
pj
1 eu(1+h1++hr1)
.
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
10/15
10
Step 2. Introduce the mapping w : wj j! wj to express
1 w
j1
(1)j1zjj
pj
1
as an exponential function, and hj s in terms of the power sums so that the ring theoreticTaylors Theorem can be used.
Since
1 wj1(1)
j1zjpj
1= we
w
j1(1)j1zjpj ,
r = uzrL(r1)w w
1, ew
j1(1)j1zjj
pj eu(1+h1++hr1)
The generating series for the complete symmetric functions isk0 hkt
k =i=1(1
txi)1, so
1 + h1 + + hr1 = [tr1]
11 t
i=0
(1 txi)1
= [tr1]1
1 texp
i1
ln(1 txi)1
= [tr1]1
1 tep1t+p2t
2+.
Thus eu(1+h1++hr1) = exp
u[tr1]e
p1t+p2t2
2+
1t
.
Step 3. Apply Taylors Theorem to get
r = uzrL(r1)w w
1, ew
j1(1)j1zjj pj exp
u[tr1]
ep1t+p2t2
2 +
1 t
= uzrL(r1)w w
1, exp
u[tr1]
e(wt+p1)+(2wz2+p2)
t2
2 +
1 t
= uzrL(r1)w w
1, exp
u[tr1]
ewztwz2t2+
1 t
since the inner product is with 1, all pi, i 1, are set to 0 in the second argument of theinner product.
We conclude that r = uzrL
(r1)w w exp
u[tr1]e
wzt/(1+zt)
1t
.
We remark that the exponential ewzt/(1+zt) is the generating function for Laguerrepolynomials. A short proof of the r-Stockhausen problem that is inspired by this analysisis given in [RY, 5]. An explicit formula derived from this expression for the number ofr-Stockhausen sequences and a direct combinatorial proof are given in [Y].
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
11/15
11
5. Combinatorial constructions
We have shown that the generating series for generalized Stockhausen sequences is
r+1(z, u) := n,k0 cr+1(n, k)zk un
n!
= uzr+1L(r)w w exp
u[tr]
1
1 texp
wzt
1 + zt
,
where
L(r)w (f) =1
r!
wrrf
wr
w=1
and w : wk k!wk.The combinatorial nature of the transformations leads one to ask whether combinatorial
objects and constructions exist for each expression so that one can obtain generalized
Stockhausen sequences directly. In this section, we present a series of constructions thathas generalized Stockhausen sequences as the final consequence. The set-wise actionsof the constructions are suggested by the algebraic analysis, although the element-wiseactions (the combinatorial content) have to be supplied. Therefore we define first the setA generated by
A =1
1 w(ni=1zti
1+zti)
,
which is a fundamental structure in the series of constructions. Next, we convert theunivariate series in t into a multivariate series in t1, t2, . . . , tn to obtain n non-terminalsymbols in the Stockhausen sequences. To this end, we exhibit a bijection between sets
which are enumerated by un
n!
w exp
u[tr]
1
1 texp
wzt
1 + zt
and
[tr1tr2 . . . trn]
1
1 w(ni=1zti
1+zti)
ni=1
1
1 ti.
Once we have all n non-terminal symbols, we give a combinatorial interpretation for the
transformation L(r)w . After the application of L
(r)w to A, the last step is the placement of
r + 1 copies of the terminal symbol to make (r + 1)-Stockhausen sequences.
Step 1. Signed Divided Strings. To construct strings with distinct adjacent elements,an argument involving the principle of inclusionexclusion can be applied. However, onecan also consider signed sets as described in [SW]. The set of signed divided strings is asigned set of strings with dividers such that
(1) different symbols are separated by dividers,(2) the same symbol appearing in a block may be separated by dividers,
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
12/15
12
(3) no dividers are adjacent, and no string ends with a divider,(4) the sign of the string is
(1)# (undivided even sub-strings).
An example of a typical signed divided string is +t1t1wt1wt2t2wt3wt1, where w marks thedivider and t1, t2 and t3 are symbols.
Let A be the set of strings on n symbols such that a non-empty string begins with adivider. Let the symbols be zt1, zt2, . . . , z tn, and let w be an ordinary marker for dividers.Then the ordinary generating series for A is
A(w,z,t1, . . . , tn) =1
1 w(ni=1zti
1+zti)
.
Step 2. A Bijection. We define sets generated by
[tr1tr2 . . . trn]
1
1 w(ni=1zti
1+zti)
ni=1
1
1 ti,
and un
n!
w exp
u[tr ]
1
1 texp
wzt
1 + zt
,
and show a bijection between the sets. From the previous section, the series
A(w,z,t1
, . . . , tn
) =1
1 w(ni=1 zti1+zti )generates all, possibly empty, signed divided strings where a non-empty string beginswith a divider marked by w. The multiplication of A by
ni=1
11ti
and the extractionof the coefficient of tr1t
r2 trn in the result corresponds at the set theoretic level to the
concatenation of the signed divided strings in A with ti11 ti22 tinn for 0 i1, i2, . . . , in and
the restriction to only those concatenated strings with exactly r tis, i = 1, 2, . . . , n. Butthis is equivalent to considering the strings in A with no more than r tis for i = 1, 2, . . . , n.Thus we conclude that
[tr1tr2 . . . trn] 11 w(ni=1zti
1+zti)
ni=1
11 ti
generates all signed divided strings ( A) with no more than r tis (i = 1, . . . , n) in eachstring.
For un
n!
w exp
u[tr ]
1
1 texp
wzt
1 + zt
,
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
13/15
13
or equivalently,
w
[tr]
1
1 texp
wzt
1 + zt
n,
where w is an inverse Laplace transform on w, i. e. w : wk k! wk, we describe a set
generated by the inner expression[tr]
1
1 texp
wzt
1 + zt
nfirst, and then apply w combinatorially to the set.
Consider a labelled ordered n-tuple (S1, S2, . . . , S n) of possibly empty, ordered sets ofall possible sizes. That is, given a label set ( N := {1, 2, . . . }) of size n, label S1 with thesmallest label, S2 with the next label, etc, and Sn with the largest one. Every coordinatein Si, i Nn, is also labelled from a label set N in the same way. A typical entry of Sihas the form (1)k+1wx(zt)k (k 1), where x is the label associated with that entry of
Si. Let w be an exponential marker for the labels wxs. When we restrict the number ofts in each Si to no more than r, then the generating series for Si is
[tr]1
1 t
w|Si|
|Si|!
zt
1 + zt
|Si|.
Summing over all |Si| from 0 to , we get[tr]
1
1 texp
wzt
1 + zt
n
as the generating series for the n tuple of tuples. To apply w, or inverse Laplace transform,i. e. removal of labels marked by w, we form signed divided strings in the following way.Take the entry in some Sx that has the label w1, and put down the entire entry includingits sign as the first segment, w1ztizti zti writing ti instead of t if the set Sx has thesymbol i assigned to it. In the second segment, find some set Sy that contains w2, andwrite w2ztj . . . z tj if Sy has symbol j assigned to it. Continue in a similar manner untilthe ws are exhausted. Now combine the signs multiplicatively and erase the subscripts onw to get a signed divided string on n available symbols because there are n Sxs, such thatevery ti appears no more than r times (since we start out with r or fewer ts in each Sx).
Step 3. Application of L(r)w . Let B be the set of non-empty strings on n symbols such
that a non-empty string begins without a divider. Let the symbols be zx1, zx2, . . . , z xn,and let w be an ordinary marker for dividers. Then the ordinary generating series for B is
B(w,z,x1, . . . , xn) =
ni=1zxi
1+zxi
1 w(ni=1zxi
1+zxi)
.
Let be a divider. Define r ( )r/r (see [GJ, p.36]) to be an operation on the
elements of the sets A (as defined in Step 1) and B that marks r distinct dividers in all
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
14/15
14
possible ways regardless of the order in which dividers are marked. (Here r denotes thesymmetric group on r elements.) Then
(r (
)r/r)A
A BB wB r Bs
by induction on r, since
A
AB and
B
BB.
Notice that A(1, zx1, . . . , z xn) (respectively B(1, zx1, . . . , z xn)) is the ordinary generatingseries for possibly empty (respectively non-empty) strings on n symbols zx1, . . . , z xn such
that adjacent symbols are distinct. Therefore, the operator L(r)w applied to A gives the
generating series for (
A,
B, . . . ,
B) with r
Bs, where
A (respectively
B) is the result ofignoring dividers in the set A (respectively B). This is an (r +1)-tuple of strings such thatadjacent symbols are distinct, and the first string (but no others) may be empty.
In short, the purpose ofL(r)w is first to mark s and secondly get rid of strings that have
at least one undivided sub-string of length greater than or equal to 2 (by setting w = 1algebraically or ignoring dividers, s, set theoretically).
Step 4. Placement of the terminal symbol. Given n + 1 symbols such that theterminal symbol occurs r + 1 times, let u be an exponential marker for the availablesymbols, z be an ordinary marker for the length of the string, and t1, . . . , tn be ordinarymarkers for the occurrence of the non-terminal symbols, then
uzr+1L(r)w w exp
u[tr]
1
1 texp
wzt
1 + zt
is the generating series for T S (see [GJ, p. 163] for the definition of ), where T is theset containing r + 1 copies of the terminal symbol t, and S is (A|w=1, B|w=1, . . . , B|w=1)with r Bs. The product is used because the symbols t, t1, . . . , tn form the label set{1, 2, . . . , n , n + 1}. To obtain Stockhausen sequences from T S, place zt in front of eachB, and at the final position, then remove all commas, and let z commute with the ts.Therefore, z marks the length of the string, and the string is faithfully represented by the
ts.
Acknowledgements
The author would like to thank L. Butler and D. M. Jackson for teaching her the theoryof symmetric functions and D. M. Jackson for guiding her through the symmetric maze,and comments that have improved the presentation of the paper. The author would alsolike to thank the reviewer for many helpful suggestions.
-
7/28/2019 A SYMMETRIC FUNCTIONS APPROACH TO STOCKHAUSEN'S PROBLEM
15/15
15
References
[G] I. Gessel, Symmetric functions and P-recursiveness, J. Combinatorial Theory 53 (1990), 257285.[GJ] I. P. Goulden & D. M. Jackson, Combinatorial Enumeration, Wiley Interscience, New York, 1983.[M] I. G. Macdonald, Symmetric Functions and Hall Polynomials, Edition 1, Clarendon Press, Oxford,
1979.
[RY] R. C. Read & L. Yen, A Note on The Stockhausen Problem, J. Combin. Theory Ser. A (to appear).[SW] D. Stanton & D. White, Constructive Combinatorics, Undergraduate Texts in Mathematics, Sprin-ger-Verlag, New York, 1986.
[S] K. Stockhausen, nr. 7 Klavierstuck XI, 12654 LW, Universal Edition, London, 1979.
[Y] L. Yen, A direct combinatorial proof for Stockhausens problem, Research Report, University ofWaterloo, Dept. of Combinatorics & Optimization (1995), pp. 7.