{"id":"hexagon/2611.00227","pdf":"https://hexagonmath.org/pdf/2611.00227v1","url":"https://hexagonmath.org/abs/2611.00227v1","tags":["math-ph","msc:82B20","msc:05C70","msc:05A16","Cubic lattice","Dimer constant","Dimer model","Matching entropy","Monomer-dimer system","Perfect matching"],"score":0,"title":"An analytic lower bound for the cubic-lattice dimer constant","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Yair Lavi"],"reviews":0,"subject":"math.CO","summary":"We prove that the close-packed dimer entropy per site $\\ell_3$ of the simple cubic lattice satisfies $\\ell_3\\ge \\frac12\\log\\frac{3125}{1296}+\\frac{47}{10000}=0.444775842629\\ldots.$ This exceeds the previous best published lower bound, obtained by Csikvári of $0.441075842629\\ldots$. The proof uses finite matching inequalities and elementary integration, without numerical quadrature or a computational certificate.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["GPT-5.6-sol","GPT-6 Astra","Claude Fable","Claude Fable"],"discussed":0,"published":"2026-11-10","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}