The energy of the alphabet model (Q2364605)

The ABC model is a stochastic lattice gas having particles of three types: A, B and C, evolving on a lattice. The authors introduce an alphabet model, on a one-dimensional ring, which is a generalization of the ABC model to the case with \(N\) types of particles. Particles that are at the two extremes of a bond of the lattice can exchange their positions and the rate at which this happens depends only on the configuration restricted to the bond and not on the structure of the configuration on different sites. The reversibility conditions are discussed. It is shown how to encode much of the information about the interactions among the particles with a tournament having vertices labeled by the type of particles. The energy of the alphabet model is written in terms of long range two-body interactions. It is proved that the reversible alphabet models are in correspondence with strongly connected tournaments. It is shown that the possible minimizers of the energy are in correspondence with the Hamiltonian cycles of the associated tournament. This gives a probabilistic proof of the known Camion theorem. In the case of an equal number of \(k\) types of particles, new representations of the Hamiltonians in terms of translation-invariant \(k\)-body long-range interactions are obtained. For small values of \(k\), the numbers of minimizers of energy are found.