Skip Navigation

International Mathematics Research Papers (2005) 2005:183-236 , doi:10.1155/IMRP.2005.183
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow How to cite this article
Google Scholar
Right arrow Articles by Stembridge, J. R.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2005 Hindawi Publishing Corporation. All rights reserved.

Graded multiplicities in the Macdonald kernel. Part I

John R. Stembridge

The Macdonald kernel is a virtual character, depending on parameters q and t, for the adjoint form of a complex semisimple Lie group. At Formula, it specializes to the graded characters of the symmetric and exterior algebras of the adjoint representation; in both of these cases, the irreducible decomposition of this character is of significant interest. The Macdonald kernel may also be used to define the bilinear form relative to which the Macdonald polynomials are orthogonal, and the irreducible decomposition of the kernel may be used to compute the Macdonald polynomials explicitly. In this paper, we provide uniform recurrences for computing this irreducible decomposition, prove explicit formulas for the multiplicities of the adjoint and "short adjoint" representations (extending recent work of Bazlov), and provide an explicit formula for the denominators of the graded multiplicities (suitably normalized).


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.