ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(A,B)f(A,B) be the partitioning-function quantity discussed in the paper, with AA and BB positive integers. The asymptotic conjecture for f(A,1)f(A,1).

f(A,1)=A+o(A).f(A,1)=A+o(A).

The source notes that only f(1,1)=4f(1,1)=4 is known exactly and that the broader bound f(A,B)≤A+B+2f(A,B)\leq A+B+2 was asked as an open question; the stated asymptotic claim therefore remains open.

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.