MétaCan
Menu
Back to cohort
Record W1667592137 · doi:10.46298/dmtcs.3593

A bijective proof of a factorization formula for Macdonald polynomials at roots of unity

2008· article· fr· W1667592137 on OpenAlexaff
François Descouens, Hideaki Morita, Yasuhide Numata

Bibliographic record

VenueDiscrete Mathematics & Theoretical Computer Science · 2008
Typearticle
Languagefr
FieldMathematics
TopicAdvanced Combinatorial Mathematics
Canadian institutionsFields Institute for Research in Mathematical SciencesYork University
Fundersnot available
KeywordsCombinatoricsBijectionFactorizationLambdaMathematicsPartition (number theory)Root of unityCombinatorial proofMonomialPhysicsAlgorithmQuantum mechanics

Abstract

fetched live from OpenAlex

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials $\widetilde{H}_{\lambda} (X;q,t)$ when $t$ is specialized at a primitive root of unity. Our proof is restricted to the special case where $\lambda$ is a two columns partition. We mainly use the combinatorial interpretation of Haiman, Haglund and Loehr giving the expansion of $\widetilde{H}_{\lambda} (X;q,t)$ on the monomial basis. Nous présentons une preuve combinatoire de la formule de factorisation des polynômes de Macdonald modifiés $\widetilde{H}_{\lambda} (X;q,t)$ quand $t$ est spécialisé à une racine primitive de l'unité. Notre preuve se restreint au cas particulier des partitions $\lambda$ n'ayant que deux colonnes. On utilise principalement l'interprétation combinatoire de Haglund, Haiman and Loehr donnant le développement de $\widetilde{H}_{\lambda} (X;q,t)$ sur la base des fonctions monomiales.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.018
Threshold uncertainty score0.060

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.001
Science and technology studies0.0020.003
Scholarly communication0.0020.004
Open science0.0020.003
Research integrity0.0010.005
Insufficient payload (model declined to judge)0.0180.004

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.030
GPT teacher head0.303
Teacher spread0.273 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueDiscrete Mathematics & Theoretical Computer ScienceSame topicAdvanced Combinatorial MathematicsFrench-language works237,207