Metraipolis › archive › dc_84fe7e971f08
The probabilistic bound for perfect hashing is sharp only for binary alphabets — arXiv:2611.08230
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08230
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:52:52.307Z
- SHA-256 of the archived text
ba1557b6c90e554cb7925d6afd2026f879b086da5b44fe73d0ee2c80297a78fb- Stable URL of this page
https://metraipolis.com/documento/dc_84fe7e971f08
How to cite
The probabilistic bound for perfect hashing is sharp only for binary alphabets — arXiv:2611.08230 — arXiv (en), https://arxiv.org/abs/2611.08230 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_84fe7e971f08 (Metraipolis archive dc_84fe7e971f08, sha256 ba1557b6c90e554cb7925d6afd2026f879b086da5b44fe73d0ee2c80297a78fb)
BibTeX
@misc{dc84fe7e971f08,
title = {The probabilistic bound for perfect hashing is sharp only for binary alphabets — arXiv:2611.08230},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08230},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_84fe7e971f08; sha256 ba1557b6c90e554cb7925d6afd2026f879b086da5b44fe73d0ee2c80297a78fb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08230. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We investigate the optimal asymptotic rate $R_q$ of perfect $q$-hash codes, a fundamental extremal problem in combinatorics, information theory, and computer science. Let $B_q=-\log_2(1-q!/q^q)/(q-1)$ denote the classical probabilistic lower bound. We prove that $R_q=B_q$ if and only if $q=2$, establishing an explicit strict improvement for every $q\ge3$ and settling the first assertion of a conjecture of Xing and Yuan (Combinatorica 43 (2023), 347--366). More significantly, we show that, for every $\eta>0$, $R_q\ge B_q+\exp(-(2+\eta)q)$ for all sufficiently large integers $q$. This improves the previously known increments of scale $\exp(-3q+O(\ln q))$ by an exponential factor. We also establish a structural limitation of the concatenation method. For pairwise uniform inner codes of subexponential length, the resulting rate bound exceeds $B_q$ by at most $\exp(-3q+o(q))$. Thus, exponentially long inner codes are necessary to achieve the new improvement scale within this framework. Our proofs combine Fourier analysis, high-dimensional simplex codes, additive permutation counts, and entropy bounds for hypergraph matchings. We further strengthen lower bounds from short inner codes and improve several known numerical estimates. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2611.08230 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-06T14:24:27.848Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).