Three-Neighbour Bootstrap Percolation in Thin Three-Dimensional Grids
math.CO
Submitted: 2025-09-16
Updated: 2026-11-05
Comments: 7 pages, plus appendix with several figures
License: http://creativecommons.org/licenses/by-sa/4.0/
The gist: We improve the status of the problem of determining minimum-sized percolating sets in a times b times c grids under the 3-neighbour process.
Terminology
Abstract
We improve the status of the problem of determining minimum-sized percolating sets in a times b times c grids under the 3-neighbour process. Using several new constructions, we show that optimal percolating sets exist whenever (a,b,c) at least 7. As an important step toward this, we also show that all grids with (a,b,c) at least 4 have a percolating set whose size exactly achieves the lower bound (ab+ac+bc)/3 whenever this value is an integer.
Sources
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality