36 problems
Let denote the percolation time in the -neighbour bootstrap percolation model on , and let be a time parameter. Range conjecture. Theorem holds for…
Let be the -dimensional hypercube, and let denote the minimum cardinality of a set that percolates under the -neighbour bootstrap process on . Exact-siz…
Let be the cuboid consisting of unit cubes, and call a configuration a solution when it has the dismantling property used throughout the paper. Small-cuboid existe…
Let be the cube, and let denote the minimum possible area covered by the three orthogonal projections onto the faces of a solution to the faces…
Let be the adjacency graph of a uniformly repetitive (or uniformly recurrent) rhombus tiling. Let be a percolation process, monotone and freezing, on configurations…
Let be the Cartesian product of copies of the complete graph , and let denote the critical probability for -neighbor bootstrap percolat…
Let be the collection of all connected graphs of order at least with at most two blocks. A graph is 2-bootstrap good if it contains at least one pair of vertices…
Let be a critical two-dimensional update family. Its difficulty is … where a critical update family is balanced if there are no two opposite directions …
Let be the maximum running time of the -bootstrap process over all initial -uniform hypergraphs on vertices. The paper gives a quadratic lower bound for th…
Let be a critical -dimensional family, meaning that its stable directions satisfy the criticality condition, and let be the critical length at i…
Let be fixed with , and let be the two-dimensional torus. In the Bradonjić–Saniee bootstrap percolation model on the random geometric graph ,…
Let be fixed with , and let denote the threshold for the appearance of large local, symmetrically distributed infectious outbreak…
Let be fixed with , and let be the random geometric graph in the Bradonjić–Saniee bootstrap percolation model, with initially infected set , fi…
Let be a finite family defining two-dimensional -Ising dynamics. A finite set of stable directions determines a -droplet when…
Consider the -completion dynamics on , in which copies of missing one edge are iteratively completed, with initial graph having edges whe…
Critical-family universality conjecture. As , either
Let be a critical update family with an infinite number of stable directions. Let denote the vacancy probability, let be the infection time at the origi…
For the -bootstrap percolation model, let denote its critical probability and let denote the supremum of the directional criti…
Let be an -unrooted and unbalanced critical two-dimensional update family with difficulty . Let denote the vacancy density and let be th…
For integers and parameters , consider the functions aris…
Noise sensitivity conjecture. For any , the event is noise sensitive.
Let be fixed, and let be the graph with vertex set in which two vertices are adjacent when they differ in exactly one coordinate. For the -neighbour…
Higher-dimensional universality conjecture. begin{enumerate} item If is subcritical, then
Fix an integer and let be a -dimensional update family. For , define the half-space … and the stable set … Let be Lebesgue measur…
Density-of-the-closure conjecture. For every , there exists a constant such that converges in probability to as .