Improved Bounds for $(b,k)$-hashing

Stefano Della Fiore, Simone Costa, Marco Dalai

For fixed integers $b\ge k$, a problem of relevant interest in computer science and combinatorics is that of determining the asymptotic growth, with $n$, of the largest set for wh…