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

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=(t1,...,tk), one for each of the k orbits of roots in the affine root system. The Macdonald polynomials are polynomials in n variables x=(x1,...,xn), where n is the rank of the affine root system. They generalize many other families of orthogonal polynomials, such as Jack p

Property Value
dbo:abstract
  • Die Macdonald-Polynome sind in der Mathematik eine Familie von orthogonalen symmetrischen Polynomen in mehreren Variablen. Sie verallgemeinern eine große Familie von orthogonalen Polynomen wie die , und die . Sie wurden 1988 von Ian Macdonald eingeführt. (de)
  • 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=(t1,...,tk), one for each of the k orbits of roots in the affine root system. The Macdonald polynomials are polynomials in n variables x=(x1,...,xn), 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. (en)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 10354285 (xsd:integer)
dbo:wikiPageLength
  • 21260 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1091215383 (xsd:integer)
dbo:wikiPageWikiLink
dbp:b
  • 1 (xsd:integer)
  • n (en)
dbp:p
  • ∨ (en)
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • Die Macdonald-Polynome sind in der Mathematik eine Familie von orthogonalen symmetrischen Polynomen in mehreren Variablen. Sie verallgemeinern eine große Familie von orthogonalen Polynomen wie die , und die . Sie wurden 1988 von Ian Macdonald eingeführt. (de)
  • 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=(t1,...,tk), one for each of the k orbits of roots in the affine root system. The Macdonald polynomials are polynomials in n variables x=(x1,...,xn), where n is the rank of the affine root system. They generalize many other families of orthogonal polynomials, such as Jack p (en)
rdfs:label
  • Macdonald-Polynome (de)
  • Macdonald polynomials (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
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