ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P be the set of partitions of a ground set S. We allow two operations on P: (1) splitting a class into two arbitrary classes and (2) joining two classes into one. For two partitions X and Y, let us define the distance d(X,Y) as the minimum number of such operations transforming X to Y. Given partitions X1,X2,…,Xk∈PX_1,X_2,\ldots,X_k\in P, find a partition Y∈PY\in P in polyinomial time minimizing the total distance, ∑i=1kd(Xi,Y).\sum_{i=1}^k d(X_i,Y).

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.