I'd like to compute explicitly symmetric Macdonald functions associated to arbitrary (possibly non-reduced) root systems, using Computer Algebra System.
Unfortunately Sage seems to only implement the A-type Macdonald polynomials http://www.sagemath.org/doc/reference/sage/combinat/sf/macdonald.html
- Is there a nice paper where a combinatorial formula is provided?
- Has somebody happened to implement it in some programming language?
Of course I can perform the Gram-Schmidt orthogonalization w.r.t. the known measure, but I'll keep it as a last resort.