Lower bound for the number of distinct multinomial coefficients
Statement
Let be the number of distinct multinomial coefficients arising from partitions of , and let be the total number of partitions of into parts that are either at most or multiples of (or both). Lower-bound conjecture. For every integer ,
This conjecture gives a combinatorial lower bound for the number of distinct multinomial coefficients and is part of the paper's proposed description of the growth of .
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.