ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Cn\mathcal{C}_n denote the event of complete occupation for kk-neighbour bootstrap percolation on the sequence of tori Tnd\mathbb{T}_n^d and boxes [n]d[n]^d.

Noise sensitivity conjecture. For any dgreaterthanorequaltok>2d greater than or equal to k > 2, the event Cn\mathcal{C}_n is noise sensitive.

The result is known for dgreaterthanorequaltok=2d greater than or equal to k=2, but for dgreaterthanorequaltok>2d greater than or equal to k>2 the equivalence between complete occupation and the existence of a suitable simple seed is not known, leaving the mechanism governing pivotal sites unclear.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.