ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n be the set of all integer partitions of nn. Two partitions tt-intersect properly if they have tt distinct common parts, and a subset is properly tt-intersecting if every two of its members tt-intersect properly. Let Pn([t])P_n([t]) denote the set of partitions containing each of 1,2,…,t1,2,\ldots,t as a part. The properly tt-intersecting partition conjecture. Pn([t])P_n([t]) is a properly tt-intersecting subset of PnP_n of maximum size. This is the distinct-common-parts analogue of the preceding conjectures; the source presents the unrestricted-length assertion without a resolution.

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.