From boxes to polynomials: a story of generalisation
From MaRDI portal
Publication:6392415
arXiv2203.00223MaRDI QIDQ6392415
Author name not available (Why is that?)
Publication date: 28 February 2022
Abstract: Here we will embark on a journey starting with some ostensibly inauspicious boxes. Carefully stacking them in different ways yields amazing identities. From humble beginnings at the integer version: `how many steps does it take to get from row to row ?' to the first upgrade: the polynomial version, before finally reaching the final upgrade: the elliptic version. Each upgrade gives a more general theorem than before. Secretly, everything is controlled by the symmetric Macdonald polynomials. Setting in the Macdonald polynomial takes the elliptic version of the theorem to the polynomial version. Then, letting approach reduces the polynomial version to the integer version. All the beautiful theorems and ideas come merely from stacking boxes.
No records found.
This page was built for publication: From boxes to polynomials: a story of generalisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6392415)