We introduce the notion of cyclic tableaux and develop involutions for Waring's formulas expressing the power sum symmetric function pn in terms of the elementary symmetric function en and the homogeneous symmetric function hn. The coefficients appearing in Waring's formulas are shown to be a cyclic analog of the multinomial coefficients, a fact that seems to have been neglected before. Our involutions also spell out the duality between these two forms of Waring's formulas, which turns out to be exactly the “duality between sets and multisets.” We also present an involution for permutations in cycle notation, leading to probably the simplest combinatorial interpretation of the Mobius function of the partition lattice and a purely combinatorial treatment of the fundamental theorem on symmetric functions. This paper is motivated by Chebyshev polynomials in connection with Waring's formula in two variables.
[1]
G. Rota,et al.
On the foundation of combinatorial theory. X : A categorical setting for symmetric functions
,
1992
.
[2]
I. G. MacDonald,et al.
A new class of symmetric functions.
,
1988
.
[3]
J. D. Louck.
Trace formulas for a rigid asymmetric rotator-type Hamiltonian
,
1963
.
[4]
Gian-Carlo Rota,et al.
Baxter algebras and combinatorial identities. II
,
1969
.
[5]
Symmetric Functions and Symmetric Species
,
1986
.
[6]
William Y. C. Chen,et al.
Context-Free Grammars, Differential Operators and Formal Power Series
,
1993,
Theor. Comput. Sci..
[7]
P. Doubilet,et al.
On the Foundations of Combinatorial Theory. VII: Symmetric Functions through the Theory of Distribution and Occupancy
,
1972
.