Combinatorial Foulkes conjecture for transpose-symmetric matrices
Statement
Let be the set of nonnegative integer matrices with every row and column sum equal to and , respectively, as in the paper, and let , where means that can be transformed into by row and column permutations. Combinatorial Foulkes conjecture. If , then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.