Macdonald polynomials
E865108
family of symmetric functions
orthogonal polynomials
q-orthogonal polynomials
two-parameter symmetric functions
Macdonald polynomials are a family of orthogonal symmetric functions depending on two parameters that generalize several classical symmetric polynomials, such as Schur and Jack polynomials, and play a central role in algebraic combinatorics and representation theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Macdonald polynomials canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10462104 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Macdonald polynomials Context triple: [Selberg integral, relatedTo, Macdonald polynomials]
-
A.
Kazhdan–Lusztig theory
Kazhdan–Lusztig theory is a framework in representation theory and algebraic geometry that studies Hecke algebras and their bases via Kazhdan–Lusztig polynomials, with deep connections to the representation theory of Lie algebras and geometry of Schubert varieties.
-
B.
Symanzik polynomials
Symanzik polynomials are graph-based polynomials that arise in the parametric representation of Feynman integrals in quantum field theory, encoding the topology and kinematic dependence of Feynman diagrams.
-
C.
Schur–Weyl duality
Schur–Weyl duality is a fundamental result in representation theory that links representations of the symmetric group and the general linear group via their commuting actions on tensor powers of a vector space.
-
D.
Rogers–Ramanujan-type identities
Rogers–Ramanujan-type identities are a class of deep q-series and partition identities generalizing the classical Rogers–Ramanujan identities, with rich connections to combinatorics, number theory, and modular forms.
-
E.
Askey–Wilson algebra
The Askey–Wilson algebra is a quadratic algebra arising in the theory of orthogonal polynomials and quantum groups, closely linked to the Askey–Wilson polynomials and related integrable models.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Macdonald polynomials Target entity description: Macdonald polynomials are a family of orthogonal symmetric functions depending on two parameters that generalize several classical symmetric polynomials, such as Schur and Jack polynomials, and play a central role in algebraic combinatorics and representation theory.
-
A.
Kazhdan–Lusztig theory
Kazhdan–Lusztig theory is a framework in representation theory and algebraic geometry that studies Hecke algebras and their bases via Kazhdan–Lusztig polynomials, with deep connections to the representation theory of Lie algebras and geometry of Schubert varieties.
-
B.
Symanzik polynomials
Symanzik polynomials are graph-based polynomials that arise in the parametric representation of Feynman integrals in quantum field theory, encoding the topology and kinematic dependence of Feynman diagrams.
-
C.
Schur–Weyl duality
Schur–Weyl duality is a fundamental result in representation theory that links representations of the symmetric group and the general linear group via their commuting actions on tensor powers of a vector space.
-
D.
Rogers–Ramanujan-type identities
Rogers–Ramanujan-type identities are a class of deep q-series and partition identities generalizing the classical Rogers–Ramanujan identities, with rich connections to combinatorics, number theory, and modular forms.
-
E.
Askey–Wilson algebra
The Askey–Wilson algebra is a quadratic algebra arising in the theory of orthogonal polynomials and quantum groups, closely linked to the Askey–Wilson polynomials and related integrable models.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
family of symmetric functions
ⓘ
orthogonal polynomials ⓘ q-orthogonal polynomials ⓘ two-parameter symmetric functions ⓘ |
| appearsIn | Macdonald’s book "Symmetric Functions and Hall Polynomials" NERFINISHED ⓘ |
| dependsOn |
parameter q
ⓘ
parameter t ⓘ |
| domain |
algebraic combinatorics
ⓘ
representation theory ⓘ symmetric function theory ⓘ |
| generalizes |
Hall–Littlewood polynomials
NERFINISHED
ⓘ
Jack polynomials NERFINISHED ⓘ Schur polynomials NERFINISHED ⓘ monomial symmetric functions ⓘ q-Whittaker functions NERFINISHED ⓘ |
| hasBasisProperty | form a basis of the ring of symmetric functions over Q(q,t) ⓘ |
| hasCombinatorialModel |
Haglund–Haiman–Loehr formula
GENERATED
ⓘ
LLT polynomials as building blocks GENERATED ⓘ |
| hasConjecture | Macdonald positivity conjecture NERFINISHED ⓘ |
| hasGeneralization | Macdonald polynomials for arbitrary root systems NERFINISHED ⓘ |
| hasNormalization | usually normalized to have leading monomial x^λ ⓘ |
| hasOrthogonality | orthogonal with respect to a certain (q,t)-deformed scalar product ⓘ |
| hasType |
Macdonald polynomials associated to reduced root systems
ⓘ
type A Macdonald polynomials ⓘ |
| hasVariant |
P_λ(x;q,t) Macdonald polynomials
ⓘ
Q_λ(x;q,t) Macdonald polynomials NERFINISHED ⓘ |
| indexedBy | partitions ⓘ |
| introducedBy | Ian G. Macdonald NERFINISHED ⓘ |
| introducedIn | 1980s ⓘ |
| namedAfter | Ian G. Macdonald NERFINISHED ⓘ |
| parameterSpecialization |
Hall–Littlewood polynomials at q = 0
NERFINISHED
ⓘ
Jack polynomials at q = t^α, t → 1 ⓘ Schur polynomials at q = t ⓘ monomial symmetric functions at q = t = 0 ⓘ q-Whittaker functions at t = 0 ⓘ |
| relatedTo |
Cherednik operators
NERFINISHED
ⓘ
Demazure characters ⓘ Haiman’s n! theorem NERFINISHED ⓘ Hilbert schemes of points on surfaces NERFINISHED ⓘ affine Hecke algebras NERFINISHED ⓘ double affine Hecke algebras NERFINISHED ⓘ |
| satisfies |
Cauchy identity for Macdonald polynomials
ⓘ
Macdonald positivity conjecture (proved) NERFINISHED ⓘ Pieri-type rules ⓘ triangularity with respect to dominance order on partitions ⓘ |
| usedIn |
combinatorial representation theory of symmetric groups
ⓘ
representation theory of quantum groups ⓘ study of diagonal harmonics ⓘ theory of symmetric functions in infinitely many variables ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Macdonald polynomials Description of subject: Macdonald polynomials are a family of orthogonal symmetric functions depending on two parameters that generalize several classical symmetric polynomials, such as Schur and Jack polynomials, and play a central role in algebraic combinatorics and representation theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.