Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unimodality of ranks and a proof of Stanton's conjecture

Published 25 Sep 2022 in math.NT and math.CO | (2209.12239v1)

Abstract: Recently, much attention has been given to various inequalities among partition functions. For example, Nicolas, {and later DeSavlvo--Pak,} proved that $p(n)$ is eventually log-concave, and Ji--Zang showed that the cranks are eventually unimodal. This has led to a flurry of recent activity generalizing such results in different directions. At the same time, Stanton recently made deep conjectures on the positivity of certain polynomials associated to ranks and cranks of partitions, with the ultimate goal of pointing the way to ``deeper'' structure refining ranks and cranks. These have been shown to be robust in recent works, which have identified further infinite families of such conjectures in the case of colored partitions. In this paper, we employ the Circle Method to prove unimodality for ranks. As a corollary, we prove Stanton's original conjecture. This points to future study of the positive, integral coefficients Stanton conjectured to exist, hinting at new combinatorial structure yet to be uncovered.

Summary

Paper to Video (Beta)

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.