Theory of monomer-dimer systems

From MaRDI portal
Revision as of 05:23, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2549706

DOI10.1007/BF01877590zbMath0228.05131OpenAlexW4244121195MaRDI QIDQ2549706

Ole J. Heilmann, Elliott H. Lieb

Publication date: 1972

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01877590





Related Items (only showing first 100 items - show all)

Counting matchings via capacity-preserving operatorsOn the Tutte and Matching Polynomials for Complete GraphsApproximating real-rooted and stable polynomials, with combinatorial applicationsFinite-size corrections for the attractive mean-field monomer-dimer modelA Most General Edge Elimination PolynomialMatchings in regular graphs: minimizing the partition functionA unified approach to multivariate polynomial sequences with real stabilityExclusion statistics and thermodynamics of a straight \(k\)-mers lattice-gas: analytical approximation and Monte Carlo simulationsMatching Energy of Graphs with Maximum Degree at Most 3Combinatorics. Abstracts from the workshop held January 1--7, 2023Independent set and matching permutationsEnumeration of maximum matchings in the Hanoi graphs using matching polynomialsThe matching polynomials of hypergraphs and weighted hypergraphsGap sets for the spectra of cubic graphsDisordered monomer-dimer model on cylinder graphsOn real-rootedness of independence polynomials of rooted products of graphsEquivariant log-concavity of graph matchingsFree boundary dimers: random walk representation and scaling limitGeneral position polynomialsZeros, chaotic ratios and the computational complexity of approximating the independence polynomialInteractions of computational complexity theory and mathematicsConvergence of graphs with intermediate densitySignatures, Lifts, and Eigenvalues of GraphsA note on the multiplicities of the eigenvalues of a graphHoste’s conjecture for generalized Fibonacci polynomialsA relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphsApproximating permanents and hafniansSTATISTICAL MECHANICS OF EQUILIBRIUM AND NONEQUILIBRIUM PHASE TRANSITIONS: THE YANG–LEE FORMALISMAsymptotic enumeration of Latin rectanglesMonomer-dimer problem on random planar honeycomb latticeAnalytic results -- lattice and continuumA mean-field monomer-dimer model with attractive interaction: Exact solution and rigorous resultsAsymptotic enumeration of Latin rectanglesA novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative typesAsymptotic normality of the coefficients of polynomials associated with the Gegenbauer onesCounting over non-planar graphsUnnamed ItemUnnamed ItemThe independent set sequence of some families of treesOpen problems in the spectral theory of signed graphsLog-concave poset inequalitiesTrees with real rooted independence polynomialsChristoffel–Darboux Type Identities for the Independence PolynomialDecay of correlations in the monomer-dimer modelThe matching polynomial of the path-tree of a complete graphThe number of spanning trees and maximum matchings of Fibonacci graphsUnimodality of independence polynomials of rooted products of graphsThe Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applicationsDevelopments in the theory of graph spectraCONFIGURATIONAL ENTROPY IN GENERALIZED LATTICE-GAS MODELSMatrix permanent and quantum entanglement of permutation invariant statesThe complexity of approximating the complex-valued Potts modelUnimodality of the independence polynomials of some composite graphsGauges, loops, and polynomials for partition functions of graphical modelsThe Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree GraphsFibonacci graphs possessing identical matching polynomialsLee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphsOn the roots of domination polynomial of graphsA cluster expansion approach to the Heilmann-Lieb liquid crystal modelCentral limit theorems, Lee-Yang zeros, and graph-counting polynomialsQ-counting rook configurations and a formula of FrobeniusPositivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphsMonomer-dimer problem on some networksClique cover products and unimodality of independence polynomialsAsymptotic normality of some graph sequencesThe Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stabilityA Pfaffian formula for monomer-dimer partition functionsUnimodality of independence polynomials of the incidence product of graphsBuilding graphs whose independence polynomials have only real rootsOn some counting polynomials in chemistryInteracting dimers on a Sierpinski gasketCentral and local limit theorems for the coefficients of polynomials associated with the Laguerre onesFractional v. integral covers in hypergraphs of bounded edge sizeLimit theorems for monomer-dimer mean-field models with attractive potentialThe matching polynomial of a polygraphOn the adjacency spectra of hypertreesTight bounds on the algebraic connectivity of Bethe treesOn the spectra of some weighted rooted trees and applicationsThe spectra of a graph obtained from copies of a generalized Bethe treeA survey on recurrence relations for the independence polynomial of hypergraphsMulticomplexes and polynomials with real zerosMatchings in benzene chainsOn the location of roots of independence polynomialsGraphs with few matching rootsThe nematic phase of a system of long hard rodsDual rook polynomialsThe roots of the independence polynomial of a clawfree graphMatchings on infinite graphsOn the unimodality of independence polynomials of some graphsEnumeration of matchings in families of self-similar graphsGeneralizing Tutte's theorem and maximal non-matchable graphsRamanujan coverings of graphsHigh-activity expansion for the columnar phase of the hard rectangle gasMatching measure, Benjamini-Schramm convergence and the monomer-dimer free energySublinear-time algorithms for monomer-dimer systems on bounded degree graphsMean-field limit and phase transitions for nematic liquid crystals in the continuumSolution of the monomer-dimer model on locally tree-like graphs. Rigorous resultsThe number of maximum matchings in a treeBenjamini-Schramm continuity of root moments of graph polynomialsMehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs




Cites Work




This page was built for publication: Theory of monomer-dimer systems