Documentation

FormalConjectures.GreensOpenProblems.«39»

Green's Open Problem 39 #

References:

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]

    theorem Green39.green_39.variant_101 :
    True Filter.Tendsto (fun (p : { q : // Nat.Prime q }) => have k := (↑p).sqrt; have c := 1.01 * k⌋₊; (proportionCoverable (↑p) k c)) Filter.atTop (nhds 1)

    "I do not know how to answer this even with 100 replaced by 1.01." [Gr24]"

    theorem Green39.green_39.variant_theta :
    True ∀ (θ : ), 0 < θθ 1 / 2C > 1, Filter.Tendsto (fun (p : { q : // Nat.Prime q }) => have k := p ^ θ⌋₊; have c := C * p ^ θ⌋₊; (proportionCoverable (↑p) k c)) Filter.atTop (nhds 1)

    Similar questions are interesting with $\sqrt{p}$ replaced by $p^\theta$ for any $\theta \le 1/2$. [Gr24]