Triangle Percolation on the Grid
Preprint
Abstract
We consider a geometric percolation process partially motivated by recent work of Hejda and Kala. Specifically, we start with an initial set $X \subseteq \mathbb{Z}^2$, and then iteratively check whether there exists a triangle $T \subseteq \mathbb{R}^2$ with its vertices in $\mathbb{Z}^2$ such that $T$ contains exactly four points of $\mathbb{Z}^2$ and exactly three points of $X$. In this case, we add the missing lattice point of $T$ to $X$, and we repeat until no such triangle exists. We study the limit sets $S$, the sets stable under this process, including determining their possible densities and some of their structure.
Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Subcritical monotone cellular automataRandom Structures & Algorithms, 2023
- There are no universal ternary quadratic forms over biquadratic fieldsProceedings of the Edinburgh Mathematical Society, 2020
- Additive structure of totally positive quadratic integersmanuscripta mathematica, 2019
- Line percolationRandom Structures & Algorithms, 2018
- Number fields without n-ary universal quadratic formsMathematical Proceedings of the Cambridge Philosophical Society, 2015
- Monotone Cellular Automata in a Random EnvironmentCombinatorics, Probability and Computing, 2015
- Linear algebra and bootstrap percolationJournal of Combinatorial Theory, Series A, 2012
- Bootstrap Percolation on Infinite Trees and Non-Amenable GroupsCombinatorics, Probability and Computing, 2006
- Sharp thresholds in Bootstrap percolationPhysica A: Statistical Mechanics and its Applications, 2003
- Zur Zerlegung totalpositiver Zahlen in Ordnungen totalreeller algebraischer Zahlk rperArchiv der Mathematik, 1983