MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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

  • 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.

share|cite|improve this question
you might like to ask developers of this functionality in Sage on!forum/sage-combinat-devel It could be that they have something for your task that haven't made it into Sage proper yet. – Dima Pasechnik Jan 1 '13 at 4:02
up vote 3 down vote accepted

There is a better way to compute Macdonald polynomials explicitly than through Gram-Schmidt orthogonalization: using the action of the Macdonald operators. Details can be found here DOI (also avaliable in a somewhat longer version at arXiv:math/0303263)

The first few Macdonald polynomials can be computed in closed form from the Pieri formula. Details can be found here DOI (also available at arXiv:1009.4482)

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.