On the entropy of spanning trees on a large triangular lattice

DOI10.1007/s11139-005-4847-9zbMath1079.05007arXivcond-mat/0309198OpenAlexW1983430787MaRDI QIDQ2583523

Yanyan Li

Publication date: 17 January 2006

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0309198

zbMATH Keywords

dilogarithm

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Asymptotic enumeration (05A16) Higher logarithm functions (33B30)

Related Items (6)

Enumeration of spanning trees of graphs with rotational symmetry ⋮ Renormalization flow for unrooted forests on a triangular lattice ⋮ Unnamed Item ⋮ Mixing time and eigenvalues of the abelian sandpile Markov chain ⋮ Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\) ⋮ DIMERS ON TWO-DIMENSIONAL LATTICES

Cites Work

• Unnamed Item
• Unnamed Item
• Spanning trees on hypercubic lattices and nonorientable surfaces
• The statistics of dimers on a lattice
• Statistical Mechanics of Dimers on a Plane Lattice
• Equivalence of the Potts model or Whitney polynomial with an ice-type model
• Spanning trees on graphs and lattices inddimensions
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem

This page was built for publication: On the entropy of spanning trees on a large triangular lattice