Growth conjecture for the number of orderings of congruence-class biases
Statement
Let denote the number of possible orderings arising from the biases among congruence classes for -indivisible partitions, and let be Euler's totient function. Growth conjecture. As , we have
and
Thus the normalized number of orderings is conjectured to grow sublinearly in and faster than logarithmically. The claim is motivated by numerical evidence and remains open.
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.