Computer Science – Computational Complexity
Scientific paper
2007-09-05
Computer Science
Computational Complexity
59 pages, changed content
Scientific paper
This article describes a {\em nonstandard} quantum group that may be used to derive a positive formula for the plethysm problem, just as the standard (Drinfeld-Jimbo) quantum group can be used to derive the positive Littlewood-Richardson rule for arbitrary complex semisimple Lie groups. The sequel \cite{GCT8} gives conjecturally correct algorithms to construct canonical bases of the coordinate rings of these nonstandard quantum groups and canonical bases of the dually paired nonstandard deformations of the symmetric group algebra. A positive $#P$-formula for the plethysm constant follows from the conjectural properties of these canonical bases and the duality and reciprocity conjectures herein.
No associations
LandOfFree
Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem 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 VII: Nonstandard quantum group for the plethysm problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-657388