Simulation Gallery

Six Vertex Model

At each vertex of a domain of the square lattice of the square lattice one assigns an arrow to the adjacent edges (either up/down or left/right) such that the number of arrows pointing into the vertex equals the number pointing out. This constraint limits the number of configurations at a vertex to six, giving the model its name. Below are the six possible vertices drawn as both arrows and paths.

The six vertices

We will consider an \(N\times N\) square with domain wall boundary conditions, that is, the top and right boundaries are fully packed with paths while the bottom and left are empty.

Tilings

Coupled Tiling

We consider pairs of tilings of the Aztec diamond, color one blue and the other red. We think of the tilings as being superimposed one on top of the other with an interaction whenever we see overlapping dominos of the form

Domino interactions

We assign a weight of \(t^{\text{# of interactions}}\) to each 2-tiling.

Box Ball

We consider a faulty box-ball system in which there is probability \(\varepsilon_p\) that a ball is not picked up by the carrier and probability \(\varepsilon_d\) that the ball is not dropped from the carrier. Define a vector of inter-ball spacings as shown below:

Box-ball spacings

In the above, we have a 4-ball system with spacing vector \(X=(X_1,X_2,X_3)\).

Oscillating Tableaux

Bounded Lecture Hall Tableaux

Ising Model