Geometric approaches to computing Kostka numbers and Littlewood-Richardson coefficients
Author(s)
Rassart, Étienne, 1975-
DownloadFull printable version (1.033Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Mathematics.
Advisor
Sara Billey.
Terms of use
Metadata
Show full item recordAbstract
Using tools from combinatorics, convex geometry and symplectic geometry, we study the behavior of the Kostka numbers and Littlewood-Richardson coefficients (the type A weight multiplicities and Clebsch-Gordan coefficients). We sh w that both are given by piecewise polynomial functions in the entries of the partitions and compositions parametrizing them, and that the domains of polynomiality form a complex of cones. Interesting factorization patterns are found in the polyomials giving the Kostka numbers. The case of A3 is studied more carefully and involves computer proofs. We relate the description of the domains of polynomiality for the weight multiplicity function to that of the domains for the Duistermaat-Heckman measure from symplectic geometry (a continuous analogue of the weight multiplicity function). As an easy consequence of this work, one obtains simple proofs of the fact the Kostka numbers, and Littlewood-Richardson numbers are given by polynomial functions in the nonnegative integer variable N. Both these results were known previously but have non-elementary proofs involving fermionic formulas for Kostka-Foulkes polynomials and semi-invariants of quivers. Also investigated is a new q-analogue of the Kostant partition function, which is shown to be given by polynomial functions over the relative interiors of the cells of a complex of cones. (cont.) It arises in the work of Guillemin, Sternberg and Weitsman on quantization with respect to the signature Dirac operator, where they give a formula for the multiplicities of weights in representations associated to twisted signatures of coadjoint orbits which is very similar to the Kostant multiplicity formula, but involves the q = 2 specialization of this q-analogue. We give an algebraic proof of this results, find an analogue of the Steinberg formula for these representations and, in type A, find a branching rule which we can iterate to obtain an analogue of Gelfand-Tsetlin theory.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004. Includes bibliographical references (p. 119-125). This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Date issued
2004Department
Massachusetts Institute of Technology. Department of MathematicsPublisher
Massachusetts Institute of Technology
Keywords
Mathematics.