The generalized upper-bound conjecture for (b,k)-hashing
Statement
Let denote the rate of a -hashing scheme, with integers . For in the range , let denote the falling factorial . Generalized upper-bound conjecture. For ,
This conjecture is motivated by previously established bounds and by the numerical upper bound for ; its validity for all 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.