arXiv (All)
open access
The Scaling Window of Random $k$-SAT
We prove a general upper bound for scaling windows of sparse monotone covering problems. From that, we deduce that for every fixed value $k\geq 3$, the window of random $k$-SAT is $O(n/\log n)$, improving the Friedgut-Bourgain bound of $O(n/\log\log n)$. We also show that random signed Not-All-Equal
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
- Local large deviations for triangles in sparse random graphs#1036279
- A Counting and Sampling Lovász Local Lemma#1077930
- Two-sided linear hashing and quadratic density bounds for smooth lattice coverings#1034115
- Descriptive complexity results related to uniform distribution theory (Analytic Number Theory and Related Topics)#378247
- Descriptive complexity results related to uniform distribution theory (Analytic Number Theory and Related Topics)#378240
Record · ID 1062122
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