ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let aa and bb be positive integers with a<ba<b, and let MM be a multiset of size abab. A multiset partition divides MM into an unordered collection of submultisets. Weak Foulkes conjecture. The number of multiset partitions of MM into bb parts of size aa is at least the number of multiset partitions of MM into aa parts of size bb. Equivalently, in the symmetric-function formulation given by the source, the relevant plethysm difference has nonnegative coefficients in the monomial symmetric-function basis, whereas full Foulkes conjecture asserts the analogous Schur-basis nonnegativity. This is a weaker combinatorial form of Foulkes's conjecture for tensor products of symmetric powers; its general status is not resolved 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.