The colored-permutation formula conjecture for normalized character polynomials
Statement
Let be the partition of whose diagram is the union of rectangles described above. Let and fix a permutation of cycle type . Let be the set of permutations in whose cycles are colored by . For and , define by assigning to each cycle of the maximum color among the cycles of contributing to it. If is the number of cycles of colored , write , and similarly for . Colored-permutation formula conjecture. One has
where the sum ranges over all pairs satisfying . This conjecture generalizes the preceding permutation formula, which is stated as a theorem in the source; its 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.