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[7] we define the Temperley–Lieb Hamiltonian (the TL Hamiltonian) as

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[8]
 |
 |
 |
 |
| 2 |
(1) |
3 |
(1, 1) |
| 4 |
(2, 1) |
5 |
 |
| 6 |
 |
7 |
 |
| 8 |
 |
9 |
 |
 |
 |
 |
 |
where we have used the notation
-times e.g.,
.
An interesting observation is that the largest components of the ground state of
have a combinatorial enumeration as we vary the number of sites,[9] as was first observed by Murray Batchelor, Jan de Gier and Bernard Nienhuis.[8] 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.