English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We announce proofs of Macdonald's constant term conjectures for the affine root systems S(F4) and S(F4)U. We also give an algorithm for deciding the conjectures for the re­ maining root systems S(E6), S(E7), and S(E%) and prove that the constant term in question can indeed be expressed in closed form. Combined with previous work of Zeilberger- Bressoud, Kadell, and Gustafson, our results imply that Mac­ donald's conjectures are true in form for any root system, and the complete truth of Macdonald's conjectures is a finite num­ ber of mips away.

Macdonald’s constant term conjectures for exceptional root systems