An Entity of Type: Function113783816, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematics, Macdonald-Koornwinder polynomials (also called Koornwinder polynomials) are a family of orthogonal polynomials in several variables, introduced by Koornwinder and I. G. Macdonald (1987, important special cases), that generalize the Askey–Wilson polynomials. They are the Macdonald polynomials attached to the non-reduced affine root system of type (C∨n, Cn), and in particular satisfy analogues of Macdonald's conjectures . In addition showed that the Macdonald polynomials associated to any classical root system can be expressed as limits or special cases of Macdonald-Koornwinder polynomials and found complete sets of concrete commuting difference operators diagonalized by them. Furthermore, there is a large class of interesting families of multivaria

Property Value
dbo:abstract
  • In mathematics, Macdonald-Koornwinder polynomials (also called Koornwinder polynomials) are a family of orthogonal polynomials in several variables, introduced by Koornwinder and I. G. Macdonald (1987, important special cases), that generalize the Askey–Wilson polynomials. They are the Macdonald polynomials attached to the non-reduced affine root system of type (C∨n, Cn), and in particular satisfy analogues of Macdonald's conjectures . In addition showed that the Macdonald polynomials associated to any classical root system can be expressed as limits or special cases of Macdonald-Koornwinder polynomials and found complete sets of concrete commuting difference operators diagonalized by them. Furthermore, there is a large class of interesting families of multivariable orthogonal polynomials associated with classical root systems which are degenerate cases of the Macdonald-Koornwinder polynomials. The Macdonald-Koornwinder polynomials have also been studied with the aid of affine Hecke algebras . The Macdonald-Koornwinder polynomial in n variables associated to the partition λ is the unique Laurent polynomial invariant under permutation and inversion of variables, with leading monomial xλ, and orthogonal with respect to the density on the unit torus , where the parameters satisfy the constraints and (x;q)∞ denotes the infinite q-Pochhammer symbol.Here leading monomial xλ means that μ≤λ for all terms xμ with nonzero coefficient, where μ≤λ if and only if μ1≤λ1, μ1+μ2≤λ1+λ2, …, μ1+…+μn≤λ1+…+λn.Under further constraints that q and t are real and that a, b, c, d are real or, if complex, occur in conjugate pairs, the given density is positive. For some lecture notes on Macdonald-Koornwinder polynomials from a Hecke algebra perspective see for example. (en)
dbo:wikiPageID
  • 19599247 (xsd:integer)
dbo:wikiPageLength
  • 5234 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1105058078 (xsd:integer)
dbo:wikiPageWikiLink
dbp:b
  • n (en)
dbp:date
  • February 2021 (en)
dbp:p
  • ∨ (en)
dbp:reason
  • Parenthetical referencing has been deprecated; convert to shortened footnotes. (en)
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • In mathematics, Macdonald-Koornwinder polynomials (also called Koornwinder polynomials) are a family of orthogonal polynomials in several variables, introduced by Koornwinder and I. G. Macdonald (1987, important special cases), that generalize the Askey–Wilson polynomials. They are the Macdonald polynomials attached to the non-reduced affine root system of type (C∨n, Cn), and in particular satisfy analogues of Macdonald's conjectures . In addition showed that the Macdonald polynomials associated to any classical root system can be expressed as limits or special cases of Macdonald-Koornwinder polynomials and found complete sets of concrete commuting difference operators diagonalized by them. Furthermore, there is a large class of interesting families of multivaria (en)
rdfs:label
  • Koornwinder polynomials (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License