The Number of Independent Sets in Hexagonal Graphs
Abstract
A new method is proposed to derive rigorous bounds on η, the growth rate of the logarithm of the number of independent sets on a hexagonal lattice. Specifically, we prove that 1.546440708536001 <= η <= 1.5513, which improves upon the best known 1.5463 <= η <= 1.5527 due to Nagy and Zeger. Our lower bound matches the numerical estimate of Baxter up to 9 digits after the decimal point.
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.