2000 character limit reached
Modular Nekrasov-Okounkov formulas
Published 9 Feb 2019 in math.CO, math-ph, math.AG, and math.MP | (1902.03386v1)
Abstract: Using Littlewood's map, which decomposes a partition into its $r$-core and $r$-quotient, Han and Ji have shown that many well-known hook-length formulas admit modular analogues. In this paper we present a variant of the Han-Ji `multiplication theorem' based on a new analogue of Littlewood's decomposition. We discuss several applications to hook-length formulas, one of which leads us to conjecture a modular analogue of the $q,t$-Nekrasov-Okounkov formula.
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.