Some combinatorial interpretations of the Macdonald identities for affine root systems and Nekrasov--Okounkov type formulas
This paper establishes a combinatorial framework linking integer vectors and partitions viewed as bi-infinite words to derive enumerations of hook length products, thereby providing Schur-function-based interpretations of Macdonald identities for all affine root systems and yielding corresponding -Nekrasov–Okounkov formulas.