ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer k≥2k\geq 2, let pk(n)p^k(n) denote the number of partitions of nn into perfect kk-th powers. Define NkN_k to be the smallest index such that the sequence {pk(n)}\{p^k(n)\} is log-concave for all n>Nkn>N_k.

Initial log-concavity threshold conjecture. For k≤6k\leq6, the smallest such values are

pk(n)p2(n)p3(n)p4(n)p5(n)p6(n)Nk104115655637854250786035577568\begin{array}{c|ccccc} p^k(n)&p^2(n)&p^3(n)&p^4(n)&p^5(n)&p^6(n)\\ \hline N_k&1041&15655&637854&2507860&35577568 \end{array}

These values record the first index after which log-concavity is observed for the square through sixth-power partition functions. The source gives no proof or resolution of this finite-data assertion.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.