作者: Sami H. Assaf
DOI:
关键词: Macdonald polynomials 、 n! conjecture 、 Graph 、 Koornwinder polynomials 、 Equivalence (formal languages) 、 Combinatorial proof 、 Combinatorics 、 Mathematics 、 Discrete mathematics 、 Schur polynomial 、 Jack function
摘要: We make a systematic study of new combinatorial construction called dual equivalence graph. axiomatize these graphs and prove that their generating functions are symmetric Schur positive. By constructing graph on ribbon tableaux which we transform into graph, give proof the symmetry positivity introduced by Lascoux, Leclerc Thibon. Using Haglund's formula for transformed Macdonald polynomials, this also gives expansion polynomials.