Loterre: Mathématiques: Macdonald polynomial

geometry > algebraic geometry > Macdonald polynomial

... > function > elementary function > polynomial > orthogonal polynomials > Macdonald polynomial

algebra > polynomial > orthogonal polynomials > Macdonald polynomial

mathematical analysis > combinatorics > algebraic combinatorics > Macdonald polynomial

algebra > combinatorics > algebraic combinatorics > Macdonald polynomial

Macdonald polynomial

In mathematics, Macdonald polynomials P_λ(x; t,q) are a family of orthogonal symmetric polynomials in several variables, introduced by Macdonald in 1987. He later introduced a non-symmetric generalization in 1995. Macdonald originally associated his polynomials with weights λ of finite root systems and used just one variable t, but later realized that it is more natural to associate them with affine root systems rather than finite root systems, in which case the variable t can be replaced by several different variables t=(t₁,...,t_k), one for each of the k orbits of roots in the affine root system. The Macdonald polynomials are polynomials in n variables x=(x₁,...,x_n), where n is the rank of the affine root system. They generalize many other families of orthogonal polynomials, such as Jack polynomials and Hall–Littlewood polynomials and Askey–Wilson polynomials, which in turn include most of the named 1-variable orthogonal polynomials as special cases. Koornwinder polynomials are Macdonald polynomials of certain non-reduced root systems. They have deep relationships with affine Hecke algebras and Hilbert schemes, which were used to prove several conjectures made by Macdonald about them.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Macdonald_polynomials)

http://data.loterre.fr/ark:/67375/PSR-B2KXQC94-X

RDF/XML TURTLE JSON-LD Date de création 18/08/2023, dernière modif. 18/08/2023

LOTERRE