Papers
Topics
Authors
Recent
Search
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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.