Universality and Exact Finite-Size Corrections for Spanning Trees on Cobweb and Fan Networks

• Main Authors: Nickolay Izmailian, Ralph Kenna
• Format: Article
• Language: English
• Published: MDPI AG 2019-09-01
• Series: Entropy
• Subjects: universality; corrections to scaling; corners; spanning tree; cobwebm fan; Ivashkevich-Izmailian-Hu algorithm
• Online Access: https://www.mdpi.com/1099-4300/21/9/895

The concept of universality is a cornerstone of theories of critical phenomena. It is very well understood in most systems, especially in the thermodynamic limit. Finite-size systems present additional challenges. Even in low dimensions, universality of the edge and corner contributions to free energies and response functions is less investigated and less well understood. In particular, the question arises of how universality is maintained in correction-to-scaling in systems of the same universality class but with very different corner geometries. Two-dimensional geometries deliver the simplest such examples that can be constructed with and without corners. To investigate how the presence and absence of corners manifest universality, we analyze the spanning tree generating function on two different finite systems, namely the cobweb and fan networks. The corner free energies of these configurations have stimulated significant interest precisely because of expectations regarding their universal properties and we address how this can be delivered given that the finite-size cobweb has no corners while the fan has four. To answer, we appeal to the Ivashkevich&#8722;Izmailian&#8722;Hu approach which unifies the generating functions of distinct networks in terms of a single partition function with twisted boundary conditions. This unified approach shows that the contributions to the individual corner free energies of the fan network sum to zero so that it precisely matches that of the web. It therefore also matches conformal theory (in which the central charge is found to be <inline-formula> <math display="inline"> <semantics> <mrow> <mi>c</mi> <mo>=</mo> <mo>&#8722;</mo> <mn>2</mn> </mrow> </semantics> </math> </inline-formula>) and finite-size scaling predictions. Correspondence in each case with results established by alternative means for both networks verifies the soundness of the Ivashkevich&#8722;Izmailian&#8722;Hu algorithm. Its broad range of usefulness is demonstrated by its application to hitherto unsolved problems&#8212;namely the exact asymptotic expansions of the logarithms of the generating functions and the conformal partition functions for fan and cobweb geometries. We also investigate strip geometries, again confirming the predictions of conformal field theory. Thus, the resolution of a universality puzzle demonstrates the power of the algorithm and opens up new applications in the future.