2000 character limit reached
Some combinatorial interpretations of the Macdonald identities for affine root systems
Published 3 Apr 2023 in math.CO and math.RT | (2304.01394v1)
Abstract: We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us to give a combinatorial interpretation of the Macdonald identities for affine root systems of the seven infinite families in terms of symplectic and special orthogonal Schur functions. From these results, we are able to derive $q$-Nekrasov--Okounkov formulas associated to each family. Nevertheless we only give results for types $\tilde{C}$ and $\tilde{C}{\vee}$, and give a sketch of the proof for type $\tilde{C}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.