Nonstandard braid relations and Chebyshev polynomials

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

24 pages

Scientific paper

A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two \S_r-irreducibles into irreducibles. Mulmuley and Sohoni attempt to solve this problem using canonical basis theory, by first constructing a nonstandard Hecke algebra B_r, which, though not a Hopf algebra, is a u-analogue of the Hopf algebra \CC \S_r in some sense (where u is the Hecke algebra parameter). For r=3, we study this Hopf-like structure in detail. We define a nonstandard Hecke algebra \bar{\H}^{(k)}_3 \subseteq \H_3^{\tsr k}, determine its irreducible representations over \QQ(u), and show that it has a presentation with a nonstandard braid relation that involves Chebyshev polynomials evaluated at \frac{1}{u + u^{-1}}. We generalize this to Hecke algebras of dihedral groups. We go on to show that these nonstandard Hecke algebras have bases similar to the Kazhdan-Lusztig basis of \H_3 and are cellular algebras in the sense of Graham and Lehrer.

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

Nonstandard braid relations and Chebyshev polynomials 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 Nonstandard braid relations and Chebyshev polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonstandard braid relations and Chebyshev polynomials will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-512502

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