In the basic representation of U q ( sl @ 2 ) realized via the algebra of symmetric functions, we compare the canonical basis with the basis of Macdonald polynomials where t=q 2 . We show that the Macdonald polynomials are invariant with respect to the bar involution defined abstractly on the repres
Macdonald Polynomials and Algebraic Integrability
β Scribed by Oleg A. Chalykh
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 380 KB
- Volume
- 166
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
β¦ Synopsis
We construct explicitly (nonpolynomial) eigenfunctions of the difference operators by Macdonald in the case t=q k , k Β₯ Z. This leads to a new, more elementary proof of several Macdonald conjectures, proved first by Cherednik. We also establish the algebraic integrability of Macdonald operators at t=q k (k Β₯ Z), generalizing the result of Etingof and Styrkas. Our approach works uniformly for all root systems including the BC n case and related Koornwinder polynomials. Moreover, we apply it for a certain deformation of the A n root system where the previously known methods do not work.
π SIMILAR VOLUMES
## dedicated to professor jack k. hale on the occasion of his 70th birthday We present three main results. The first two provide sufficient conditions in order that a planar polynomial vector field in C 2 has a rational first integral, and the third one studies the number of multiple points that a
Let T be the generic trace algebra generated by the algebra R of two generic 2 = 2 matrices and by all traces of the matrices from R over a field K. We construct new automorphisms of T and R. They induce automorphisms of the polynomial algebra in five variables which fix two of the variables. Our au
Schubert polynomials were introduced and extensively developed by Lascoux and SchΓΌtzenberger, after an earlier less combinatorial version had been considered by Bernstein, Gelfand and Gelfand and Demazure. We give a new development of the theory of Schubert polynomials based on formal computations i
In this paper we consider test polynomials in the polynomial algebra and the free associative algebra. A test polynomial is defined by the following property: every endomorphism which fixes the polynomial is an automorphism. We construct families of test polynomials for the polynomial algebra and th