Stabilization conjecture for near-perfect powers of colored partition numbers

From papers

Let pr(n)p_r(n) denote the rr-colored partition function, and define Lpr(d)L_{p_r}(d) and Mpr,k(d)M_{p_r,k}(d) analogously to the corresponding quantities for the partition and overpartition functions. The colored-partition stabilization conjecture. For each non-negative integer dd, there is a positive integer NdN_d such that for all kNdk\geq N_d,

Mpr,k(d)=Lpr(d).M_{p_r,k}(d)=L_{p_r}(d).

The source proposes this as an analogue of the Merca–Ono–Tsai stabilization conjecture and gives no resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Summer Haag, Praneel Samanta, Swati, Holly Swisher, Stephanie Treneer and Robin Visser, “Repellent properties of perfect powers on partition functions: a heuristic approach”, arXiv:2601.18138 (2026).

Additional references

2 papers in this index state this conjecture (2025–2026). The statement above is taken from the most recent of them; the others are arXiv:2501.03754.

Solutions 0

No solutions have been posted yet.