arXiv (OAI Expanded)
open access
Thresholds and Fluctuations for Colorful Arithmetic Progressions in Sparse Random Colorings
In this paper, we derive thresholds and fluctuations for arithmetic progressions with prescribed color patterns in sparse random colorings of $[n]:=\{1, 2, \ldots, n\}$, where each element of $[n]$ is colored independently according to a given probability vector. For any admissible ordered palette o
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
- k-Coloring is Faster than Computing the Chromatic Number#987763
- Shuffle-compatible permutation statistics II: the exterior peak set#820104
- Infinite Sum-Product Configurations in Parallel#1048328
- A 4AP-free permutation of the positive integers#1070248
- Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric#1062747
Record · ID 1084973
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