Zabrocki's nonnegativity conjecture for set-partition sums
Statement
For a positive integer , let , and let and be set partitions of , with meaning that every block of is contained in some block of . Write for the number of blocks of , let denote the product of the factorials of one less than the number of elements in each block of , and let denote the product of the factorials of one less than the number of blocks of contained in each block of . Zabrocki's conjecture. For every set partition of , the numbers
are nonnegative. This conjecture concerns the sign pattern in the expansion of the -basis in the -basis for symmetric functions in noncommuting variables. Its resolution is not specified 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.