ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P(n)\mathcal{P}(n) denote the set of integer partitions of nn. For a partition λ=(λ1,λ2,…,λℓ)\lambda=(\lambda_1,\lambda_2,\dots,\lambda_\ell), let prek(λ)pre_k(\lambda) be the partition whose parts are the products λi1λi2⋯λik\lambda_{i_1}\lambda_{i_2}\cdots\lambda_{i_k} over all 1≤i1<i2<⋯<ik≤ℓ1\leq i_1<i_2<\cdots<i_k\leq\ell.

Modified Ballantine–Beck–Merca conjecture. For k≥3k\geq 3, prekpre_k is injective on partitions of nn with jj parts for each j≥k+1j\geq k+1.

The modification excludes the kk-part case, where the original conjecture is false. The source gives the modified statement after observing that equal images must have the same number of parts, since (ℓk)\binom{\ell}{k} is strictly increasing in ℓ\ell for fixed kk; its resolution is not supplied here.

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.