Michele D'Adderio

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper we give a new combinatorial proof of a result of Littlewood [3]: Sμ(1, q, q , . . . ) = q n(μ) Q s∈μ(1−q μ) , where Sμ denotes the Schur function of the partition μ, n(μ) is the sum of the legs of the cells of μ and h(μ)(s) is the hook number of the cell s ∈ μ. Research supported in part by NSF grant DMS-0500557 Research supported in part by(More)
  • 1