Packing dimers to maximum occupancy under soft-core constraints

DOI10.1007/978-3-031-92935-9_18MaRDI QIDQ6902101zbMATH OpenFDO

Authors Robert D. Barish, Tetsuo Shibuya

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_18

zbMATH Keywords

\#Pcounting complexitydimer modelHafnianpermanentquantum dimer modelsoft constraint dimer modelsoft-core dimer model

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A deterministic almost-linear time algorithm for minimum-cost flow
• A note on the occupational degeneracy for dimers on a saturated two- dimensional lattice space
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• Analytic combinatorics
• Combinatorial and topological approach to the 3D Ising model
• Dimer problem in statistical mechanics-an exact result
• Graph theory
• Graph theory with applications
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• Inapproximability of the Tutte polynomial of a planar graph
• Matchings in graphs on non-orientable surfaces
• Maximum flow and minimum-cost flow in almost-linear time
• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
• On the theory of Pfaffian orientations. I: Perfect matchings and permanents
• Parameterizing the permanent: genus, apices, minors, evaluation \(\operatorname{mod} 2^k\)
• The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
• The complexity of counting edge colorings for simple graphs
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Theory of monomer-dimer systems

This page was built for publication: Packing dimers to maximum occupancy under soft-core constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902101)