On the entropy of spanning trees on a large triangular lattice

DOI10.1007/S11139-005-4847-9zbMATH Open1079.05007arXivcond-mat/0309198OpenAlexW1983430787MaRDI QIDQ2583523FDOQ2583523

Authors: Yanyan Li 

Publication date: 17 January 2006

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

Abstract: The double integral representing the entropy S_{tri} of spanning trees on a large triangular lattice is evaluated using two different methods, one algebraic and one graphical. Both methods lead to the same result S_{tri} = [1/(2 Pi)]^2 int_0^{2 Pi} d heta int_0^{2 Pi} dphi ln [6-2 cos( heta) - 2 cos(phi) -2 cos( heta+phi)] = [3(sqrt 3)/Pi](1 - 5^{-2} + 7^{-2} - 11^{-2} + 13^{-2} - ...)

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

Recommendations

• Spanning trees on two-dimensional lattices with more than one type of vertex
• High-precision entropy values for spanning trees in lattices
• Spanning trees on lattices and integral identities
• Some exact results for spanning trees on lattices
• Spanning trees on graphs and lattices inddimensions

zbMATH Keywords

dilogarithm

Mathematics Subject Classification ID

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

Cites Work

• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Statistical Mechanics of Dimers on a Plane Lattice
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
• Spanning trees on graphs and lattices inddimensions
• Spanning trees on hypercubic lattices and nonorientable surfaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equivalence of the Potts model or Whitney polynomial with an ice-type model

Cited In (8)

• DIMERS ON TWO-DIMENSIONAL LATTICES
• On the vertex-face graphs of triangulations
• Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
• Renormalization flow for unrooted forests on a triangular lattice
• Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\)
• Mixing time and eigenvalues of the abelian sandpile Markov chain
• Enumeration of spanning trees of graphs with rotational symmetry
• Title not available (Why is that?)

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

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