The growth constant of odd cutsets in high dimensions
Abstract
A cutset is a non-empty finite subset of Zd which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of Zd. Peled suggested that the number of odd cutsets which contain the origin and have n boundary edges may be of order e(n/d) as d ∞, much smaller than the number of general cutsets, which was shown by Lebowitz and Mazel to be of order d(n/d). In this paper, we verify this by showing that the number of such odd cutsets is (2+o(1))n/2d.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.