Green's Open Problem 39 #
References:
- [Gr24] Green, Ben. "100 open problems." (2024).
- [BJR11] Bollobás, Béla, Svante Janson, and Oliver Riordan. "On covering by translates of a set." Random Structures & Algorithms 38.1‐2 (2011): 33-67.
The proportion of subsets of $\mathbb{Z}/p\mathbb{Z}$ of size $k$ that can cover $\mathbb{Z}/p\mathbb{Z}$ using at most $c$ translates.
If p = 0 or k > p, return 0 by convention.
Equations
- One or more equations did not get rendered due to their size.
Instances For
theorem
Green39.green_39 :
True ↔ Filter.Tendsto
(fun (p : { q : ℕ // Nat.Prime q }) =>
have k := (↑p).sqrt;
have c := 100 * k;
↑(proportionCoverable (↑p) k c))
Filter.atTop (nhds 1)
If $A \subset \mathbb{Z}/p\mathbb{Z}$ is random, $|A| = \sqrt{p}$, can we almost surely cover $\mathbb{Z}/p\mathbb{Z}$ with $100\sqrt{p}$ translates of $A$? [Gr24]
"I do not know how to answer this even with 100 replaced by 1.01." [Gr24]"
Similar questions are interesting with $\sqrt{p}$ replaced by $p^\theta$ for any $\theta \le 1/2$. [Gr24]