← All problems

Partition-theoretic stabilization conjecture for kth-power repulsion

1 year old · traced to

Let p(n)p(n) be the partition function. For k>1k>1 and d≥0d\geq 0, define

Δk(n):=min⁡{∣p(n)−mk∣:m∈Z},\Delta_k(n):=\min\left\{\lvert p(n)-m^k\rvert:m\in\mathbb Z\right\}, Mk(d):=max⁡{n:Δk(n)≤d},M_k(d):=\max\left\{n:\Delta_k(n)\leq d\right\},

and

L(d):=max⁡{n:p(n)−1≤d}.L(d):=\max\left\{n:p(n)-1\leq d\right\}.

Partition-theoretic stabilization conjecture. For each non-negative integer dd, there is a positive integer NdN_d such that for k≥Ndk\geq N_d,

Mk(d)=L(d).M_k(d)=L(d).

Here L(d)L(d) is described using the fact that p(n)−1p(n)-1 counts nonempty partitions of size at most nn without parts of size 11. The conjecture strengthens stabilization by identifying the eventual value, reflecting the claim that 11 is generally the closest kkth power to the partition numbers. It is based on numerical evidence and remains open.

References
  1. Mircea Merca, Ken Ono and Wei-Lun Tsai, “Do perfect powers repel partition numbers?”, arXiv:2501.03754 (2025).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.