Signatures of invariant Hermitian forms on irreducible highest weight modules

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Revised version

Scientific paper

Perhaps the most important problem in representation theory in the 1970s and early 1980s was the determination of the multiplicity of composition factors in a Verma module. This problem was settled by the proof of the Kazhdan-Lusztig Conjecture which states that the multiplicities may be computed via Kazhdan-Lusztig polynomials. In this paper, we introduce signed Kazhdan-Lusztig polynomials, a variation of Kazhdan-Lusztig polynomials which encodes signature information in addition to composition factor multiplicities and Jantzen filtration level. Careful consideration of Gabber and Joseph's proof of Kazhdan and Lusztig's inductive formula for computing Kazhdan-Lusztig polynomials leads to an inductive formula for the signed Kazhdan-Lusztig polynomials. We use these polynomials to compute the signature of an invariant Hermitian form on an irreducible highest weight module. Such a formula has applications to unitarity testing.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Signatures of invariant Hermitian forms on irreducible highest weight modules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Signatures of invariant Hermitian forms on irreducible highest weight modules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Signatures of invariant Hermitian forms on irreducible highest weight modules will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-438339

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.