Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last update: 23 December 2012
Type
The Weyl group
has order two and acts on the lattices
and
The double affine braid group is
generated by ,
, ,
, and
,
with relations
In the double affine braid group
At this point, the following Proposition, which is the
Type
case of Theorem 2.1, is easily proved by direct computation.
(Duality). Let .
The double affine braid group
is generated by
and with relations
Proof.
We prove that the presentation in (5.7) is equivalent to the presentation in (5.3). The proof that the presentation in (5.6) is equivalent to the
presentation in (5.3) is similar.
(5.3)(5.7): Use (5.4) to define in terms of
and The first and second relations in (5.7) are the third and fourth
relations (5.3). The proof of the third, fourth and fifth relations in (5.7) are
and
respectively.
(5.7)(5.3): Define
and
The third and fourth relations of (5.3) are exactly the first and second relations of (5.7). The proof of the first, second and fifth relations
in (5.3) are
and
respectively.
The double affine Hecke algebra is
with the additional relations
Using (4.5), the relations in Proposition 4.1 give
With
and
then
To illustrate Theorem 2.2, note that
is a reduced word and
The corresponding paths in
are
The polynomial representations is defined by
In this case
is the set of minimal length coset representatives of
.
Applying the expansion of to
and using
gives
Since
the symmetric Macdonald polynomial
is
The corresponding paths in are
Notes and References
This page is section 4.1 from the paper of A. Ram and M. Yip entitled A combinatorial formula for
Macdonald polynomials.