Computer Science – Computational Complexity
Scientific paper
2007-09-05
Computer Science
Computational Complexity
71 pages, changed content
Scientific paper
This article gives conjecturally correct algorithms to construct canonical bases of the irreducible polynomial representations and the matrix coordinate rings of the nonstandard quantum groups in GCT4 and GCT7, and canonical bases of the dually paired nonstandard deformations of the symmetric group algebra therein. These are generalizations of the canonical bases of the irreducible polynomial representations and the matrix coordinate ring of the standard quantum group, as constructed by Kashiwara and Lusztig, and the Kazhdan-Lusztig basis of the Hecke algebra. A positive ($#P$-) formula for the well-known plethysm constants follows from their conjectural properties and the duality and reciprocity conjectures in \cite{GCT7}.
No associations
LandOfFree
Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups 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 Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-657394