ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let M(n,m)M(n,m) be the set of n×mn\times m nonnegative integer matrices with every row and column sum equal to mm and nn, respectively, as in the paper, and let T(n,m)={A∈M(n,m)∣A∼AT}T(n,m)=\{A\in M(n,m)\mid A\sim A^{\mathsf T}\}, where A∼BA\sim B means that AA can be transformed into BB by row and column permutations. Combinatorial Foulkes conjecture. If n≤mn\leq m, then

#T(n,m)/∼≤#T(m,n)/∼.\# T(n,m)/{\sim}\leq\# T(m,n)/{\sim}.

By the preceding combinatorial interpretation, this is equivalent to Foulkes' inequality for the sums of plethysm multiplicities. The supplied text does not establish a resolution of this formulation; it is a restatement of the preceding conjecture rather than a separate conjecture.

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.