Stanley's coloured factorization conjecture for symmetric groups
Stanley's coloured factorization conjecture for symmetric groups
Let , let , and let be a fixed element of the conjugacy class in . Let be the set of permutations of whose cycles are coloured by . For , write for the number of cycles of coloured , and set , . Define by and, for every cycle of , , where is the cycle of containing . Stanley's coloured factorization conjecture. One has
This gives a conjectured combinatorial interpretation of the multivariate character polynomials . The assertion is known when , corresponding to factorizations without colours, but remains open for , even when has one part.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Amarpreet Rattan, “Stanley's character polynomials and coloured factorizations in the symmetric group”, arXiv:math/0610557 (2007).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.