Home Physical Sciences Spanning Trees of the Generalised Union Jack Lattice
Article
Licensed
Unlicensed Requires Authentication

Spanning Trees of the Generalised Union Jack Lattice

  • Lingyun Chen and Weigen Yan EMAIL logo
Published/Copyright: March 4, 2016

Abstract

The Union Jack lattice UJL(n, m) with toroidal boundary condition can be obtained from an n×m square lattice with toroidal boundary condition by inserting a new vertex vf to each face f and adding four edges (vf, ui(f)), where u1(f), u2(f), u3(f), and u4(f) are four vertices on the boundary of f. The Union Jack lattice has been studied extensively by statistical physicists. In this article, we consider the problem of enumeration of spanning trees of the so-called generalised Union Jack lattice UDn, which is obtained from the Aztec diamond ADnt of order n with toroidal boundary condition by inserting a new vertex vf to each face f and adding four edges (vf, ui(f)), where u1(f), u2(f), u3(f) and u4(f) are four vertices on the boundary of f.


Corresponding author: Weigen Yan, Jimei University, School of Sciences, #183, Yingjiang Road, Xiamen, Fujian 361021, China, E-mail:

Acknowledgments

We are grateful to the anonymous referees for many friendly and helpful revising suggestions. The second author was supported in part by NSFC Grant (11171134, 11571139).

References

[1] C. Fan and F. Y. Wu, Phys. Rev. B 2, 723 (1970).10.1103/PhysRevB.2.723Search in Google Scholar

[2] R. Shrock and S-H. Tsai, Phys. Rev. E 56, 4111 (1997).10.1103/PhysRevE.56.4111Search in Google Scholar

[3] F. Y. Wu and K. Y. Lin, J. Phys. A 20, 5737 (1987).10.1088/0305-4470/20/16/049Search in Google Scholar

[4] F. Y. Wu and K. Y. Lin, J. Phys. A 22, 1121 (1989).10.1088/0305-4470/22/8/025Search in Google Scholar

[5] N. Elkies, G. Kuperberg, M. Larsen, and J. Propp, J. Alg. Combin. 1, 111, 219 (1992).10.1023/A:1022483817303Search in Google Scholar

[6] M. Ciucu, Discrete Math. 307, 1957 (2007).10.1016/j.disc.2006.10.006Search in Google Scholar

[7] H. Hosoya, Comp. Maths. with Appls. 12B, 271 (1986).10.1016/B978-0-08-033986-3.50025-2Search in Google Scholar

[8] M. Ciucu, J. Combin. Theory A 81, 34 (1998).10.1006/jcta.1997.2799Search in Google Scholar

[9] E. H. Kuo, Theor. Comput. Sci. 319, 29 (2004).10.1016/j.tcs.2004.02.022Search in Google Scholar

[10] W. G. Yan and F. J. Zhang, J. Combin. Theory A 110, 113 (2005).10.1016/j.jcta.2004.10.005Search in Google Scholar

[11] S. P. Eu and T. S. Fu, Electron. J. Combin. 12, R18 (2005).10.37236/1915Search in Google Scholar

[12] R. Brualdi and S. Kirkland, J. Combin. Theory B 94, 334 (2005).10.1016/j.jctb.2005.02.001Search in Google Scholar

[13] R. P. Stanley, Spanning Trees of Aztec Diamonds, Open Problem Presented at DIMACS Meeting on Formal Power Series and Algebraic Combinatorics, Piscataway, NJ, May 23–27, 1994.Search in Google Scholar

[14] D. E. Knuth, J. Alg. Combin. 6, 253 (1997).10.1023/A:1008605912200Search in Google Scholar

[15] G. Z. Yu, Discrete Math. 311, 38 (2011).10.1016/j.disc.2010.09.018Search in Google Scholar

[16] R. Shrock and F. Y. Wu, J. Phys. A 33, 3881 (2000).10.1088/0305-4470/33/21/303Search in Google Scholar

[17] S. Li, W. Yan, and T. Tian, J. Stat. Mech. P04014 (2015).10.1088/1742-5468/2015/04/P04014Search in Google Scholar

[18] N. L. Biggs, Algebraic Graph Theory, 2nd ed., Cambridge University Press, Cambridge, UK 1993.Search in Google Scholar

[19] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Elsevier, New York 1976.10.1007/978-1-349-03521-2Search in Google Scholar

[20] E. Teufl and S. Wagner, Linear Algebra Appl. 432, 441 (2010).10.1016/j.laa.2009.08.028Search in Google Scholar

[21] E. Teufl and S. Wagner, J. Phys. A 43, 415001 (2010).10.1088/1751-8113/43/41/415001Search in Google Scholar

Received: 2015-10-6
Accepted: 2016-2-8
Published Online: 2016-3-4
Published in Print: 2016-4-1

©2016 by De Gruyter

Downloaded on 19.12.2025 from https://www.degruyterbrill.com/document/doi/10.1515/zna-2015-0415/pdf
Scroll to top button