Triangle Percolation on the Grid

MaRDI QIDQ6509369arXivFDO

Authors Igor Araujo, Bryce Frederickson, Robert A. Krueger, Bernard Lidický, Tyrrell B. McAllister, Florian Pfender, Sam Spiro, Eric Stucky

Published in arXiv

Abstract: We consider a geometric percolation process partially motivated by recent work of Hejda and Kala. Specifically, we start with an initial set $Xsubseteqmathbb{Z}^2$, and then iteratively check whether there exists a triangle $Tsubseteqmathbb{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.

This page was built for publication: Triangle Percolation on the Grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509369)