The exponential lower-bound conjecture for sphere percolation thresholds

From papers

Let d3d\geq 3 and let σd\sigma_d denote the dimension-dependent constant used in the definition of the sphere-percolation model. Write pcSp_c^\mathcal{S} for its critical probability.

Exponential lower-bound conjecture. For every dimension d3d\geq 3,

pcSexp(2σd)(2d1)2>18(d1).p_c^\mathcal{S}\geq \frac{\exp(2\sigma_d)}{(2d-1)^2}>\frac{1}{8(d-1)}.

This conjecture would follow from the proposed infinitely fine partition argument if the corresponding value of LL were shown to satisfy L<1L<1. It gives a closed-form lower bound for the critical probability, strengthening the general bound obtained earlier in the paper.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Olivier Couronné, “Entanglement percolation and spheres in Z^d”, arXiv:2112.03538 (2021).

Solutions 0

No solutions have been posted yet.