























Abstract:We study a bootstrap percolation process on $\mathbb{Z}^d$ where each newly occupied point completes a copy of one of the patterns in some fixed collection $\mathcal{A}$. We aim, given $\mathcal{A}$, to find the smallest size of a percolating seed. We show that, for two patterns in two dimensions, in essence the answer is given by the mixed volume of the patterns' convex hulls. Our motivation for studying this setup comes from the theory of partial difference equations. Conversely, our considerations yield one consistency criterion for systems of two partial difference equations in two dimensions.
From: Nikolai Beluhov [view email]
[v1]
Mon, 15 Jun 2026 13:53:07 UTC (23 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。