Weak Foulkes conjecture for multiset partitions
Statement
Let and be positive integers with , and let be a multiset of size . A multiset partition divides into an unordered collection of submultisets. Weak Foulkes conjecture. The number of multiset partitions of into parts of size is at least the number of multiset partitions of into parts of size . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.