Preprint
Sep 2026
Optimal support and condensation in random allocations
How many distinct symbols should a password use? If its length is fixed at $n$ and an observer learns only which symbols appear, the number of compatible passwords is maximized asymptotically when $k/n\to1/(2\log2)$. We ask what changes when, in addition to the length, aggregate information about the repetition pattern...
A. Ottolini
· 0 citations