Monomer-dimer problem on random planar honeycomb lattice

DOI10.1063/1.4866317MaRDI QIDQ5414765zbMATH OpenOpenAlexFDO

Authors Haizhen Ren, Fuji Zhang, Jianguo Qian

Publication date 7 May 2014

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.4866317

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Statistical mechanics of polymers (82D60) Statistical mechanics of nanostructures and nanoparticles (82D80)

Recommendations

• On the monomer-dimer problem of some graphs
• Dimers belonging to three orientations on plane honeycomb lattices
• Random sampling for the monomer-dimer model on a lattice.
• Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
• An asymptotic expansion and recursive inequalities for the monomer-dimer problem

Cites work

• scientific article; zbMATH DE number 3856167 (Why is no real title available?)
• scientific article; zbMATH DE number 4083659 (Why is no real title available?)
• scientific article; zbMATH DE number 3583866 (Why is no real title available?)
• scientific article; zbMATH DE number 3238621 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• A polynomial-time approximation algorithm for the number of \(k\)-matchings in bipartite graphs
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• Approximating the Permanent
• Approximating the number of monomer-dimer coverings of a lattice.
• Approximating the permanent via importance sampling with application to the dimer covering problem
• Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices
• Dimer problem in statistical mechanics-an exact result
• Dimers on a simple-quartic net with a vacancy
• Discrete Lyapunov exponents and Hausdorff dimension
• Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets
• Majorization, doubly stochastic matrices, and comparison of eigenvalues
• Matching theory
• On the monomer-dimer problem of some graphs
• Statistical Mechanics of Dimers on a Plane Lattice
• Statistical Mechanics of Dimers on a Plane Lattice. II. Dimer Correlations and Monomers
• The Complexity of Enumeration and Reliability Problems
• The number of matchings in random graphs
• The pressure, densities and first-order phase transitions associated with multidimensional SOFT
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
• Theory of monomer-dimer systems

Cited in

(10)

• Monomer-dimer problem on some networks
• Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
• On the monomer-dimer problem of some graphs
• Using edge generating function to solve monomer-dimer problem
• Trimer-monomer mixture problem on \((111)\) \(1\times 1\) surface of diamond structure
• Random sampling for the monomer-dimer model on a lattice.
• Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
• Dimers belonging to three orientations on plane honeycomb lattices
• The monomer-dimer problem and moment Lyapunov exponents of homogeneous Gaussian random fields
• Dimer–monomer model on the Towers of Hanoi graphs

This page was built for publication: Monomer-dimer problem on random planar honeycomb lattice

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