Zabrocki's nonnegativity conjecture for set-partition sums
Zabrocki's nonnegativity conjecture for set-partition sums
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.
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
Victor Wang, “On an alternating sum of factorials and Stirling numbers of the first kind: trees, lattices, and games”, arXiv:2504.21176 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.