The probabilistic bound for perfect hashing is sharp only for binary alphabets
math.CO, cs.IT, math.IT
Submitted: 2026-11-05
Updated: 2026-11-05
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- More on additive triples of bijections
- Polynomially Improved Lower Bounds for Trifferent Codes via Locally Sparse $3$-Uniform Hypergraphs
- New bounds on the number of n-queens configurations
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality