| Abstract |
We consider a geometric percolation process partially motivated by recent work of Hejda and Kala. Specifically, we start with an initial set , and then iteratively check whether there exists a triangle with its vertices in such that T contains exactly four points of 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. |
| Authors |
Igor Araujo  , Bryce Frederickson , Robert A. Krueger , Bernard Lidický , Tyrrell B. McAllister  , Florian Pfender , Sam Spiro , Eric Stucky
|
| Journal Info |
Springer Science+Business Media | Discrete & Computational Geometry
|
| Publication Date |
4/25/2024 |
| ISSN |
0179-5376 |
Type |
article |
| Open Access |
closed
|
| DOI |
https://doi.org/10.1007/s00454-024-00645-x |
| Keywords |
Percolation Models (Score: 0.72567) , Scaling Limits (Score: 0.531004) , Interacting Particle Systems (Score: 0.527414) , Teichmüller Curves (Score: 0.520364) , Gaussian Free Fields (Score: 0.516912)
|
