ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let [n]={1,…,n}[n]=\{1,\ldots,n\}, let sn,k=1k(n+12)s^{n,k}=\frac{1}{k}\binom{n+1}{2} be an integer, and let a partition of [n][n] implement {pi}i=1k\{p_i\}_{i=1}^k when its blocks can be bijectively matched with the prescribed sizes p1,…,pkp_1,\ldots,p_k. Call a partition equitable when every block has sum sn,ks^{n,k}. Let k<nk<n be positive integers, let 1<p1⩽p2⩽⋯⩽pk1<p_1\leqslant p_2\leqslant\cdots\leqslant p_k with ∑i=1kpi=n\sum_{i=1}^k p_i=n, and set Pj=∑i=1jpiP_j=\sum_{i=1}^j p_i. Equitable partition conjecture. There exists an equitable partition of [n][n] implementing {pi}i=1k\{p_i\}_{i=1}^k if and only if

∑i=1Pj(n−i+1)⩾jsn,k\sum_{i=1}^{P_j}(n-i+1)\geqslant j s^{n,k}

for every j=1,…,kj=1,\ldots,k. This conjecture asserts sufficiency of the stated necessary condition for equal-sum partitions with prescribed block sizes; the supplied source gives no resolution evidence.

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.