arXiv (All)
open access
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 th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A New Upper Bound on the Binary Deletion Channel Capacity#1011220
- The Problem of Common False-Alarm Rates and the Informational Asymmetry When Comparing Pure and Mixed Lists in Recognition Memory: Reconsidering the List-Strength Effect#178309
- A note on the Kolmogorov-type inequalities for more than three norms#677510
- A note on the Kolmogorov-type inequalities for more than three norms#674312
- Concentration of empirical entropy and transfer entropy for non-regular chains with unbounded memory#1117044
Record · ID 1051247
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive