arXiv (All)
open access
Two-sided linear hashing and quadratic density bounds for smooth lattice coverings
We study random linear projections of a finite-field subset for which every fiber has cardinality close to its mean. We bound the mean fiber size needed to ensure that all fibers satisfy a prescribed relative discrepancy, with a prescribed failure probability. For $S\subseteq\mathbb F_q^n$ projected
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
- The higher-dimensional Shepp problem: an exact criterion for random ball coverings of tori#822552
- On (n,k)-Simple Random Integer Lattices.#315711
- Nonparametric Regression on Fixed-Cardinality Subsets:Minimax Risk and Random-Design Effects#1109580
- Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets#820420
- Trace-defect bounds for discrete Fourier concentration operators#1000189
Record · ID 1034115
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