Asymptotic equidistribution and convexity for partition ranks
Abstract
We study the Dyson rank function N(r,t;n), the number of partitions with rank congruent to r modulo t. We first show that it is monotonic in n, and then show that it equidistributed as n → ∞. Using this result we prove a conjecture of Hou and Jagadeeson on the convexity of N(r,t;n).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.