A Nearest-Neighbor Hard-Core Model on a Penrose Graph

Abstract

We prove that the maximal graph-density of an independent set in a Penrose P3 tiling considered as a planar non-directed graph is equal to (57 - 25 5)/2 ≈ 0.54915 despite the fact that the graph is bipartite. Accordingly, the extreme Gibbs measure of the nearest-neighbor hard core particle model on this graph is unique for sufficiently large values of the particle activity. This invalidates a natural expectation to observe the coexistence of even and odd phases.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…