Temperley–Lieb algebra

In statistical mechanics, the Temperley–Lieb algebra is an algebra from which are built certain transfer matrices, invented by Neville Temperley and Elliott Lieb. It is also related to integrable models, knot theory and the braid group, quantum groups and subfactors of von Neumann algebras.

Definition

Let be a commutative ring and fix . The Temperley–Lieb algebra is the -algebra generated by the elements , subject to the Jones relations:

  • for all
  • for all
  • for all
  • for all such that

may be represented diagrammatically as the vector space over noncrossing pairings on a rectangle with n points on two opposite sides. The five basis elements of are the following:

.

Multiplication on basis elements can be performed by placing two rectangles side by side, and replacing any closed loops by a factor of , for example:

× = = .

The identity element is the diagram in which each point is connected to the one directly across the rectangle from it, and the generator is the diagram in which the -th point is connected to the -th point, the -th point is connected to the -th point, and all other points are connected to the point directly across the rectangle. The generators of are:

From left to right, the unit 1 and the generators U1, U2, U3, U4.

The Jones relations can be seen graphically:

=

=

=

The Temperley–Lieb Hamiltonian

Consider an interaction-round-a-face model e.g. a square lattice model and let be the number of sites on the lattice. Following Temperley and Lieb[1] we define the Temperley–Lieb Hamiltonian (the TL Hamiltonian) as

Applications

In what follows we consider the special case .

We will firstly consider the case . The TL Hamiltonian is , namely

= 2 - - .

We have two possible states,

and .

In acting by on these states, we find

= 2 - - = - ,

and

= 2 - - = - + .

Writing as a matrix in the basis of possible states we have,

The eigenvector of with the lowest eigenvalue is known as the ground state. In this case, the lowest eigenvalue for is . The corresponding eigenvector is . As we vary the number of sites we find the following table[2]

2 (1) 3 (1, 1)
4 (2, 1) 5
6 7
8 9

where we have used the notation -times e.g., .

Combinatorial Properties

An interesting observation is that the largest components of the ground state of have a combinatorial enumeration as we vary the number of sites,[3] as was first observed by Murray Batchelor, Jan de Gier and Bernard Nienhuis.[2] Using the resources of the on-line encyclopedia of integer sequences, Batchelor et al. found, for an even numbers of sites

and for an odd numbers of sites

Surprisingly, these sequences corresponded to well known combinatorial objects. For even, this (sequence A051255 in the OEIS) corresponds to cyclically symmetric transpose complement plane partitions and for odd, (sequence A005156 in the OEIS), these correspond to alternating sign matrices symmetric about the vertical axis.

gollark: Yes it does. I program for funlolz.
gollark: Rob Pike even attacked *syntax highlighting* for being childish.
gollark: I mean, they're gaining generics *now*, very late, but they just have this apious attitude of disregarding every development in computing in the last 50 years and claiming it's because programmers can't be trusted to use them right.
gollark: lol no generics
gollark: Hmm. quintopia is older than I thought. Troubling.

References

  1. Temperley, Neville; Lieb, Elliott (1971). "Relations between the 'percolation' and 'colouring' problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the 'percolation' problem". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 322 (1549): 251–280. doi:10.1098/rspa.1971.0067. JSTOR 77727. MR 0498284.
  2. Batchelor, Murray; de Gier, Jan; Nienhuis, Bernard (2001). "The quantum symmetric chain at , alternating-sign matrices and plane partitions". Journal of Physics A. 34 (19): L265–L270. arXiv:cond-mat/0101385. doi:10.1088/0305-4470/34/19/101. MR 1836155.
  3. de Gier, Jan (2005). "Loops, matchings and alternating-sign matrices". Discrete Mathematics. 298 (1–3): 365–388. arXiv:math/0211285. doi:10.1016/j.disc.2003.11.060. MR 2163456.

Further reading

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.