ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let R(b,k)R_{(b,k)} denote the rate of a (b,k)(b,k)-hashing scheme, with integers b≥k>3b\geq k>3. For jj in the range 2≤j≤k−22\leq j\leq k-2, let bj+1‾b^{\underline{j+1}} denote the falling factorial b(b−1)⋯(b−j)b(b-1)\cdots(b-j). Generalized upper-bound conjecture. For b≥k>3b\geq k>3,

R(b,k)≤min⁡2≤j≤k−2(1log⁡bj−1+bj+1bj+1‾log⁡b−jk−j−1)−1.R_{(b,k)} \leq \min_{2 \leq j \leq k-2} \left(\frac{1}{\log\frac{b}{j-1}} + \frac{b^{j+1}}{b^{\underline{j+1}} \log \frac{b-j}{k-j-1}} \right)^{-1}.

This conjecture is motivated by previously established bounds and by the numerical upper bound for (b,k)=(6,6)(b,k)=(6,6); its validity for all b≥k>3b\geq k>3 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.