Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 24 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 209 tok/s Pro
GPT OSS 120B 458 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Transfer matrix for spanning trees, webs and colored forests (1405.0436v1)

Published 2 May 2014 in cond-mat.stat-mech, hep-th, math-ph, and math.MP

Abstract: We use the transfer matrix formalism for dimers proposed by Lieb, and generalize it to address the corresponding problem for arrow configurations (or trees) associated to dimer configurations through Temperley's correspondence. On a cylinder, the arrow configurations can be partitioned into sectors according to the number of non-contractible loops they contain. We show how Lieb's transfer matrix can be adapted in order to disentangle the various sectors and to compute the corresponding partition functions. In order to address the issue of Jordan cells, we introduce a new, extended transfer matrix, which not only keeps track of the positions of the dimers, but also propagates colors along the branches of the associated trees. We argue that this new matrix contains Jordan cells.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.