OFFSET
0,3
REFERENCES
R. P. Stanley, Enumerative Combinatorics, vol. 2 (Exercise 7.89).
LINKS
I. M. Gessel and C. Reutenauer, Counting permutations with given cycle structure and descent set, J. Combin. Theory, Ser. A, 64, 1993, 189-215.
EXAMPLE
In terms of Schur functions we have:
L[4] = s[3,1] + s[2,1,1],
L[3,1] = s[3,1] + s[2,2] + s[1,1,1,1],
L[2,2] = s[2,2] + s[1,1,1,1],
L[2,1,1] = s[3,1] + s[2,1,1],
L[4] = s[4].
There is one linear dependence relation, viz., L[4] = L[2,1,1],
so for n=4 we get the value 5-1=4.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Richard Stanley, Aug 12 2006
STATUS
approved