Related papers: Binomial formula for Macdonald polynomials
We prove certain duality properties and present recurrence relations for a four-parameter family of self-dual Koornwinder-Macdonald polynomials. The recurrence relations are used to verify Macdonald's normalization conjectures for these…
A generalization of the Macdonald polynomials depending upon both commuting and anticommuting variables has been introduced recently. The construction relies on certain orthogonality and triangularity relations. Although many…
In this paper we present a special formula for transforming integrals to series. The resulting series involves binomial transforms with the Taylor coefficients of the integrand. Five applications are provided for evaluating challenging…
In this paper, we derive new combinatorial formulas for symmetric Macdonald polynomials $P_{\lambda}(X;q,t)$ and integral Macdonald polynomials $J_{\lambda}(X;q,t)$, in terms of several new statistics and the major index for a partition…
We give the explicit analytic development of any Jack or Macdonald polynomial in terms of elementary (resp. modified complete) symmetric functions. These two developments are obtained by inverting the Pieri formula.
We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the…
This is a paper about $c$-functions and Macdonald polynomials. There are $c$-function formulas for $E$-expansions of $P_\lambda$ and $A_{\lambda+\rho}$, principal specializations of $P_\lambda$ and $E_\mu$, for Macdonald's constant term…
The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…
Formulas of Rodrigues-type for the Macdonald polynomials are presented. They involve creation operators, certain properties of which are proved and other conjectured. The limiting case of the Jack polynomials is discussed.
Bisymmetric Macdonald polynomials can be obtained through a process of antisymmetrization and $t$-symmetrization of non-symmetric Macdonald polynomials. Using the double affine Hecke algebra, we show that the evaluation of the bisymmetric…
In this article, using generalized derivations, we obtain a simple idea to prove the non-commutative Newton binomial formula in unital algebras and then, we extend that formula to non-unital algebras. Additionally, we establish the…
We prove that Macdonald polynomials are characters of irreducible Cherednik algebra modules.
We extend the previous paper "Macdonald's evaluation ... and applications" to the non-symmetric polynomilas recently introduced by Macdonald (as difference counterparts of Opdam's non-symmetric ones).
This paper contains the proof of difference counterparts of the conjectures due to Keven Kadell on symmetric and anti-symmetric Macdonald polynomials.
We give an elementary proof of the development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions.
Roman logarithmic binomial formula analogue has been found . It is presented here also for the case of fibonomial coefficients which recently have been given a combinatorial interpretation by the present author.
In this paper, we consider the matrix polynomial obtained by using bi-periodic Fibonacci matrix polynomial. Then, we give some properties and binomial transforms of the new matrix polynomials.
We present explicit formulas for the Macdonald polynomials of types $C_n$ and $D_n$ in the one-row case. In view of the combinatorial structure, we call them "tableau formulas". For the construction of the tableau formulas, we apply some…
Set-valued tableaux formulas play an important role in Schubert calculus. Using the box greedy reduced word for the construction of the Macdonald polynomials, we convert the alcove walk formula for Macdonald polynomials to a set-valued…
We prove a combinatorial formula for Macdonald cumulants which generalizes the celebrated formula of Haglund for Macdonald polynomials. We provide several applications of our formula. Firstly, it gives a new, constructive proof of a strong…