ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let s>2s>2 and n>2sn>2s, and let an nn-multiset be a multiset with nn elements. Two nn-multisets are ss-equivalent when they have the same multiset of ss-sums. Magical Triplet Conjecture. For any three distinct nn-multisets, some two of them are not ss-equivalent to each other. This proposes an update to an earlier question about the number of mutually ss-equivalent multisets; it remains open in the supplied text.

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.